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.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

An alternative approach to solve convergence problems in the backpropagation algorithm

The multilayer perceptron network has become one of the most used in the solution of a wide variety of problems. The training process is based on the supervised method where the inputs are presented to the neural network and the output is compared with a desired value. However, the algorithm presents convergence problems when the desired output of the network has small slope in the discrete time samples or the output is a quasi-constant value. The proposal of this paper is presenting an alternative approach to solve this convergence problem with a pre-conditioning method of the desired output data set before the training process and a post-conditioning when the generalization results are obtained. Simulations results are presented in order to validate the proposed approach.

Simple orbit determination using GPS based on a least-squares algorithm employing sequential givens rotations

A low-cost computer procedure to determine the orbit of an artificial satellite by using short arc data from an onboard GPS receiver is proposed. Pseudoranges are used as measurements to estimate the orbit via recursive least squares method. The algorithm applies orthogonal Givens rotations for solving recursive and sequential orbit determination problems. To assess the procedure, it was applied to the TOPEX/POSEIDON satellite for data batches of one orbital period (approximately two hours), and force modelling, due to the full JGM-2 gravity field model, was considered. When compared with the reference Precision Orbit Ephemeris (POE) of JPL/NASA, the results have indicated that precision better than 9 m is easily obtained, even when short batches of data are used. Copyright (c) 2007.

Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

A modified ant colony optimization algorithm modeled on tabu-search methods

An earlier model underlying the foraging strategy of a pachycodyla apicalis ant is modified. The proposed algorithm incorporates key features of the tabu-search method in the development of a relatively simple but robust global ant colony optimization algorithm. Numerical results are reported to validate and demonstrate the feasibility and effectiveness of the proposed algorithm in solving electromagnetic (EM) design problems.

ALTERNATIVE SAMPLING STRATEGY FOR A RANDOM OPTIMIZATION ALGORITHM

Alternative sampling procedures are compared to the pure random search method. It is shown that the efficiency of the algorithm can be improved with respect to the expected number of steps to reach an epsilon-neighborhood of the optimal point.

Quantitative estimates of time-averaging in terebratulid brachiopod shell accumulations from a modern tropical shelf

Quantitative estimates of time-averaging in marine shell accumulations available to date are limited primarily to aragonitic mollusk shells. We assessed time-averaging in Holocene assemblages of calcitic brachiopod shells by direct dating of individual specimens of the terebratulid brachiopod Bouchardia rosea. The data were collected from exceptional (brachiopod-rich) shell assemblages, occurring surficially on a tropical mixed carbonate-siliciclastic shelf (the Southeast Brazilian Bight, SW Atlantic), a setting that provides a good climatic and environmental analog for many Paleozoic brachiopod shell beds of North America and Europe. A total of 82 individual brachiopod shells, collected from four shallow (5-25 m) nearshore (<2.5 km from the shore) localities, were dated by using amino acid racemization (D-alloisoleucine/L-isoleucine value) calibrated with five AMS-radiocarbon dates (r(2) = 0.933). This is the first study to demonstrate that amino acid racemization methods can provide accurate and precise ages for individual shells of calcitic brachiopods.The dated shells vary in age from modern to 3000 years, with a standard deviation of 690 years. The age distribution is strongly right-skewed: the young shells dominate the dated specimens and older shells are increasingly less common. However, the four localities display significant differences in the range of time-averaging and the form of the age distribution. The dated shells vary notably in the quality of preservation, but there is no significant correlation between taphonomic condition and age, either for individual shells or at assemblage level.These results demonstrate that fossil brachiopods may show considerable time-averaging, but the scale and nature of that mixing may vary greatly among sites. Moreover, taphonomic condition is not a reliable indicator of pre-burial history of individual brachiopod shells or the scale of temporal mixing within the entire assemblage. The results obtained for brachiopods are strikingly similar to results previously documented for mollusks and suggest that differences in mineralogy and shell microstructure are unlikely to be the primary factors controlling the nature and scale of time-averaging. Environmental factors and local fluctuations in populations of shell-producing organisms are more likely to be the principal determinants of time-averaging in marine benthic shelly assemblages. The long-term survival of brachiopod shells is incongruent with the rapid shell destruction observed in taphonomic experiments. The results support the taphonomic model that shells remain protected below (but perhaps near) the surface through their early taphonomic history. They may be brought back up to the surface intermittently by bioturbation and physical reworking, but only for short periods of time. This model explains the striking similarities in time-averaging among different types of organisms and the lack of correlation between time-since-death and shell taphonomy.

Application of a new reverse Monte Carlo algorithm to polyatomic molecular systems. I. Liquid water

Using a new reverse Monte Carlo algorithm, we present simulations that reproduce very well several structural and thermodynamic properties of liquid water. Both Monte Carlo, molecular dynamics simulations and experimental radial distribution functions used as input are accurately reproduced using a small number of molecules and no external constraints. Ad hoc energy and hydrogen bond analysis show the physical consistency and limitations of the generated RMC configurations. (C) 2001 American Institute of Physics.

An evolutionary algorithm for the one-dimensional cutting stock problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Location and contract pricing of distributed generation using a genetic algorithm

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

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.