A cost optimization-based design of precast concrete floors using genetic algorithms

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

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

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.

Integrable approximation to the overlap of resonances

We study the interaction of resonances with the same order in families of integrable Hamiltonian systems. This can occur when the unperturbed Hamiltonian is at least cubic in the actions. An integrable perturbation coupling the action-angle variables leads to the disappearance of an island through the coalescence of stable and unstable periodic orbits and originates a complex orbit plus an isolated cubic resonance. The chaotic layer that appears when a general term is added to the Hamiltonian survives even after the disappearance of the unstable periodic orbit. © 1992.

Modelling of the influence of the layer pollution thickness in high voltage polluted insulators

An experimental model and a mathematical model with the introduction of a ramp in the channel of Obenaus model are presented. The aim is to present a better reproduction of the real layer pollution deposited on the HV insulators. This better reproduction is obtained from two types of thickness variation: the introduction of a ramp (soft variation) and the introduction of a step (sudden variation). The computational simulations and the experimental data suggest that the introduction of the ramp is the better reproduction of the layer pollution. The ramp approximates to the real layer pollution more than the step.

Interaction potential between vortex lines for uniaxial superconductors in the London approximation

Two distinct expressions of the interaction potential between arbitrarily oriented curved vortex lines with respect to the crystal c axis are derived within the London approximation. One of these expressions is used to compute the eigenvalues of the elasticity matrix. We examine the elastic properties of the vortex chain lattice, recently proposed, concerning shearing deformation.

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Three-dimensional reconstruction of fracture surfaces: Area matching algorithms for automatic parallax measurements

This paper describes two solutions for systematic measurement of surface elevation that can be used for both profile and surface reconstructions for quantitative fractography case studies. The first one is developed under Khoros graphical interface environment. It consists of an adaption of the almost classical area matching algorithm, that is based on cross-correlation operations, to the well-known method of parallax measurements from stereo pairs. A normalization function was created to avoid false cross-correlation peaks, driving to the true window best matching solution at each region analyzed on both stereo projections. Some limitations to the use of scanning electron microscopy and the types of surface patterns are also discussed. The second algorithm is based on a spatial correlation function. This solution is implemented under the NIH Image macro programming, combining a good representation for low contrast regions and many improvements on overall user interface and performance. Its advantages and limitations are also presented.

Nonforward parton distributions of the pion within an effective single instanton approximation

We develop a relativistic quark model for pion structure, which incorporates the nontrivial structure of the vacuum of quantum chromodynamics as modelled by instantons. Pions are bound states of quarks and the strong quark-pion vertex is determined from an instanton induced effective Lagrangian. The interaction of the constituents of the pion with the external electromagnetic field is introduced in gauge invariant form. The parameters of the model, i.e., effective instanton radius and constituent quark mass, are obtained from the vacuum expectation values of the lowest dimensional quark and gluon operators and the low-energy observables of the pion. We apply the formalism to the calculation of the pion form factor by means of the isovector nonforward parton distributions and find agreement with the experimental data. © 2000 Elsevier Science B.V.

Off-Diagonal Quark Distributions in Pions in the Effective Single-Instanton Approximation

Nonperturbative functions that parametrize off-diagonal hadronic matrix elements of the light-cone leading-twist quark operators are considered. These functions are calculated within the proposed relativistic quark model allowing for the nontrivial structure of the QCD vacuum, special attention being given to gauge invariance. Hadrons are treated as bound states of quarks; strong-interaction quark-pion vertices are described by effective interaction Lagrangians generated by instantons. The parameters of the instanton vacuum, such as the effective radius of the instanton and the quark mass, are related to the vacuum expectation values of the quark-gluon operators of the lowest dimension and to low-energy pion observables. © 2000 MAIK Nauka/Interperiodica.

Effect of anharmonicities in the critical number of trapped condensed atoms with an attractive two-body interaction

The quantitative effect in the maximum number of particles and other static observables was determined. A deviation in the harmonic trap potential that is effective only outside the central part of the potential, with the addition of a term that is proportional to a cubic or quartic power of the distance was considered. Results showed that this study could be easily transferred to other trap geometries to estimate anharmonic effects.

Distribution line models analysis for loss calculation within three-phase three-wire power flow algorithms

Three-phase three-wire power flow algorithms, as any tool for power systems analysis, require reliable impedances and models in order to obtain accurate results. Kron's reduction procedure, which embeds neutral wire influence into phase wires, has shown good results when three-phase three-wire power flow algorithms based on current summation method were used. However, Kron's reduction can harm reliabilities of some algorithms whose iterative processes need loss calculation (power summation method). In this work, three three-phase three-wire power flow algorithms based on power summation method, will be compared with a three-phase four-wire approach based on backward-forward technique and current summation. Two four-wire unbalanced medium-voltage distribution networks will be analyzed and results will be presented and discussed. © 2004 IEEE.

Influence of the supply of reactive power in the calculation of the transfer capability

This paper presents some initial concepts for including reactive power in linear methods for computing Available Transfer Capability (ATC). It is proposed an approximation for the reactive power flows computation that uses the exact circle equations for the transmission line complex flow, and then it is determined the ATC using active power distribution factors. The transfer capability can be increased using the sensitivities of flow that show the best group of buses which can have their reactive power injection modified in order to remove the overload in the transmission lines. The results of the ATC computation and of the use of the sensitivities of flow are presented using the Cigré 32-bus system. © 2004 IEEE.

Comparison of algorithms for loss allocation in transmission networks considering power redispatch

An analysis of the performances of three important methods for generators and loads loss allocation is presented. The discussed methods are: based on pro-rata technique; based on the incremental technique; and based on matrices of circuit. The algorithms are tested considering different generation conditions, using a known electric power system: IEEE 14 bus. Presented and discussed results verify: the location and the magnitude of generators and loads; the possibility to have agents well or poorly located in each network configuration; the discriminatory behavior considering variations in the power flow in the transmission lines. © 2004 IEEE.

Planning of secondary distribution circuits through evolutionary algorithms

In this work, the planning of secondary distribution circuits is approached as a mixed integer nonlinear programming problem (MINLP). In order to solve this problem, a dedicated evolutionary algorithm (EA) is proposed. This algorithm uses a codification scheme, genetic operators, and control parameters, projected and managed to consider the specific characteristics of the secondary network planning. The codification scheme maps the possible solutions that satisfy the requirements in order to obtain an effective and low-cost projected system-the conductors' adequate dimensioning, load balancing among phases, and the transformer placed at the center of the secondary system loads. An effective algorithm for three-phase power flow is used as an auxiliary methodology of the EA for the calculation of the fitness function proposed for solutions of each topology. Results for two secondary distribution circuits are presented, whereas one presents radial topology and the other a weakly meshed topology. © 2005 IEEE.