Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees. (C) 2009 Elsevier B.V. All rights reserved.

Genetic variability and identification of the intermediate snail hosts of Schistosoma mansoni

Studies based on shell or reproductive organ morphology and genetic considerations suggest extensive intraspecific variation in Biomphalaria snails. The high variability at the morphological and genetic levels, as well as the small size of some specimens and similarities between species complicate the correct identification of these snails. Here we review our work using methods based on polymerase chain reaction (PCR) amplification for analysis of genetic variation and identification of Biomphalaria snails from Brazil, Argentina, Uruguay and Paraguay. Arbitrarily primed-PCR revealed that the genome of B. glabrata exihibits a remarkable degree of intraespecific polymorphism. Low stringency-PCR using primers for 18S rRNA permited the identification of B. glabrata, B. tenagophila and B. occidentalis. The study of individuals obtained from geographically distinct populations exhibits significant intraspecific DNA polymorphism, however specimens from the same species, exhibit some species specific LSPs. We also showed that PCR-restriction fragment of length polymorphism of the internal transcribed spacer region of Biomphalaria rDNA, using DdeI permits the differentiation of the three intermediate hosts of Schistosoma mansoni. The molecular biological techniques used in our studies are very useful for the generation of new knowledge concerning the systematics and population genetics of Biomphalaria snails.

Evolutionary computing in search-based software engineering

This master’s thesis aims to study and represent from literature how evolutionary algorithms are used to solve different search and optimisation problems in the area of software engineering. Evolutionary algorithms are methods, which imitate the natural evolution process. An artificial evolution process evaluates fitness of each individual, which are solution candidates. The next population of candidate solutions is formed by using the good properties of the current population by applying different mutation and crossover operations. Different kinds of evolutionary algorithm applications related to software engineering were searched in the literature. Applications were classified and represented. Also the necessary basics about evolutionary algorithms were presented. It was concluded, that majority of evolutionary algorithm applications related to software engineering were about software design or testing. For example, there were applications about classifying software production data, project scheduling, static task scheduling related to parallel computing, allocating modules to subsystems, N-version programming, test data generation and generating an integration test order. Many applications were experimental testing rather than ready for real production use. There were also some Computer Aided Software Engineering tools based on evolutionary algorithms.

Differential Evolution approach and parameter estimation of chaotic

Parameter estimation still remains a challenge in many important applications. There is a need to develop methods that utilize achievements in modern computational systems with growing capabilities. Owing to this fact different kinds of Evolutionary Algorithms are becoming an especially perspective field of research. The main aim of this thesis is to explore theoretical aspects of a specific type of Evolutionary Algorithms class, the Differential Evolution (DE) method, and implement this algorithm as codes capable to solve a large range of problems. Matlab, a numerical computing environment provided by MathWorks inc., has been utilized for this purpose. Our implementation empirically demonstrates the benefits of a stochastic optimizers with respect to deterministic optimizers in case of stochastic and chaotic problems. Furthermore, the advanced features of Differential Evolution are discussed as well as taken into account in the Matlab realization. Test "toycase" examples are presented in order to show advantages and disadvantages caused by additional aspects involved in extensions of the basic algorithm. Another aim of this paper is to apply the DE approach to the parameter estimation problem of the system exhibiting chaotic behavior, where the well-known Lorenz system with specific set of parameter values is taken as an example. Finally, the DE approach for estimation of chaotic dynamics is compared to the Ensemble prediction and parameter estimation system (EPPES) approach which was recently proposed as a possible solution for similar problems.

Identification of flexural stiffness parameters of beams

A three degree of freedom model of the dynamic mass at the middle of a test sample, resembling a Stockbridge neutraliser, is introduced. This model is used to identify the hereby called equivalent complex cross section flexural stiffness (ECFS) of the beam element which is part of the whole test sample. This ECFS, once identified, gives the effective cross section flexural stiffness of the beam as well as its effective damping, measured as the loss factor of an equivalent viscoelastic beam. The beam element of the test sample may be of any complexity, such as a segment of stranded cable of the ACSR type. These data are important parameters for the design of overhead power transmission lines and other cable structures. A cost function is defined and used in the identification of the ECFS. An experiment, designed to measure the dynamic masses of two test samples, is described. Experimental and identified results are presented and discussed.

Identification of Flexural Stiffness Parameters of Beams

A three degree of freedom model of the dynamic mass at the middle of a test sample, resembling a Stockbridge neutraliser, is introduced. This model is used to identify the hereby called equivalent complex cross section flexural stiffness (ECFS) of the beam element which is part of the whole test sample. This ECFS, once identified, gives the effective cross section flexural stiffness of the beam as well as its effective damping, measured as the loss factor of an equivalent viscoelastic beam. The beam element of the test sample may be of any complexity, such as a segment of stranded cable of the ACSR type. These data are important parameters for the design of overhead power transmission lines and other cable structures. A cost function is defined and used in the identification of the ECFS. An experiment, designed to measure the dynamic masses of two test samples, is described. Experimental and identified results are presented and discussed.

Evolving Classifiers - Evolutionary Algorithms in Data Mining

Data mining means to summarize information from large amounts of raw data. It is one of the key technologies in many areas of economy, science, administration and the internet. In this report we introduce an approach for utilizing evolutionary algorithms to breed fuzzy classifier systems. This approach was exercised as part of a structured procedure by the students Achler, Göb and Voigtmann as contribution to the 2006 Data-Mining-Cup contest, yielding encouragingly positive results.

Selfish genetic elements favor the evolution of a distinction between soma and germline

Many multicellular organisms have evolved a dedicated germline. This can benefit the whole organism, but its advantages to genetic parasites have not been explored. Here I model the evolutionary success of a selfish element, such as a transposable element or endosymbiont, which is capable of creating or strengthening a germline-soma distinction in a primitively multicellular host, and find that it will always benefit the element to do so. Genes causing germline sequestration can therefore spread in a population even if germline sequestration is maladaptive for the host organism. Costly selfish elements are expected to survive only in sexual populations, so sexual species may experience an additional push toward germline-soma distinction, and hence toward cell differentiation and multicellularity.

Bayesian inference in genetic parameter estimation of visual scores in Nellore beef-cattle

The aim of this study was to estimate the components of variance and genetic parameters for the visual scores which constitute the Morphological Evaluation System (MES), such as body structure (S), precocity (P) and musculature (M) in Nellore beef-cattle at the weaning and yearling stages, by using threshold Bayesian models. The information used for this was gleaned from visual scores of 5,407 animals evaluated at the weaning and 2,649 at the yearling stages. The genetic parameters for visual score traits were estimated through two-trait analysis, using the threshold animal model, with Bayesian statistics methodology and MTGSAM (Multiple Trait Gibbs Sampler for Animal Models) threshold software. Heritability estimates for S, P and M were 0.68, 0.65 and 0.62 (at weaning) and 0.44, 0.38 and 0.32 (at the yearling stage), respectively. Heritability estimates for S, P and M were found to be high, and so it is expected that these traits should respond favorably to direct selection. The visual scores evaluated at the weaning and yearling stages might be used in the composition of new selection indexes, as they presented sufficient genetic variability to promote genetic progress in such morphological traits.

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.

On the efficiency of an alternative codification for multiobjective service restoration in electric distribution networks

This paper proposes an alternative codification to solve the service restoration in electric power distribution networks using a SPEA2 multiobjective evolutionary algorithm, assuming the minimization of both the load not supplied and the number of switching operations involved in the restoration plan. Constrains as the line, power source and voltage drop limits in order to avoid the activation of protective devices are all included in the proposed algorithm. Experimental results have shown the convenience on considering these new representations in the sense of feasibility maintenance and also in the sense of better approximation to the Pareto set. ©2009 IEEE.

Vibration and oil analysis for monitoring problems related to water contamination in rolling

Trying to reduce particle contamination in lubrication systems, industries of the whole world spend millions of dollars each year on the improvement of filtration technology. In this context, by controlling fluid cleanliness, some companies are able to reduce failures rates up to 85 percent. However, in some industries and environments, water is a contaminant more frequently encountered than solid particles, and it is often seen as the primary cause of component failure. Only one percent of water in oil is enough to reduce life expectancy of a journal bearing by 80 percent. For rolling bearing elements, the situation is worse because water destroys the oil film and, under the extreme temperatures and pressures generated in the load zone of a rolling bearing element, free and emulsified water can result in instantaneous flash-vaporization giving origin to erosive wear. This work studies the effect of water as lubricant contaminant in ball bearings, which simulates a situation that could actually occur in real systems. In a designed bench test, three basic lubricants of different viscosities were contaminated with different contents of water. The results regarding oil and vibration analysis are presented for different bearing speeds.

Cálculo de equivalentes dinâmicos de sistema de potência usando algoritmos genéticos

Esta dissertação apresenta um método baseado em algoritmos genéticos para cálculo de equivalentes dinâmicos de sistemas de potência visando representar partes de um sistema para estudos de análise de estabilidade transitória. O modelo do equivalente dinâmico é obtido por meio da identificação de parâmetros de geradores síncronos, localizados nas barras de fronteira entre o sistema externo e o subsistema em estudo. Um indicie é usado para avaliar a proximidade entre as simulações realizadas usando o modelo completo e o modelo reduzido, após serem submetidos a grandes distúrbios no subsistema em estudo. Diferentes condições operacionais foram levadas em conta. As simulações foram realizadas usando os softwares GAOT “The Genetic Algorithm Optimization Toolbox”, ANAREDE e ANATEM. Esse método foi testado no sistema teste duas áreas do Kundur e no Sistema Interligado Nacional (SIN). Os resultados validaram a eficácia do método desenvolvido para o cálculo de equivalentes dinâmicos robustos.

A memetic algorithm for the delineation of local labour markets

Given a territory composed of basic geographical units, the delineation of local labour market areas (LLMAs) can be seen as a problem in which those units are grouped subject to multiple constraints. In previous research, standard genetic algorithms were not able to find valid solutions, and a specific evolutionary algorithm was developed. The inclusion of multiple ad hoc operators allowed the algorithm to find better solutions than those of a widely-used greedy method. However, the percentage of invalid solutions was still very high. In this paper we improve that evolutionary algorithm through the inclusion of (i) a reparation process, that allows every invalid individual to fulfil the constraints and contribute to the evolution, and (ii) a hillclimbing optimisation procedure for each generated individual by means of an appropriate reassignment of some of its constituent units. We compare the results of both techniques against the previous results and a greedy method.

Grouping genetic operators for the delineation of functional areas based on spatial interaction

The delineation of functional economic areas, or market areas, is a problem of high practical relevance, since the delineation of functional sets such as economic areas in the US, Travel-to-Work Areas in the United Kingdom, and their counterparts in other OECD countries are the basis of many statistical operations and policy making decisions at local level. This is a combinatorial optimisation problem defined as the partition of a given set of indivisible spatial units (covering a territory) into regions characterised by being (a) self-contained and (b) cohesive, in terms of spatial interaction data (flows, relationships). Usually, each region must reach a minimum size and self-containment level, and must be continuous. Although these optimisation problems have been typically solved through greedy methods, a recent strand of the literature in this field has been concerned with the use of evolutionary algorithms with ad hoc operators. Although these algorithms have proved to be successful in improving the results of some of the more widely applied official procedures, they are so time consuming that cannot be applied directly to solve real-world problems. In this paper we propose a new set of group-based mutation operators, featuring general operations over disjoint groups, tailored to ensure that all the constraints are respected during the operation to improve efficiency. A comparative analysis of our results with those from previous approaches shows that the proposed algorithm systematically improves them in terms of both quality and processing time, something of crucial relevance since it allows dealing with most large, real-world problems in reasonable time.