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.

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.

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

Distribution Transformer Modeling for Application in Three-Phase Power Flow Algorithm

In this paper, it is presented a methodology for three-phase distribution transformer modeling, considering several types of transformer configuration, to be used in algorithms of power flow in three-phase radial distribution networks. The paper provides a detailed discussion about the models and the results from an implementation of the power flow algorithm. The results, taken from three different networks, are presented for several transformer configurations and for voltage regulators as well.

An implementation of modified scatter search algorithm to transmission expansion planning

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

Another prefiltering algorithm for adaptive IIR filtering

An algorithm for adaptive IIR filtering that uses prefiltering structure in direct form is presented. This structure has an estimation error that is a linear function of the coefficients. This property greatly simplifies the derivation of gradient-based algorithms. Computer simulations show that the proposed structure improves convergence speed.

Resource partitioning among epigaeic and hypogaeic ants (Hymenoptera: Formicidae) of a Brazilian cocoa plantation

Patterns of dietary and foraging strata utilization by the ground ant community of a Brazilian cocoa planatation were examined using sugar, meat and flour baits on the surface as well as buried. A total of 49 ant species was recorded, including 10 species of Pheidole. Strong dominance was exercised by Solenopsis geminata at both surface and subterranean strata, and at all food resources. The dissimilarity matrix of the epigaeic ant fauna was much greater than that for the hypogaeic species. At least four guilds were identified: the fungus-growing ants, epigaeic nectivores, epigaeic carnivores, and hypogaeic foragers. Niche breadth reduction, leading to the formation of guilds, permits the coexistence of many species in the this ground ant community from a tropical cocoa plantation. -Authors

A recursive approach to space resection using straight lines

An approach using straight lines as features to solve the photogrammetric space resection problem is presented. An explicit mathematical model relating straight lines, in both object and image space, is used. Based on this model, Kalman Filtering is applied to solve the space resection problem. The recursive property of the filter is used in an iterative process which uses the sequentially estimated camera location parameters to feedback to the feature extraction process in the image. This feedback process leads to a gradual reduction of the image space for feature searching, and consequently eliminates the bottleneck due to the high computational cost of the image segmentation phase. It also enables feature extraction and the determination of feature correspondence in image and object space in an automatic way, i.e., without operator interference. Results obtained from simulated and real data show that highly accurate space resection parameters are obtained as well as a progressive processing time reduction. The obtained accuracy, the automatic correspondence process, and the short related processing time show that the proposed approach can be used in many real-time machine vision systems, making possible the implementation of applications not feasible until now.

Combining genetic algorithm and simulated annealing: A molecular geometry optimization study

We introduce a new hybrid approach to determine the ground state geometry of molecular systems. Firstly, we compared the ability of genetic algorithm (GA) and simulated annealing (SA) to find the lowest energy geometry of silicon clusters with six and 10 atoms. This comparison showed that GA exhibits fast initial convergence, but its performance deteriorates as it approaches the desired global extreme. Interestingly, SA showed a complementary convergence pattern, in addition to high accuracy. Our new procedure combines selected features from GA and SA to achieve weak dependence on initial parameters, parallel search strategy, fast convergence and high accuracy. This hybrid algorithm outperforms GA and SA by one order of magnitude for small silicon clusters (Si6 and Si10). Next, we applied the hybrid method to study the geometry of a 20-atom silicon cluster. It was able to find an original geometry, apparently lower in energy than those previously described in literature. In principle, our procedure can be applied successfully to any molecular system. © 1998 Elsevier Science B.V.

Transpressional tectonics and strain partitioning during oblique collision between three plates in the Precambrian of southeast Brazil

This paper is part of the special publication Continental transpressional and transtensional tectonics (eds R.E. Holdsworth, R.A. Strachan and J.F. Dewey). Two orogenic belts have been recognized in south- east Brazil, which are interpreted to have been formed as a product of diachronous collisions between three continental plates. Wide crustal-scale shear belts have developed both between and inboard of the collided and amalgamated plate borders. These shear belts record frontal, oblique or lateral displacements during oblique plate convergence and A-type subduction. The overall structural style of each belt depends on the angle subtended between the plate boundary and the convergence vector. The E-W branch between the Sao Paulo and Brasilia plates the Campo do Meio strike-slip shear belt, has undergone dominantly sinistral wrench dominated transpression along a set of folds and shear zones dipping southwards. The NE-SW branch between the Sao Paulo and Vitoria plates, the Paraiba do Sul strike-slip shear belt, has undergone a partitioned dextral transpression, whereas the north-south branch between the Brasilia and Vitoria plates is essentially a frontal thrust system with only a weak component of dextral strike-slip. These complex structural patterns, formed at deep to mid-crustal levels, reflect temporal and spatial partitioning at all scales between flattening and non- coaxial deformation, and down-dip and strike-slip shearing, in tangential as well as in transcurrent structural domains. Additionally, this area demonstrates that regional flower structures, lateral extrusion and other secondary deformations across the yz sections of transpressional belts are important in accommodating shortening in obliquely convergent orogens.

Differential dispersion relations with an arbitrary number of subtractions: A recursive approach

Making use of a recursive approach, derivative dispersion relations are generalized for an arbitrary number of subtractions. The results for both cross even and odd amplitudes are theoretically consistent at sufficiently high energies and in the region of small momentum transfer. © 1999 Published by Elsevier Science B.V. All rights reserved.