Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

Power system transmission network expansion planning using AC model

An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.

STOCHASTIC QUANTIZATION AND 1/N EXPANSION

We study the 1/N expansion of field theories in the stochastic quantization method of Parisi and Wu using the supersymmetric functional approach. This formulation provides a systematic procedure to implement the 1/N expansion which resembles the ones used in the equilibrium. The 1/N perturbation theory for the nonlinear sigma-model in two dimensions is worked out as an example.

Supersymmetric variational energies for the confined Coulomb system

The methodology based on the association of the variational method with supersymmetric quantum mechanics is used to evaluate the energy states of the confined hydrogen atom. (C) 2002 Elsevier B.V. B.V. All rights reserved.

Parallel simulated annealing applied to long term transmission network expansion planning

The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

Transmission system expansion planning by a branch-and-bound algorithm

A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.

An implementation of modified scatter search algorithm to transmission expansion planning

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The δ expansion and the principle of minimal sensitivity

The δ-expansion is a nonperturbative approach for field theoretic models which combines the techniques of perturbation theory and the variational principle. Different ways of implementing the principle of minimal sensitivity to the δ-expansion produce in general different results for observables. For illustration we use the Nambu-Jona-Lasinio model for chiral symmetry restoration at finite density and compare results with those obtained with the Hartree-Fock approximation.

Variational studies and replica symmetry breaking in the generalization problem of the binary perceptron

We analyze the average performance of a general class of learning algorithms for the nondeterministic polynomial time complete problem of rule extraction by a binary perceptron. The examples are generated by a rule implemented by a teacher network of similar architecture. A variational approach is used in trying to identify the potential energy that leads to the largest generalization in the thermodynamic limit. We restrict our search to algorithms that always satisfy the binary constraints. A replica symmetric ansatz leads to a learning algorithm which presents a phase transition in violation of an information theoretical bound. Stability analysis shows that this is due to a failure of the replica symmetric ansatz and the first step of replica symmetry breaking (RSB) is studied. The variational method does not determine a unique potential but it allows construction of a class with a unique minimum within each first order valley. Members of this class improve on the performance of Gibbs algorithm but fail to reach the Bayesian limit in the low generalization phase. They even fail to reach the performance of the best binary, an optimal clipping of the barycenter of version space. We find a trade-off between a good low performance and early onset of perfect generalization. Although the RSB may be locally stable we discuss the possibility that it fails to be the correct saddle point globally. ©2000 The American Physical Society.

Variational calculation of positronium-helium-atom scattering length

A basis-set calculation scheme for S-waves Ps-He elastic scattering below the lowest inelastic threshold was formulated using a variational expression for the transition matrix. The scheme was illustrated numerically by calculating the scattering length in the electronic doublet state: a=1.0±0.1 a.u.

Confined systems through variational supersymmetric quantum mechanics

The energy states of the confined harmonic oscillator and the Hulthén potentials are evaluated using the Variational Method associated to Supersymmetric Quantum Mechanics.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Periodontal effects of rapid maxillary expansion with tooth-tissue-borne and tooth-borne expanders: A computed tomography evaluation

Introduction: The force delivered during rapid maxillary expansion (RME) produces areas of compression on the periodontal ligament of the supporting teeth. The resulting alveolar bone resorption can lead to unwanted tooth movement in the same direction. The purpose of this study was to evaluate periodontal changes by means of computed tomography after RME with tooth-tissue-borne and tooth-borne expanders. Methods: The sample comprised 8 girls, 11 to 14 years old, with Class I or II malocclusions with unilateral or bilateral posterior crossbites Four girls were treated with tooth-tissue-borne Haas-type expanders, and 4 were treated with tooth-borne Hyrax expanders. The appliances were activated up to the full 7-mm capacity of the expansion screw. Spiral CT scans were taken before expansion and after the 3-month retention period when the expander was removed. One-millimeter thick axial sections were exposed parallel to the palatal plane, comprising the dentoalveolar area and the base of the maxilla up to the inferior third of the nasal cavity. Multiplanar reconstruction was used to measure buccal and lingual bone plate thickness and buccal alveolar bone crest level by means of the computerized method. Results and Conclusions: RME reduced the buccal bone plate thickness of supporting teeth 0.6 to 0.9 mm and increased the lingual bone plate thickness 0.8 to 1.3 mm. The increase in lingual bone plate thickness of the maxillary posterior teeth was greater in the tooth-borne expansion group than in the tooth-tissue-borne group. RME induced bone dehiscences on the anchorage teeth's buccal aspect (7.1 ± 4.6 mm at the first premolars and 3.8 ± 4.4 mm at the mesiobuccal area of the first molars), especially in subjects with thinner buccal bone plates. The tooth-borne expander produced greater reduction of first premolar buccal alveolar bone crest level than did the tooth-tissue-borne expander. © 2006 American Association of Orthodontists.

Branch and bound algorithm for transmission network expansion planning using DC model

This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.