WorldWideScience

Sample records for macro-selection evolutionary algorithm

  1. Optimal Mixing Evolutionary Algorithms

    NARCIS (Netherlands)

    Thierens, D.; Bosman, P.A.N.; Krasnogor, N.

    2011-01-01

    A key search mechanism in Evolutionary Algorithms is the mixing or juxtaposing of partial solutions present in the parent solutions. In this paper we look at the efficiency of mixing in genetic algorithms (GAs) and estimation-of-distribution algorithms (EDAs). We compute the mixing probabilities of

  2. Evolutionary Graph Drawing Algorithms

    Institute of Scientific and Technical Information of China (English)

    Huang Jing-wei; Wei Wen-fang

    2003-01-01

    In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the following advantages: the frames of the algorithms are unified, the method is simple, different algorithms may be attained by designing different objective functions, therefore enhance the reuse of the algorithms. Also, aesthetics or constrains may be added to satisfy different requirements.

  3. Diversity-Guided Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Ursem, Rasmus Kjær

    2002-01-01

    Population diversity is undoubtably a key issue in the performance of evolutionary algorithms. A common hypothesis is that high diversity is important to avoid premature convergence and to escape local optima. Various diversity measures have been used to analyze algorithms, but so far few...... algorithms have used a measure to guide the search. The diversity-guided evolutionary algorithm (DGEA) uses the wellknown distance-to-average-point measure to alternate between phases of exploration (mutation) and phases of exploitation (recombination and selection). The DGEA showed remarkable results...

  4. Industrial Applications of Evolutionary Algorithms

    CERN Document Server

    Sanchez, Ernesto; Tonda, Alberto

    2012-01-01

    This book is intended as a reference both for experienced users of evolutionary algorithms and for researchers that are beginning to approach these fascinating optimization techniques. Experienced users will find interesting details of real-world problems, and advice on solving issues related to fitness computation, modeling and setting appropriate parameters to reach optimal solutions. Beginners will find a thorough introduction to evolutionary computation, and a complete presentation of all evolutionary algorithms exploited to solve different problems. The book could fill the gap between the

  5. A Hybrid Chaotic Quantum Evolutionary Algorithm

    DEFF Research Database (Denmark)

    Cai, Y.; Zhang, M.; Cai, H.

    2010-01-01

    A hybrid chaotic quantum evolutionary algorithm is proposed to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm. The proposed algorithm adopts the chaotic initialization method to generate initial population which will form...... and enhance the global search ability. A large number of tests show that the proposed algorithm has higher convergence speed and better optimizing ability than quantum evolutionary algorithm, real-coded quantum evolutionary algorithm and hybrid quantum genetic algorithm. Tests also show that when chaos...... is introduced to quantum evolutionary algorithm, the hybrid chaotic search strategy is superior to the carrier chaotic strategy, and has better comprehensive performance than the chaotic mutation strategy in most of cases. Especially, the proposed algorithm is the only one that has 100% convergence rate in all...

  6. Evolving evolutionary algorithms using linear genetic programming.

    Science.gov (United States)

    Oltean, Mihai

    2005-01-01

    A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.

  7. Convex hull ranking algorithm for multi-objective evolutionary algorithms

    NARCIS (Netherlands)

    Davoodi Monfrared, M.; Mohades, A.; Rezaei, J.

    2012-01-01

    Due to many applications of multi-objective evolutionary algorithms in real world optimization problems, several studies have been done to improve these algorithms in recent years. Since most multi-objective evolutionary algorithms are based on the non-dominated principle, and their complexity depen

  8. Evolutionary algorithms for mobile ad hoc networks

    CERN Document Server

    Dorronsoro, Bernabé; Danoy, Grégoire; Pigné, Yoann; Bouvry, Pascal

    2014-01-01

    Describes how evolutionary algorithms (EAs) can be used to identify, model, and minimize day-to-day problems that arise for researchers in optimization and mobile networking. Mobile ad hoc networks (MANETs), vehicular networks (VANETs), sensor networks (SNs), and hybrid networks—each of these require a designer’s keen sense and knowledge of evolutionary algorithms in order to help with the common issues that plague professionals involved in optimization and mobile networking. This book introduces readers to both mobile ad hoc networks and evolutionary algorithms, presenting basic concepts as well as detailed descriptions of each. It demonstrates how metaheuristics and evolutionary algorithms (EAs) can be used to help provide low-cost operations in the optimization process—allowing designers to put some “intelligence” or sophistication into the design. It also offers efficient and accurate information on dissemination algorithms topology management, and mobility models to address challenges in the ...

  9. Evolutionary algorithms for hard quantum control

    Science.gov (United States)

    Zahedinejad, Ehsan; Schirmer, Sophie; Sanders, Barry C.

    2014-09-01

    Although quantum control typically relies on greedy (local) optimization, traps (irregular critical points) in the control landscape can make optimization hard by foiling local search strategies. We demonstrate the failure of greedy algorithms as well as the (nongreedy) genetic-algorithm method to realize two fast quantum computing gates: a qutrit phase gate and a controlled-not gate. We show that our evolutionary algorithm circumvents the trap to deliver effective quantum control in both instances. Even when greedy algorithms succeed, our evolutionary algorithm can deliver a superior control procedure, for example, reducing the need for high time resolution.

  10. Exploitation of linkage learning in evolutionary algorithms

    CERN Document Server

    Chen, Ying-ping

    2010-01-01

    The exploitation of linkage learning is enhancing the performance of evolutionary algorithms. This monograph examines recent progress in linkage learning, with a series of focused technical chapters that cover developments and trends in the field.

  11. Still doing evolutionary algorithms with Perl

    CERN Document Server

    Guervos, Juan J Merelo

    2009-01-01

    Algorithm::Evolutionary (A::E from now on) was introduced in 2002, after a talk in YAPC::EU in Munich. 7 years later, A::E is in its 0.67 version (past its "number of the beast" 0.666), and has been used extensively, to the point of being the foundation of much of the (computer) science being done by our research group (and, admittedly, not many others). All is not done, however; now A::E is being integrated with POE so that evolutionary algorithms (EAs) can be combined with all kinds of servers and used in client, servers, and anything in between. In this companion to the talk I will explain what evolutionary algorithms are, what they are being used for, how to do them with Perl (using these or other fine modules found in CPAN) and what evolutionary algorithms can do for Perl at large.

  12. Evolutionary algorithm based index assignment algorithm for noisy channel

    Institute of Scientific and Technical Information of China (English)

    李天昊; 余松煜

    2004-01-01

    A globally optimal solution to vector quantization (VQ) index assignment on noisy channel, the evolutionary algorithm based index assignment algorithm (EAIAA), is presented. The algorithm yields a significant reduction in average distortion due to channel errors, over conventional arbitrary index assignment, as confirmed by experimental results over the memoryless binary symmetric channel (BSC) for any bit error.

  13. Automatic design of decision-tree algorithms with evolutionary algorithms.

    Science.gov (United States)

    Barros, Rodrigo C; Basgalupp, Márcio P; de Carvalho, André C P L F; Freitas, Alex A

    2013-01-01

    This study reports the empirical analysis of a hyper-heuristic evolutionary algorithm that is capable of automatically designing top-down decision-tree induction algorithms. Top-down decision-tree algorithms are of great importance, considering their ability to provide an intuitive and accurate knowledge representation for classification problems. The automatic design of these algorithms seems timely, given the large literature accumulated over more than 40 years of research in the manual design of decision-tree induction algorithms. The proposed hyper-heuristic evolutionary algorithm, HEAD-DT, is extensively tested using 20 public UCI datasets and 10 microarray gene expression datasets. The algorithms automatically designed by HEAD-DT are compared with traditional decision-tree induction algorithms, such as C4.5 and CART. Experimental results show that HEAD-DT is capable of generating algorithms which are significantly more accurate than C4.5 and CART.

  14. Termination Criteria in Evolutionary Algorithms: A Survey

    DEFF Research Database (Denmark)

    Ghoreishi, Newsha; Clausen, Anders; Jørgensen, Bo Nørregaard

    2017-01-01

    Over the last decades, evolutionary algorithms have been extensively used to solve multi-objective optimization problems. However, the number of required function evaluations is not determined by nature of these algorithms which is often seen as a drawback. Therefore, a robust and reliable termin...

  15. A Clustal Alignment Improver Using Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Thomsen, Rene; Fogel, Gary B.; Krink, Thimo

    2002-01-01

    Multiple sequence alignment (MSA) is a crucial task in bioinformatics. In this paper we extended previous work with evolutionary algorithms (EA) by using MSA solutions obtained from the wellknown Clustal V algorithm as a candidate solution seed of the initial EA population. Our results clearly show...

  16. Applying Evolutionary Algorithm to Public Key Cryptosystems

    Institute of Scientific and Technical Information of China (English)

    Tu Hang; Li Li; Wu Tao-jun; Li Yuan- xiang

    2003-01-01

    A best algorithm generated scheme is proposed in the paper by making use of the thought of evolutionary algorithm, which can generate dynamically the best algorithm of generating primes in RSA cryptography under different conditions. Taking into account the factors of time, space and security integrated, this scheme possessed strong practicability. The paper also proposed a model of multi degree parallel evolutionary algorithrn to evaluate synthetically the efficiency and security of the public key cryptography. The model con tributes to designing public key cryptography system too.

  17. Infrastructure system restoration planning using evolutionary algorithms

    Science.gov (United States)

    Corns, Steven; Long, Suzanna K.; Shoberg, Thomas G.

    2016-01-01

    This paper presents an evolutionary algorithm to address restoration issues for supply chain interdependent critical infrastructure. Rapid restoration of infrastructure after a large-scale disaster is necessary to sustaining a nation's economy and security, but such long-term restoration has not been investigated as thoroughly as initial rescue and recovery efforts. A model of the Greater Saint Louis Missouri area was created and a disaster scenario simulated. An evolutionary algorithm is used to determine the order in which the bridges should be repaired based on indirect costs. Solutions were evaluated based on the reduction of indirect costs and the restoration of transportation capacity. When compared to a greedy algorithm, the evolutionary algorithm solution reduced indirect costs by approximately 12.4% by restoring automotive travel routes for workers and re-establishing the flow of commodities across the three rivers in the Saint Louis area.

  18. Asynchronous Parallel Evolutionary Algorithms for Constrained Optimizations

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Recently Guo Tao proposed a stochastic search algorithm in his PhD thesis for solving function op-timization problems. He combined the subspace search method (a general multi-parent recombination strategy) with the population hill-climbing method. The former keeps a global search for overall situation,and the latter keeps the convergence of the algorithm. Guo's algorithm has many advantages ,such as the sim-plicity of its structure ,the higher accuracy of its results, the wide range of its applications ,and the robustness of its use. In this paper a preliminary theoretical analysis of the algorithm is given and some numerical experiments has been done by using Guo's algorithm for demonstrating the theoretical results. Three asynchronous paral-lel evolutionary algorithms with different granularities for MIMD machines are designed by parallelizing Guo's Algorithm.

  19. Modified evolutionary algorithm for global optimization

    Institute of Scientific and Technical Information of China (English)

    郭崇慧; 陆玉昌; 唐焕文

    2004-01-01

    A modification of evolutionary programming or evolution strategies for n-dimensional global optimization is proposed. Based on the ergodicity and inherent-randomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase Ⅰ. Adjustment strategy of step-length and intensive searches in Phase Ⅱ are employed.The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.

  20. Flexible Ligand Docking Using Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Thomsen, Rene

    2003-01-01

    The docking of ligands to proteins can be formulated as a computational problem where the task is to find the most favorable energetic conformation among the large space of possible protein–ligand complexes. Stochastic search methods such as evolutionary algorithms (EAs) can be used to sample large...

  1. Knowledge Guided Evolutionary Algorithms in Financial Investing

    Science.gov (United States)

    Wimmer, Hayden

    2013-01-01

    A large body of literature exists on evolutionary computing, genetic algorithms, decision trees, codified knowledge, and knowledge management systems; however, the intersection of these computing topics has not been widely researched. Moving through the set of all possible solutions--or traversing the search space--at random exhibits no control…

  2. Knowledge Guided Evolutionary Algorithms in Financial Investing

    Science.gov (United States)

    Wimmer, Hayden

    2013-01-01

    A large body of literature exists on evolutionary computing, genetic algorithms, decision trees, codified knowledge, and knowledge management systems; however, the intersection of these computing topics has not been widely researched. Moving through the set of all possible solutions--or traversing the search space--at random exhibits no control…

  3. Protein Structure Prediction with Evolutionary Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Hart, W.E.; Krasnogor, N.; Pelta, D.A.; Smith, J.

    1999-02-08

    Evolutionary algorithms have been successfully applied to a variety of molecular structure prediction problems. In this paper we reconsider the design of genetic algorithms that have been applied to a simple protein structure prediction problem. Our analysis considers the impact of several algorithmic factors for this problem: the confirmational representation, the energy formulation and the way in which infeasible conformations are penalized, Further we empirically evaluated the impact of these factors on a small set of polymer sequences. Our analysis leads to specific recommendations for both GAs as well as other heuristic methods for solving PSP on the HP model.

  4. Evolutionary algorithm based configuration interaction approach

    CERN Document Server

    Chakraborty, Rahul

    2016-01-01

    A stochastic configuration interaction method based on evolutionary algorithm is designed as an affordable approximation to full configuration interaction (FCI). The algorithm comprises of initiation, propagation and termination steps, where the propagation step is performed with cloning, mutation and cross-over, taking inspiration from genetic algorithm. We have tested its accuracy in 1D Hubbard problem and a molecular system (symmetric bond breaking of water molecule). We have tested two different fitness functions based on energy of the determinants and the CI coefficients of determinants. We find that the absolute value of CI coefficients is a more suitable fitness function when combined with a fixed selection scheme.

  5. Graphical model construction based on evolutionary algorithms

    Institute of Scientific and Technical Information of China (English)

    Youlong YANG; Yan WU; Sanyang LIU

    2006-01-01

    Using Bayesian networks to model promising solutions from the current population of the evolutionary algorithms can ensure efficiency and intelligence search for the optimum. However, to construct a Bayesian network that fits a given dataset is a NP-hard problem, and it also needs consuming mass computational resources. This paper develops a methodology for constructing a graphical model based on Bayesian Dirichlet metric. Our approach is derived from a set of propositions and theorems by researching the local metric relationship of networks matching dataset. This paper presents the algorithm to construct a tree model from a set of potential solutions using above approach. This method is important not only for evolutionary algorithms based on graphical models, but also for machine learning and data mining.The experimental results show that the exact theoretical results and the approximations match very well.

  6. A Generic Design Model for Evolutionary Algorithms

    Institute of Scientific and Technical Information of China (English)

    He Feng; Kang Li-shan; Chen Yu-ping

    2003-01-01

    A generic design model for evolutionary algo rithms is proposed in this paper. The model, which was described by UML in details, focuses on the key concepts and mechanisms in evolutionary algorithms. The model not only achieves separation of concerns and encapsulation of implementations by classification and abstraction of those concepts,it also has a flexible architecture due to the application of design patterns. As a result, the model is reusable, extendible,easy to understand, easy to use, and easy to test. A large number of experiments applying the model to solve many different problems adequately illustrate the generality and effectivity of the model.

  7. Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms

    CERN Document Server

    Runarsson, Tomas Philip

    2009-01-01

    The art of solving the Mastermind puzzle was initiated by Donald Knuth and is already more than 30 years old; despite that, it still receives much attention in operational research and computer games journals, not to mention the nature-inspired stochastic algorithm literature. In this paper we try to suggest a strategy that will allow nature-inspired algorithms to obtain results as good as those based on exhaustive search strategies; in order to do that, we first review, compare and improve current approaches to solving the puzzle; then we test one of these strategies with an estimation of distribution algorithm. Finally, we try to find a strategy that falls short of being exhaustive, and is then amenable for inclusion in nature inspired algorithms (such as evolutionary or particle swarm algorithms). This paper proves that by the incorporation of local entropy into the fitness function of the evolutionary algorithm it becomes a better player than a random one, and gives a rule of thumb on how to incorporate t...

  8. A Note on Evolutionary Algorithms and Its Applications

    Science.gov (United States)

    Bhargava, Shifali

    2013-01-01

    This paper introduces evolutionary algorithms with its applications in multi-objective optimization. Here elitist and non-elitist multiobjective evolutionary algorithms are discussed with their advantages and disadvantages. We also discuss constrained multiobjective evolutionary algorithms and their applications in various areas.

  9. Cloud-based Evolutionary Algorithms: An algorithmic study

    CERN Document Server

    Merelo, Juan-J; Mora, Antonio M; Castillo, Pedro; Romero, Gustavo; Laredo, JLJ

    2011-01-01

    After a proof of concept using Dropbox(tm), a free storage and synchronization service, showed that an evolutionary algorithm using several dissimilar computers connected via WiFi or Ethernet had a good scaling behavior in terms of evaluations per second, it remains to be proved whether that effect also translates to the algorithmic performance of the algorithm. In this paper we will check several different, and difficult, problems, and see what effects the automatic load-balancing and asynchrony have on the speed of resolution of problems.

  10. Stochastic Evolutionary Algorithms for Planning Robot Paths

    Science.gov (United States)

    Fink, Wolfgang; Aghazarian, Hrand; Huntsberger, Terrance; Terrile, Richard

    2006-01-01

    A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

  11. Intervals in evolutionary algorithms for global optimization

    Energy Technology Data Exchange (ETDEWEB)

    Patil, R.B.

    1995-05-01

    Optimization is of central concern to a number of disciplines. Interval Arithmetic methods for global optimization provide us with (guaranteed) verified results. These methods are mainly restricted to the classes of objective functions that are twice differentiable and use a simple strategy of eliminating a splitting larger regions of search space in the global optimization process. An efficient approach that combines the efficient strategy from Interval Global Optimization Methods and robustness of the Evolutionary Algorithms is proposed. In the proposed approach, search begins with randomly created interval vectors with interval widths equal to the whole domain. Before the beginning of the evolutionary process, fitness of these interval parameter vectors is defined by evaluating the objective function at the center of the initial interval vectors. In the subsequent evolutionary process the local optimization process returns an estimate of the bounds of the objective function over the interval vectors. Though these bounds may not be correct at the beginning due to large interval widths and complicated function properties, the process of reducing interval widths over time and a selection approach similar to simulated annealing helps in estimating reasonably correct bounds as the population evolves. The interval parameter vectors at these estimated bounds (local optima) are then subjected to crossover and mutation operators. This evolutionary process continues for predetermined number of generations in the search of the global optimum.

  12. A theoretical comparison of evolutionary algorithms and simulated annealing

    Energy Technology Data Exchange (ETDEWEB)

    Hart, W.E.

    1995-08-28

    This paper theoretically compares the performance of simulated annealing and evolutionary algorithms. Our main result is that under mild conditions a wide variety of evolutionary algorithms can be shown to have greater performance than simulated annealing after a sufficiently large number of function evaluations. This class of EAs includes variants of evolutionary strategie and evolutionary programming, the canonical genetic algorithm, as well as a variety of genetic algorithms that have been applied to combinatorial optimization problems. The proof of this result is based on a performance analysis of a very general class of stochastic optimization algorithms, which has implications for the performance of a variety of other optimization algorithm.

  13. Evolutionary Algorithm Based on Immune Strategy

    Institute of Scientific and Technical Information of China (English)

    WANG Lei; JIAO Licheng

    2001-01-01

    A novel evolutionary algorithm,evolution-immunity strategies(EIS), is proposed with reference to the immune theory in biology, which constructs an immune operator accomplished by two steps, a vaccination and an immune selection. The aim of introducing the immune concepts and methods into ES is for finding the ways and means obtaining the optimal solution of difficult problems with locally characteristic information. The detail processes of realizing EIS are presented which contain 6 steps. EIS is analyzed with Markovian theory and it is approved to be convergent with probability 1. In EIS, an immune operator is an aggregation of specific operations and procedures, and methods of selecting vaccines and constructing an immune operator are given in this paper. It is shown with an example of the 442-city TSP that the EIS can restrain the degenerate phenomenon during the evolutionary process by simulated calculating result, improve the searching capability and efficiency, and therefore, increase the convergent speed greatly.

  14. Optimization of Evolutionary Neural Networks Using Hybrid Learning Algorithms

    OpenAIRE

    Abraham, Ajith

    2004-01-01

    Evolutionary artificial neural networks (EANNs) refer to a special class of artificial neural networks (ANNs) in which evolution is another fundamental form of adaptation in addition to learning. Evolutionary algorithms are used to adapt the connection weights, network architecture and learning algorithms according to the problem environment. Even though evolutionary algorithms are well known as efficient global search algorithms, very often they miss the best local solutions in the complex s...

  15. Evolutionary algorithms in genetic regulatory networks model

    CERN Document Server

    Raza, Khalid

    2012-01-01

    Genetic Regulatory Networks (GRNs) plays a vital role in the understanding of complex biological processes. Modeling GRNs is significantly important in order to reveal fundamental cellular processes, examine gene functions and understanding their complex relationships. Understanding the interactions between genes gives rise to develop better method for drug discovery and diagnosis of the disease since many diseases are characterized by abnormal behaviour of the genes. In this paper we have reviewed various evolutionary algorithms-based approach for modeling GRNs and discussed various opportunities and challenges.

  16. Hybridizing Evolutionary Algorithms with Opportunistic Local Search

    DEFF Research Database (Denmark)

    Gießen, Christian

    2013-01-01

    There is empirical evidence that memetic algorithms (MAs) can outperform plain evolutionary algorithms (EAs). Recently the first runtime analyses have been presented proving the aforementioned conjecture rigorously by investigating Variable-Depth Search, VDS for short (Sudholt, 2008). Sudholt...... raised the question if there are problems where VDS performs badly. We answer this question in the affirmative in the following way. We analyze MAs with VDS, which is also known as Kernighan-Lin for the TSP, on an artificial problem and show that MAs with a simple first-improvement local search...... outperform VDS. Moreover, we show that the performance gap is exponential. We analyze the features leading to a failure of VDS and derive a new local search operator, coined Opportunistic Local Search, that can easily overcome regions of the search space where local optima are clustered. The power...

  17. Flexible Ligand Docking Using Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Thomsen, Rene

    2003-01-01

    The docking of ligands to proteins can be formulated as a computational problem where the task is to find the most favorable energetic conformation among the large space of possible protein–ligand complexes. Stochastic search methods such as evolutionary algorithms (EAs) can be used to sample large...... search spaces effectively and is one of the commonly used methods for flexible ligand docking. During the last decade, several EAs using different variation operators have been introduced, such as the ones provided with the AutoDock program. In this paper we evaluate the performance of different EA...... settings such as choice of variation operators, population size, and usage of local search. The comparison is performed on a suite of six docking problems previously used to evaluate the performance of search algorithms provided with the AutoDock program package. The results from our investigation confirm...

  18. WEEDS IDENTIFICATION USING EVOLUTIONARY ARTIFICIAL INTELLIGENCE ALGORITHM

    Directory of Open Access Journals (Sweden)

    Ahmed M. Tobal

    2014-01-01

    Full Text Available In a world reached a population of six billion humans increasingly demand it for food, feed with a water shortage and the decline of agricultural land and the deterioration of the climate needs 1.5 billion hectares of agricultural land and in case of failure to combat pests needs about 4 billion hectares. Weeds represent 34% of the whole pests while insects, diseases and the deterioration of agricultural land present the remaining percentage. Weeds Identification has been one of the most interesting classification problems for Artificial Intelligence (AI and image processing. The most common case is to identify weeds within the field as they reduce the productivity and harm the existing crops. Success in this area results in an increased productivity, profitability and at the same time decreases the cost of operation. On the other hand, when AI algorithms combined with appropriate imagery tools may present the right solution to the weed identification problem. In this study, we introduce an evolutionary artificial neural network to minimize the time of classification training and minimize the error through the optimization of the neuron parameters by means of a genetic algorithm. The genetic algorithm, with its global search capability, finds the optimum histogram vectors used for network training and target testing through a fitness measure that reflects the result accuracy and avoids the trial-and-error process of estimating the network inputs according to the histogram data.

  19. Multicriteria Evolutionary Weather Routing Algorithm in Practice

    Directory of Open Access Journals (Sweden)

    Joanna Szlapczynska

    2013-03-01

    Full Text Available The Multicriteria Evolutionary Weather Routing Algorithm (MEWRA has already been introduced by the author on earlier TransNav 2009 and 2011 conferences with a focus on theoretical application to a hybrid-propulsion or motor-driven ship. This paper addresses the topic of possible practical weather routing applications of MEWRA. In the paper some practical advantages of utilizing Pareto front as a result of multicriteria optimization in case of route finding are described. The paper describes the notion of Pareto-optimality of routes along with a simplified, easy to follow, example. It also discusses a choice of the most suitable ranking method for MEWRA (a comparison between Fuzzy TOPSIS and Zero Unitarization Method is presented. In addition to that the paper briefly outlines a commercial application of MEWRA.

  20. Finding Global Minima with a New Dynamical Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is very different from the traditional evolutionary algorithm and the two novel fe-atures are the unique of selecting strategy and the determination of individuals that are selected to crossover and mutate. We use DEA to solve a lot of global optimization problems that are nonlinear, multimodal and multidimensional and obtain satisfactory results.

  1. A backtracking evolutionary algorithm for power systems

    Directory of Open Access Journals (Sweden)

    Chiou Ji-Pyng

    2017-01-01

    Full Text Available This paper presents a backtracking variable scaling hybrid differential evolution, called backtracking VSHDE, for solving the optimal network reconfiguration problems for power loss reduction in distribution systems. The concepts of the backtracking, variable scaling factor, migrating, accelerated, and boundary control mechanism are embedded in the original differential evolution (DE to form the backtracking VSHDE. The concepts of the backtracking and boundary control mechanism can increase the population diversity. And, according to the convergence property of the population, the scaling factor is adjusted based on the 1/5 success rule of the evolution strategies (ESs. A larger population size must be used in the evolutionary algorithms (EAs to maintain the population diversity. To overcome this drawback, two operations, acceleration operation and migrating operation, are embedded into the proposed method. The feeder reconfiguration of distribution systems is modelled as an optimization problem which aims at achieving the minimum loss subject to voltage and current constraints. So, the proper system topology that reduces the power loss according to a load pattern is an important issue. Mathematically, the network reconfiguration system is a nonlinear programming problem with integer variables. One three-feeder network reconfiguration system from the literature is researched by the proposed backtracking VSHDE method and simulated annealing (SA. Numerical results show that the perfrmance of the proposed method outperformed the SA method.

  2. An effective evolutionary algorithm for the multiple container packing problem

    Institute of Scientific and Technical Information of China (English)

    Sang-Moon Soak; Sang-Wook Lee; Gi-Tae Yeo; Moon-Gu Jeon

    2008-01-01

    This paper focuses on a new optimization problem, which is called "The Multiple Container Packing Problem (MCPP)" and proposes a new evolutionary approach for it. The proposed evolutionary approach uses "Adaptive Link Adjustment Evolutionary Algorithm (ALA-EA)" as a basic framework and it incorporates a heuristic local improvement approach into ALA-EA. The first step of the local search algorithm is to raise empty space through the exchange among the packed items and then to improve the fitness value through packing unpacked items into the raised empty space. The second step is to exchange the packed items and the unpacked items one another toward improving the fitness value. The proposed algorithm is compared to the previous evolutionary approaches at the benchmark instances (with the same container capacity) and the modified benchmark instances (with different container capacity) and that the algorithm is proved to be superior to the previous evolutionary approaches in the solution quality.

  3. Comparing evolutionary strategies on a biobjective cultural algorithm.

    Science.gov (United States)

    Lagos, Carolina; Crawford, Broderick; Cabrera, Enrique; Soto, Ricardo; Rubio, José-Miguel; Paredes, Fernando

    2014-01-01

    Evolutionary algorithms have been widely used to solve large and complex optimisation problems. Cultural algorithms (CAs) are evolutionary algorithms that have been used to solve both single and, to a less extent, multiobjective optimisation problems. In order to solve these optimisation problems, CAs make use of different strategies such as normative knowledge, historical knowledge, circumstantial knowledge, and among others. In this paper we present a comparison among CAs that make use of different evolutionary strategies; the first one implements a historical knowledge, the second one considers a circumstantial knowledge, and the third one implements a normative knowledge. These CAs are applied on a biobjective uncapacitated facility location problem (BOUFLP), the biobjective version of the well-known uncapacitated facility location problem. To the best of our knowledge, only few articles have applied evolutionary multiobjective algorithms on the BOUFLP and none of those has focused on the impact of the evolutionary strategy on the algorithm performance. Our biobjective cultural algorithm, called BOCA, obtains important improvements when compared to other well-known evolutionary biobjective optimisation algorithms such as PAES and NSGA-II. The conflicting objective functions considered in this study are cost minimisation and coverage maximisation. Solutions obtained by each algorithm are compared using a hypervolume S metric.

  4. It’s fate : A self-organising evolutionary algorithm

    NARCIS (Netherlands)

    Bim, J.; Karafotias, G.; Smit, S.K.; Eiben, A.E.; Haasdijk, E.

    2012-01-01

    We introduce a novel evolutionary algorithm where the centralized oracle –the selection-reproduction loop– is replaced by a distributed system of Fate Agents that autonomously perform the evolutionary operations. This results in a distributed, situated, and self-organizing EA, where candidate soluti

  5. ADAPTIVE SELECTION OF AUXILIARY OBJECTIVES IN MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS

    Directory of Open Access Journals (Sweden)

    I. A. Petrova

    2016-05-01

    Full Text Available Subject of Research.We propose to modify the EA+RL method, which increases efficiency of evolutionary algorithms by means of auxiliary objectives. The proposed modification is compared to the existing objective selection methods on the example of travelling salesman problem. Method. In the EA+RL method a reinforcement learning algorithm is used to select an objective – the target objective or one of the auxiliary objectives – at each iteration of the single-objective evolutionary algorithm.The proposed modification of the EA+RL method adopts this approach for the usage with a multiobjective evolutionary algorithm. As opposed to theEA+RL method, in this modification one of the auxiliary objectives is selected by reinforcement learning and optimized together with the target objective at each step of the multiobjective evolutionary algorithm. Main Results.The proposed modification of the EA+RL method was compared to the existing objective selection methods on the example of travelling salesman problem. In the EA+RL method and its proposed modification reinforcement learning algorithms for stationary and non-stationary environment were used. The proposed modification of the EA+RL method applied with reinforcement learning for non-stationary environment outperformed the considered objective selection algorithms on the most problem instances. Practical Significance. The proposed approach increases efficiency of evolutionary algorithms, which may be used for solving discrete NP-hard optimization problems. They are, in particular, combinatorial path search problems and scheduling problems.

  6. Ensemble Learning for Free with Evolutionary Algorithms ?

    CERN Document Server

    Gagné, Christian; Schoenauer, Marc; Tomassini, Marco

    2007-01-01

    Evolutionary Learning proceeds by evolving a population of classifiers, from which it generally returns (with some notable exceptions) the single best-of-run classifier as final result. In the meanwhile, Ensemble Learning, one of the most efficient approaches in supervised Machine Learning for the last decade, proceeds by building a population of diverse classifiers. Ensemble Learning with Evolutionary Computation thus receives increasing attention. The Evolutionary Ensemble Learning (EEL) approach presented in this paper features two contributions. First, a new fitness function, inspired by co-evolution and enforcing the classifier diversity, is presented. Further, a new selection criterion based on the classification margin is proposed. This criterion is used to extract the classifier ensemble from the final population only (Off-line) or incrementally along evolution (On-line). Experiments on a set of benchmark problems show that Off-line outperforms single-hypothesis evolutionary learning and state-of-art ...

  7. A New Dynamical Evolutionary Algorithm Based on Statistical Mechanics

    Institute of Scientific and Technical Information of China (English)

    LI YuanXiang(李元香); ZOU XiuFen(邹秀芬); KANG LiShan(康立山); Zbigniew Michalewicz

    2003-01-01

    In this paper, a new dynamical evolutionary algorithm (DEA) is presented basedon the theory of statistical mechanics. The novelty of this kind of dynamical evolutionary algorithmis that all individuals in a population (called particles in a dynamical system) are running andsearching with their population evolving driven by a nev selecting mechanism. This mechanismsimulates the principle of molecular dynamics, which is easy to design and implement. A basictheoretical analysis for the dynamical evolutionary algorithm is given and as a consequence twostopping criteria of the algorithm are derived from the principle of energy minimization and the lawof entropy increasing. In order to verify the effectiveness of the scheme, DEA is applied to solvingsome typical numerical function minimization problems which are poorly solved by traditionalevolutionary algorithms. The experimental results show that DEA is fast and reliable.

  8. Analog Circuit Design Optimization Based on Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Mansour Barari

    2014-01-01

    Full Text Available This paper investigates an evolutionary-based designing system for automated sizing of analog integrated circuits (ICs. Two evolutionary algorithms, genetic algorithm and PSO (Parswal particle swarm optimization algorithm, are proposed to design analog ICs with practical user-defined specifications. On the basis of the combination of HSPICE and MATLAB, the system links circuit performances, evaluated through specific electrical simulation, to the optimization system in the MATLAB environment, for the selected topology. The system has been tested by typical and hard-to-design cases, such as complex analog blocks with stringent design requirements. The results show that the design specifications are closely met. Comparisons with available methods like genetic algorithms show that the proposed algorithm offers important advantages in terms of optimization quality and robustness. Moreover, the algorithm is shown to be efficient.

  9. Towards Automatic Controller Design using Multi-Objective Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Pedersen, Gerulf

    of evolutionary computation, a choice was made to use multi-objective algorithms for the purpose of aiding in automatic controller design. More specifically, the choice was made to use the Non-dominated Sorting Genetic Algorithm II (NSGAII), which is one of the most potent algorithms currently in use......, as the foundation for achieving the desired goal. While working with the algorithm, some issues arose which limited the use of the algorithm for unknown problems. These issues included the relative scale of the used fitness functions and the distribution of solutions on the optimal Pareto front. Some work has...

  10. Species co-evolutionary algorithm: a novel evolutionary algorithm based on the ecology and environments for optimization

    DEFF Research Database (Denmark)

    Li, Wuzhao; Wang, Lei; Cai, Xingjuan

    2015-01-01

    In classic evolutionary algorithms (EAs), solutions communicate each other in a very simple way so the recombination operator design is simple, which is easy in algorithms’ implementation. However, it is not in accord with nature world. In nature, the species have various kinds of relationships...... and affect each other in many ways. The relationships include competition, predation, parasitism, mutualism and pythogenesis. In this paper, we consider the five relationships between solutions to propose a co-evolutionary algorithm termed species co-evolutionary algorithm (SCEA). In SCEA, five operators...... are designed to recombine individuals in population. A set including several classical benchmarks are used to test the proposed algorithm. We also employ several other classical EAs in comparisons. The comparison results show that SCEA exhibits an excellent performance to show a huge potential of SCEA...

  11. A Hybrid Evolutionary Algorithm for Discrete Optimization

    Directory of Open Access Journals (Sweden)

    J. Bhuvana

    2015-03-01

    Full Text Available Most of the real world multi-objective problems demand us to choose one Pareto optimal solution out of a finite set of choices. Flexible job shop scheduling problem is one such problem whose solutions are required to be selected from a discrete solution space. In this study we have designed a hybrid genetic algorithm to solve this scheduling problem. Hybrid genetic algorithms combine both the aspects of the search, exploration and exploitation of the search space. Proposed algorithm, Hybrid GA with Discrete Local Search, performs global search through the GA and exploits the locality through discrete local search. Proposed hybrid algorithm not only has the ability to generate Pareto optimal solutions and also identifies them with less computation. Five different benchmark test instances are used to evaluate the performance of the proposed algorithm. Results observed shown that the proposed algorithm has produced the known Pareto optimal solutions through exploration and exploitation of the search space with less number of functional evaluations.

  12. AN EVOLUTIONARY ALGORITHM FOR THE SOLUTION OF WIND THERMAL DISPATCH

    Directory of Open Access Journals (Sweden)

    K. DHAYALINI

    2013-06-01

    Full Text Available In this paper, optimal wind and thermal generation dispatch is performed by Evolutionary Algorithm approach. To determine the optimal dispatch scheme that can integrate wind power efficiently and reliably into the conventional system, it is necessary to develop a better wind thermal coordination dispatch. In this paper Evolutionary Algorithm approach is used to coordinate the wind and thermal coordination dispatch. Also to minimize the total production cost in the economic dispatch scheme considering the wind power generation and valve point effect of the thermal units. For numerical simulation ten unit systems incorporating one wind power generation is utilized. Economic dispatch scheme with and without wind power production are simulated.

  13. When do evolutionary algorithms optimize separable functions in parallel?

    DEFF Research Database (Denmark)

    Doerr, Benjamin; Sudholt, Dirk; Witt, Carsten

    2013-01-01

    is that evolutionary algorithms make progress on all subfunctions in parallel, so that optimizing a separable function does not take not much longer than optimizing the hardest subfunction-subfunctions are optimized "in parallel." We show that this is only partially true, already for the simple (1+1) evolutionary...... algorithm ((1+1) EA). For separable functions composed of k Boolean functions indeed the optimization time is the maximum optimization time of these functions times a small O(log k) overhead. More generally, for sums of weighted subfunctions that each attain non-negative integer values less than r = o(log1...

  14. Efficient evolutionary algorithms for optimal control

    NARCIS (Netherlands)

    López Cruz, I.L.

    2002-01-01

     If optimal control problems are solved by means of gradient based local search methods, convergence to local solutions is likely. Recently, there has been an increasing interest in the use of global optimisation algorithms to solve optimal control problems, wh

  15. A Hierachical Evolutionary Algorithm for Multiobjective Optimization in IMRT

    CERN Document Server

    Holdsworth, Clay; Liao, Jay; Phillips, Mark H

    2012-01-01

    Purpose: Current inverse planning methods for IMRT are limited because they are not designed to explore the trade-offs between the competing objectives between the tumor and normal tissues. Our goal was to develop an efficient multiobjective optimization algorithm that was flexible enough to handle any form of objective function and that resulted in a set of Pareto optimal plans. Methods: We developed a hierarchical evolutionary multiobjective algorithm designed to quickly generate a diverse Pareto optimal set of IMRT plans that meet all clinical constraints and reflect the trade-offs in the plans. The top level of the hierarchical algorithm is a multiobjective evolutionary algorithm (MOEA). The genes of the individuals generated in the MOEA are the parameters that define the penalty function minimized during an accelerated deterministic IMRT optimization that represents the bottom level of the hierarchy. The MOEA incorporates clinical criteria to restrict the search space through protocol objectives and then...

  16. Hybrid Architectures for Evolutionary Computing Algorithms

    Science.gov (United States)

    2008-01-01

    Clarkson Univ., at AFRL, summer 2005 (yellow) Genetic Algorithm FPGA Core Burns P1026/MAPLD 200524 GA Core Datapath – Top-level Module • EA parameters and...Statistics are read from I/O ports Burns P1026/MAPLD 200525 GA Core Datapath – Population Module • Array of individuals • Population size register...Permutation generator • Current permutation element register • Current index register Burns P1026/MAPLD 200526 GA Core Datapath – PRNG Module • When

  17. Multi-objective gene-pool optimal mixing evolutionary algorithms

    NARCIS (Netherlands)

    Luong, N.H.; La Poutré, J.A.; Bosman, P.A.N.; Igel, C.

    2014-01-01

    The recently introduced Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA), with a lean, but sufficient, linkage model and an efficient variation operator, has been shown to be a robust and efficient methodology for solving single objective (SO) optimization problems with superior performance c

  18. Solution of optimal power flow using evolutionary-based algorithms

    African Journals Online (AJOL)

    This paper applies two reliable and efficient evolutionary-based methods named Shuffled Frog Leaping Algorithm ... Grey Wolf Optimizer (GWO) to solve Optimal Power Flow (OPF) problem. OPF is ..... The wolves search for the prey based on the alpha, beta, and delta positions. ..... Energy Conversion and Management, Vol.

  19. Development of antibiotic regimens using graph based evolutionary algorithms.

    Science.gov (United States)

    Corns, Steven M; Ashlock, Daniel A; Bryden, Kenneth M

    2013-12-01

    This paper examines the use of evolutionary algorithms in the development of antibiotic regimens given to production animals. A model is constructed that combines the lifespan of the animal and the bacteria living in the animal's gastro-intestinal tract from the early finishing stage until the animal reaches market weight. This model is used as the fitness evaluation for a set of graph based evolutionary algorithms to assess the impact of diversity control on the evolving antibiotic regimens. The graph based evolutionary algorithms have two objectives: to find an antibiotic treatment regimen that maintains the weight gain and health benefits of antibiotic use and to reduce the risk of spreading antibiotic resistant bacteria. This study examines different regimens of tylosin phosphate use on bacteria populations divided into Gram positive and Gram negative types, with a focus on Campylobacter spp. Treatment regimens were found that provided decreased antibiotic resistance relative to conventional methods while providing nearly the same benefits as conventional antibiotic regimes. By using a graph to control the information flow in the evolutionary algorithm, a variety of solutions along the Pareto front can be found automatically for this and other multi-objective problems.

  20. Evolutionary Algorithm Geometry Optimization of Optical Antennas

    Directory of Open Access Journals (Sweden)

    Ramón Díaz de León-Zapata

    2016-01-01

    Full Text Available Printed circuit antennas have been used for the detection of electromagnetic radiation at a wide range of frequencies that go from radio frequencies (RF up to optical frequencies. The design of printed antennas at optical frequencies has been done by using design rules derived from the radio frequency domain which do not take into account the dispersion of material parameters at optical frequencies. This can make traditional RF antenna design not suitable for optical antenna design. This work presents the results of using a genetic algorithm (GA for obtaining an optimized geometry (unconventional geometries that may be used as optical regime antennas to capture electromagnetic waves. The radiation patterns and optical properties of the GA generated geometries were compared with the conventional dipole geometry. The characterizations were conducted via finite element method (FEM computational simulations.

  1. Adaptation of an Evolutionary Algorithm in Modeling Electric Circuits

    Directory of Open Access Journals (Sweden)

    J. Hájek

    2010-01-01

    Full Text Available This paper describes the influence of setting control parameters of a differential evolutionary algorithm (DE and the influence of adapting these parameters on the simulation of electric circuits and their components. Various DE algorithm strategies are investigated, and also the influence of adapting the controlling parameters (Cr, F during simulation and the effect of sample size. Optimizing an equivalent circuit diagram is chosen as a test task. Several strategies and settings of a DE algorithm are evaluated according to their convergence to the right solution. 

  2. Improved Quantum-Inspired Evolutionary Algorithm for Engineering Design Optimization

    Directory of Open Access Journals (Sweden)

    Jinn-Tsong Tsai

    2012-01-01

    Full Text Available An improved quantum-inspired evolutionary algorithm is proposed for solving mixed discrete-continuous nonlinear problems in engineering design. The proposed Latin square quantum-inspired evolutionary algorithm (LSQEA combines Latin squares and quantum-inspired genetic algorithm (QGA. The novel contribution of the proposed LSQEA is the use of a QGA to explore the optimal feasible region in macrospace and the use of a systematic reasoning mechanism of the Latin square to exploit the better solution in microspace. By combining the advantages of exploration and exploitation, the LSQEA provides higher computational efficiency and robustness compared to QGA and real-coded GA when solving global numerical optimization problems with continuous variables. Additionally, the proposed LSQEA approach effectively solves mixed discrete-continuous nonlinear design optimization problems in which the design variables are integers, discrete values, and continuous values. The computational experiments show that the proposed LSQEA approach obtains better results compared to existing methods reported in the literature.

  3. Alternative Method for Solving Traveling Salesman Problem by Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Zuzana Čičková

    2008-06-01

    Full Text Available This article describes the application of Self Organizing Migrating Algorithm (SOMA to the well-known optimization problem - Traveling Salesman Problem (TSP. SOMA is a relatively new optimization method that is based on Evolutionary Algorithms that are originally focused on solving non-linear programming problems that contain continuous variables. The TSP has model character in many branches of Operation Research because of its computational complexity; therefore the use of Evolutionary Algorithm requires some special approaches to guarantee feasibility of solutions. In this article two concrete examples of TSP as 8 cities set and 25 cities set are given to demonstrate the practical use of SOMA. Firstly, the penalty approach is applied as a simple way to guarantee feasibility of solution. Then, new approach that works only on feasible solutions is presented.

  4. Comparison of evolutionary algorithms for LPDA antenna optimization

    Science.gov (United States)

    Lazaridis, Pavlos I.; Tziris, Emmanouil N.; Zaharis, Zaharias D.; Xenos, Thomas D.; Cosmas, John P.; Gallion, Philippe B.; Holmes, Violeta; Glover, Ian A.

    2016-08-01

    A novel approach to broadband log-periodic antenna design is presented, where some of the most powerful evolutionary algorithms are applied and compared for the optimal design of wire log-periodic dipole arrays (LPDA) using Numerical Electromagnetics Code. The target is to achieve an optimal antenna design with respect to maximum gain, gain flatness, front-to-rear ratio (F/R) and standing wave ratio. The parameters of the LPDA optimized are the dipole lengths, the spacing between the dipoles, and the dipole wire diameters. The evolutionary algorithms compared are the Differential Evolution (DE), Particle Swarm (PSO), Taguchi, Invasive Weed (IWO), and Adaptive Invasive Weed Optimization (ADIWO). Superior performance is achieved by the IWO (best results) and PSO (fast convergence) algorithms.

  5. Variants of Evolutionary Algorithms for Real-World Applications

    CERN Document Server

    Weise, Thomas; Michalewicz, Zbigniew

    2012-01-01

    Evolutionary Algorithms (EAs) are population-based, stochastic search algorithms that mimic natural evolution. Due to their ability to find excellent solutions for conventionally hard and dynamic problems within acceptable time, EAs have attracted interest from many researchers and practitioners in recent years. This book “Variants of Evolutionary Algorithms for Real-World Applications” aims to promote the practitioner’s view on EAs by providing a comprehensive discussion of how EAs can be adapted to the requirements of various applications in the real-world domains. It comprises 14 chapters, including an introductory chapter re-visiting the fundamental question of what an EA is and other chapters addressing a range of real-world problems such as production process planning, inventory system and supply chain network optimisation, task-based jobs assignment, planning for CNC-based work piece construction, mechanical/ship design tasks that involve runtime-intense simulations, data mining for the predictio...

  6. Iterative Dynamic Diversity Evolutionary Algorithm for Constrained Optimization

    Institute of Scientific and Technical Information of China (English)

    GAO Wei-Shang; SHAO Cheng

    2014-01-01

    Evolutionary algorithms (EAs) were shown to be effective for complex constrained optimization problems. However, inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions. In this paper, we propose an iterative dynamic diversity evolutionary algorithm (IDDEA) with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps. In IDDEA, a novel optimum estimation strategy with multi-agents evolving diversely is suggested to efficiently compute dominance trend and establish a subregion. In addition, a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration, which is based on a special dominance estimation scheme. Meanwhile, an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents. Furthermore, several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.

  7. NEW SYMMETRIC ENCRYPTION SYSTEM BASED ON EVOLUTIONARY ALGORITHM

    Directory of Open Access Journals (Sweden)

    A. Mouloudi

    2015-12-01

    Full Text Available In this article, we present a new symmetric encryption system which is a combination of our ciphering evolutionary system SEC [1] and a new ciphering method called “fragmentation”. This latter allows the alteration of the appearance frequencies of characters from a given text. Our system has at its disposed two keys, the first one is generated by the evolutionary algorithm, the second one is generated after “fragmentation” part. Both of them are symmetric, session keys and strengthening the security of our system.

  8. An efficient non-dominated sorting method for evolutionary algorithms.

    Science.gov (United States)

    Fang, Hongbing; Wang, Qian; Tu, Yi-Cheng; Horstemeyer, Mark F

    2008-01-01

    We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN(2)) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-dominated fronts takes the majority of total computational time (excluding the cost of fitness evaluations) of NSGA-II, making this algorithm faster will significantly improve the overall efficiency of NSGA-II and other genetic algorithms using non-dominated sorting. The new non-dominated sorting algorithm proposed in this study reduces the number of redundant comparisons existing in the algorithm of NSGA-II by recording the dominance information among solutions from their first comparisons. By utilizing a new data structure called the dominance tree and the divide-and-conquer mechanism, the new algorithm is faster than NSGA-II for different numbers of objective functions. Although the number of solution comparisons by the proposed algorithm is close to that of NSGA-II when the number of objectives becomes large, the total computational time shows that the proposed algorithm still has better efficiency because of the adoption of the dominance tree structure and the divide-and-conquer mechanism.

  9. A New Evolutionary Algorithm Based on the Decimal Coding

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Traditional Evolutionary Algorithm (EAs) is based on the binary code, real number code, structure code and so on. But these coding strategies have their own advantages and disadvantages for the optimization of functions. In this paper a new Decimal Coding Strategy (DCS) ,which is convenient for space division and alterable precision, was proposed, and the theory analysis of its implicit parallelism and convergence was also discussed. We also redesign several genetic operators for the decimal code. In order to utilize the historical information of the existing individuals in the process of evolution and avoid repeated exploring,the strategies of space shrinking and precision alterable, are adopted. Finally, the evolutionary algorithm based on decimal coding (DCEAs) was applied to the optimization of functions, the optimization of parameter, mixed-integer nonlinear programming. Comparison with traditional GAs was made and the experimental results show that the performances of DCEAS are better than the tradition GAs.

  10. Interactive evolutionary algorithms and data mining for drug design

    OpenAIRE

    Lameijer, Eric Marcel Wubbo

    2010-01-01

    One of the main problems of drug design is that it is quite hard to discover compounds that have all the required properties to become a drug (efficacy against the disease, good biological availability, low toxicity). This thesis describes the use of data mining and interactive evolutionary algorithms to design novel classes of molecules. Using data mining, we split a 250,000 compound database into ring systems, substituents and linkers. We then counted the occurrence of the different fragmen...

  11. Model-based multiobjective evolutionary algorithm optimization for HCCI engines

    OpenAIRE

    Ma, He; Xu, Hongming; Wang, Jihong; Schnier, Thorsten; Neaves, Ben; Tan, Cheng; Wang, Zhi

    2014-01-01

    Modern engines feature a considerable number of adjustable control parameters. With this increasing number of Degrees of Freedom (DoF) for engines, and the consequent considerable calibration effort required to optimize engine performance, traditional manual engine calibration or optimization methods are reaching their limits. An automated engine optimization approach is desired. In this paper, a self-learning evolutionary algorithm based multi-objective globally optimization approach for a H...

  12. Financial Data Modeling by Using Asynchronous Parallel Evolutionary Algorithms

    Institute of Scientific and Technical Information of China (English)

    Wang Chun; Li Qiao-yun

    2003-01-01

    In this paper, the high-level knowledge of financial data modeled by ordinary differential equations (ODEs) is discovered in dynamic data by using an asynchronous parallel evolutionary modeling algorithm (APHEMA). A numerical example of Nasdaq index analysis is used to demonstrate the potential of APHEMA. The results show that the dynamic models automatically discovered in dynamic data by computer can be used to predict the financial trends.

  13. EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING

    Institute of Scientific and Technical Information of China (English)

    Lei Deming; Wu Zhiming

    2005-01-01

    A new representation method is first presented based on priority rules. According to this method, each entry in the chromosome indicates that in the procedure of the Giffler and Thompson (GT) algorithm, the conflict occurring in the corresponding machine is resolved by the corresponding priority rule. Then crowding-measure multi-objective evolutionary algorithm (CMOEA) is designed,in which both archive maintenance and fitness assignment use crowding measure. Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling.

  14. Analog Group Delay Equalizers Design Based on Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    M. Laipert

    2006-04-01

    Full Text Available This paper deals with a design method of the analog all-pass filter designated for equalization of the group delay frequency response of the analog filter. This method is based on usage of evolutionary algorithm, the Differential Evolution algorithm in particular. We are able to design such equalizers to be obtained equal-ripple group delay frequency response in the pass-band of the low-pass filter. The procedure works automatically without an input estimation. The method is presented on solving practical examples.

  15. Evolutionary algorithm for optimization of nonimaging Fresnel lens geometry.

    Science.gov (United States)

    Yamada, N; Nishikawa, T

    2010-06-21

    In this study, an evolutionary algorithm (EA), which consists of genetic and immune algorithms, is introduced to design the optical geometry of a nonimaging Fresnel lens; this lens generates the uniform flux concentration required for a photovoltaic cell. Herein, a design procedure that incorporates a ray-tracing technique in the EA is described, and the validity of the design is demonstrated. The results show that the EA automatically generated a unique geometry of the Fresnel lens; the use of this geometry resulted in better uniform flux concentration with high optical efficiency.

  16. Web mining based on chaotic social evolutionary programming algorithm

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming (CSEP) algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.

  17. Receiver Diversity Combining Using Evolutionary Algorithms in Rayleigh Fading Channel

    Science.gov (United States)

    Akbari, Mohsen; Manesh, Mohsen Riahi

    2014-01-01

    In diversity combining at the receiver, the output signal-to-noise ratio (SNR) is often maximized by using the maximal ratio combining (MRC) provided that the channel is perfectly estimated at the receiver. However, channel estimation is rarely perfect in practice, which results in deteriorating the system performance. In this paper, an imperialistic competitive algorithm (ICA) is proposed and compared with two other evolutionary based algorithms, namely, particle swarm optimization (PSO) and genetic algorithm (GA), for diversity combining of signals travelling across the imperfect channels. The proposed algorithm adjusts the combiner weights of the received signal components in such a way that maximizes the SNR and minimizes the bit error rate (BER). The results indicate that the proposed method eliminates the need of channel estimation and can outperform the conventional diversity combining methods. PMID:25045725

  18. Receiver Diversity Combining Using Evolutionary Algorithms in Rayleigh Fading Channel

    Directory of Open Access Journals (Sweden)

    Mohsen Akbari

    2014-01-01

    Full Text Available In diversity combining at the receiver, the output signal-to-noise ratio (SNR is often maximized by using the maximal ratio combining (MRC provided that the channel is perfectly estimated at the receiver. However, channel estimation is rarely perfect in practice, which results in deteriorating the system performance. In this paper, an imperialistic competitive algorithm (ICA is proposed and compared with two other evolutionary based algorithms, namely, particle swarm optimization (PSO and genetic algorithm (GA, for diversity combining of signals travelling across the imperfect channels. The proposed algorithm adjusts the combiner weights of the received signal components in such a way that maximizes the SNR and minimizes the bit error rate (BER. The results indicate that the proposed method eliminates the need of channel estimation and can outperform the conventional diversity combining methods.

  19. Comparing Evolutionary Programs and Evolutionary Pattern Search Algorithms: A Drug Docking Application

    Energy Technology Data Exchange (ETDEWEB)

    Hart, W.E.

    1999-02-10

    Evolutionary programs (EPs) and evolutionary pattern search algorithms (EPSAS) are two general classes of evolutionary methods for optimizing on continuous domains. The relative performance of these methods has been evaluated on standard global optimization test functions, and these results suggest that EPSAs more robustly converge to near-optimal solutions than EPs. In this paper we evaluate the relative performance of EPSAs and EPs on a real-world application: flexible ligand binding in the Autodock docking software. We compare the performance of these methods on a suite of docking test problems. Our results confirm that EPSAs and EPs have comparable performance, and they suggest that EPSAs may be more robust on larger, more complex problems.

  20. Wirelength Minimization in Partitioning and Floorplanning Using Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    I. Hameem Shanavas

    2011-01-01

    Full Text Available Minimizing the wirelength plays an important role in physical design automation of very large-scale integration (VLSI chips. The objective of wirelength minimization can be achieved by finding an optimal solution for VLSI physical design components like partitioning and floorplanning. In VLSI circuit partitioning, the problem of obtaining a minimum delay has prime importance. In VLSI circuit floorplanning, the problem of minimizing silicon area is also a hot issue. Reducing the minimum delay in partitioning and area in floorplanning helps to minimize the wirelength. The enhancements in partitioning and floorplanning have influence on other criteria like power, cost, clock speed, and so forth. Memetic Algorithm (MA is an Evolutionary Algorithm that includes one or more local search phases within its evolutionary cycle to obtain the minimum wirelength by reducing delay in partitioning and by reducing area in floorplanning. MA applies some sort of local search for optimization of VLSI partitioning and floorplanning. The algorithm combines a hierarchical design technique like genetic algorithm and constructive technique like Simulated Annealing for local search to solve VLSI partitioning and floorplanning problem. MA can quickly produce optimal solutions for the popular benchmark.

  1. Optimal classification of standoff bioaerosol measurements using evolutionary algorithms

    Science.gov (United States)

    Nyhavn, Ragnhild; Moen, Hans J. F.; Farsund, Øystein; Rustad, Gunnar

    2011-05-01

    Early warning systems based on standoff detection of biological aerosols require real-time signal processing of a large quantity of high-dimensional data, challenging the systems efficiency in terms of both computational complexity and classification accuracy. Hence, optimal feature selection is essential in forming a stable and efficient classification system. This involves finding optimal signal processing parameters, characteristic spectral frequencies and other data transformations in large magnitude variable space, stating the need for an efficient and smart search algorithm. Evolutionary algorithms are population-based optimization methods inspired by Darwinian evolutionary theory. These methods focus on application of selection, mutation and recombination on a population of competing solutions and optimize this set by evolving the population of solutions for each generation. We have employed genetic algorithms in the search for optimal feature selection and signal processing parameters for classification of biological agents. The experimental data were achieved with a spectrally resolved lidar based on ultraviolet laser induced fluorescence, and included several releases of 5 common simulants. The genetic algorithm outperform benchmark methods involving analytic, sequential and random methods like support vector machines, Fisher's linear discriminant and principal component analysis, with significantly improved classification accuracy compared to the best classical method.

  2. Interactive Evolutionary Multi-Objective Optimization Algorithm Using Cone Dominance

    Institute of Scientific and Technical Information of China (English)

    Dalaijargal Purevsuren; Saif ur Rehman; Gang Cui; Jianmin Bao; Nwe Nwe Htay Win

    2015-01-01

    As the number of objectives increases, the performance of the Pareto dominance⁃based Evolutionary Multi⁃objective Optimization ( EMO) algorithms such as NSGA⁃II, SPEA2 severely deteriorates due to the drastic increase in the Pareto⁃incomparable solutions. We propose a sorting method which classifies these incomparable solutions into several ordered classes by using the decision maker's ( DM) preference information. This is accomplished by designing an interactive evolutionary algorithm and constructing convex cones. This method allows the DMs to drive the search process toward a preferred region of the Pareto optimal front. The performance of the proposed algorithm is assessed for two, three, and four⁃objective knapsack problems. The results demonstrate the algorithm's ability to converge to the most preferred point. The evaluation and comparison of the results indicate that the proposed approach gives better solutions than that of NSGA⁃II. In addition, the approach is more efficient compared to NSGA⁃II in terms of the number of generations required to reach the preferred point.

  3. A hybrid evolutionary algorithm for distribution feeder reconfiguration

    Indian Academy of Sciences (India)

    Taher Niknam; Reza Khorshidi; Bahman Bahmani Firouzi

    2010-04-01

    Distribution feeder reconfiguration (DFR) is formulated as a multiobjective optimization problem which minimizes real power losses, deviation of the node voltages and the number of switching operations and also balances the loads on the feeders. In the proposed method, the distance ($\\lambda_2$ norm) between the vectorvalued objective function and the worst-case vector-valued objective function in the feasible set is maximized. In the algorithm, the status of tie and sectionalizing switches are considered as the control variables. The proposed DFR problem is a non-differentiable optimization problem. Therefore, a new hybrid evolutionary algorithm based on combination of fuzzy adaptive particle swarm optimization (FAPSO) and ant colony optimization (ACO), called HFAPSO, is proposed to solve it. The performance of HFAPSO is evaluated and compared with other methods such as genetic algorithm (GA), ACO, the original PSO, Hybrid PSO and ACO (HPSO) considering different distribution test systems.

  4. Incorporating characteristics of human creativity into an evolutionary art algorithm

    CERN Document Server

    DiPaola, Steve

    2010-01-01

    A perceived limitation of evolutionary art and design algorithms is that they rely on human intervention; the artist selects the most aesthetically pleasing variants of one generation to produce the next. This paper discusses how computer generated art and design can become more creatively human-like with respect to both process and outcome. As an example of a step in this direction, we present an algorithm that overcomes the above limitation by employing an automatic fitness function. The goal is to evolve abstract portraits of Darwin, using our 2nd generation fitness function which rewards genomes that not just produce a likeness of Darwin but exhibit certain strategies characteristic of human artists. We note that in human creativity, change is less choosing amongst randomly generated variants and more capitalizing on the associative structure of a conceptual network to hone in on a vision. We discuss how to achieve this fluidity algorithmically.

  5. Cost Optimization Using Hybrid Evolutionary Algorithm in Cloud Computing

    Directory of Open Access Journals (Sweden)

    B. Kavitha

    2015-07-01

    Full Text Available The main aim of this research is to design the hybrid evolutionary algorithm for minimizing multiple problems of dynamic resource allocation in cloud computing. The resource allocation is one of the big problems in the distributed systems when the client wants to decrease the cost for the resource allocation for their task. In order to assign the resource for the task, the client must consider the monetary cost and computational cost. Allocation of resources by considering those two costs is difficult. To solve this problem in this study, we make the main task of client into many subtasks and we allocate resources for each subtask instead of selecting the single resource for the main task. The allocation of resources for the each subtask is completed through our proposed hybrid optimization algorithm. Here, we hybrid the Binary Particle Swarm Optimization (BPSO and Binary Cuckoo Search algorithm (BCSO by considering monetary cost and computational cost which helps to minimize the cost of the client. Finally, the experimentation is carried out and our proposed hybrid algorithm is compared with BPSO and BCSO algorithms. Also we proved the efficiency of our proposed hybrid optimization algorithm.

  6. Comparison of evolutionary algorithms in gene regulatory network model inference.

    LENUS (Irish Health Repository)

    2010-01-01

    ABSTRACT: BACKGROUND: The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineering of GRNs). However, the nature of these data has made this process very difficult. At the moment, several methods of discovering qualitative causal relationships between genes with high accuracy from microarray data exist, but large scale quantitative analysis on real biological datasets cannot be performed, to date, as existing approaches are not suitable for real microarray data which are noisy and insufficient. RESULTS: This paper performs an analysis of several existing evolutionary algorithms for quantitative gene regulatory network modelling. The aim is to present the techniques used and offer a comprehensive comparison of approaches, under a common framework. Algorithms are applied to both synthetic and real gene expression data from DNA microarrays, and ability to reproduce biological behaviour, scalability and robustness to noise are assessed and compared. CONCLUSIONS: Presented is a comparison framework for assessment of evolutionary algorithms, used to infer gene regulatory networks. Promising methods are identified and a platform for development of appropriate model formalisms is established.

  7. An evolutionary algorithm for a real vehicle routing problem

    Directory of Open Access Journals (Sweden)

    Adamidis, P.

    2012-01-01

    Full Text Available The NP-hard Vehicle Routing Problem (VRP is central in the optimisation of distribution networks. Its main objective is to determine a set of vehicle trips of minimum total cost. The ideal schedule will efficiently exploit the company's recourses, service all customers and satisfy the given (mainly daily constraints. There have been many attempts to solve this problem with conventional techniques but applied to small-scale simplified problems. This is due to the complexity of the problem and the large volume of data to be processed. Evolutionary Algorithms are search and optimization techniques that are capable of confronting that kind of problems and reach a good feasible solution in a reasonable period of time. In this paper we develop an Evolutionary Algorithm in order to solve the VRP of a specific transportation company in Volos, Greece with different vehicle capacities. The algorithm has been tested with different configurations and constraints, and proved to be effective in reaching a satisfying solution for the company's needs.

  8. Time Complexity Analysis of an Evolutionary Algorithm for Finding Nearly Maximum Cardinality Matching

    Institute of Scientific and Technical Information of China (English)

    Jun He; Xin Yao

    2004-01-01

    Most of works on the time complexity analysis of evolutionary algorithms have always focused on some artificial binary problems.The time complexity of the algorithms for combinatorial optimisation has not been well understood.This paper considers the time complexity of an evolutionary algorithm for a classical combinatorial optimisation problem,to find the maximum cardinality matching in a graph.It is shown that the evolutionary algorithm can produce a matching with nearly maximum cardinality in average polynomial time.

  9. Evolutionary Pseudo-Relaxation Learning Algorithm for Bidirectional Associative Memory

    Institute of Scientific and Technical Information of China (English)

    Sheng-Zhi Du; Zeng-Qiang Chen; Zhu-Zhi Yuan

    2005-01-01

    This paper analyzes the sensitivity to noise in BAM (Bidirectional Associative Memory), and then proves the noise immunity of BAM relates not only to the minimum absolute value of net inputs (MAV) but also to the variance of weights associated with synapse connections. In fact, it is a positive monotonically increasing function of the quotient of MAV divided by the variance of weights. Besides, the performance of pseudo-relaxation method depends on learning parameters (λ and ζ), but the relation of them is not linear. So it is hard to find a best combination of λ and ζ which leads to the best BAM performance. And it is obvious that pseudo-relaxation is a kind of local optimization method, so it cannot guarantee to get the global optimal solution. In this paper, a novel learning algorithm EPRBAM (evolutionary psendo-relaxation learning algorithm for bidirectional association memory) employing genetic algorithm and pseudo-relaxation method is proposed to get feasible solution of BAM weight matrix. This algorithm uses the quotient as the fitness of each individual and employs pseudo-relaxation method to adjust individual solution when it does not satisfy constraining condition any more after genetic operation. Experimental results show this algorithm improves noise immunity of BAM greatly. At the same time, EPRBAM does not depend on learning parameters and can get global optimal solution.

  10. A Novel Multiobjective Evolutionary Algorithm Based on Regression Analysis

    Directory of Open Access Journals (Sweden)

    Zhiming Song

    2015-01-01

    Full Text Available As is known, the Pareto set of a continuous multiobjective optimization problem with m objective functions is a piecewise continuous (m-1-dimensional manifold in the decision space under some mild conditions. However, how to utilize the regularity to design multiobjective optimization algorithms has become the research focus. In this paper, based on this regularity, a model-based multiobjective evolutionary algorithm with regression analysis (MMEA-RA is put forward to solve continuous multiobjective optimization problems with variable linkages. In the algorithm, the optimization problem is modelled as a promising area in the decision space by a probability distribution, and the centroid of the probability distribution is (m-1-dimensional piecewise continuous manifold. The least squares method is used to construct such a model. A selection strategy based on the nondominated sorting is used to choose the individuals to the next generation. The new algorithm is tested and compared with NSGA-II and RM-MEDA. The result shows that MMEA-RA outperforms RM-MEDA and NSGA-II on the test instances with variable linkages. At the same time, MMEA-RA has higher efficiency than the other two algorithms. A few shortcomings of MMEA-RA have also been identified and discussed in this paper.

  11. A novel multiobjective evolutionary algorithm based on regression analysis.

    Science.gov (United States)

    Song, Zhiming; Wang, Maocai; Dai, Guangming; Vasile, Massimiliano

    2015-01-01

    As is known, the Pareto set of a continuous multiobjective optimization problem with m objective functions is a piecewise continuous (m - 1)-dimensional manifold in the decision space under some mild conditions. However, how to utilize the regularity to design multiobjective optimization algorithms has become the research focus. In this paper, based on this regularity, a model-based multiobjective evolutionary algorithm with regression analysis (MMEA-RA) is put forward to solve continuous multiobjective optimization problems with variable linkages. In the algorithm, the optimization problem is modelled as a promising area in the decision space by a probability distribution, and the centroid of the probability distribution is (m - 1)-dimensional piecewise continuous manifold. The least squares method is used to construct such a model. A selection strategy based on the nondominated sorting is used to choose the individuals to the next generation. The new algorithm is tested and compared with NSGA-II and RM-MEDA. The result shows that MMEA-RA outperforms RM-MEDA and NSGA-II on the test instances with variable linkages. At the same time, MMEA-RA has higher efficiency than the other two algorithms. A few shortcomings of MMEA-RA have also been identified and discussed in this paper.

  12. Using Entropy for Parameter Analysis of Evolutionary Algorithms

    Science.gov (United States)

    Smit, Selmar K.; Eiben, Agoston E.

    Evolutionary algorithms (EA) form a rich class of stochastic search methods that share the basic principles of incrementally improving the quality of a set of candidate solutions by means of variation and selection (Eiben and Smith 2003, De Jong 2006). Such variation and selection operators often require parameters to be specified. Finding a good set of parameter values is a nontrivial problem in itself. Furthermore, some EA parameters are more relevant than others in the sense that choosing different values for them affects EA performance more than for the other parameters. In this chapter we explain the notion of entropy and discuss how entropy can disclose important information about EA parameters, in particular, about their relevance. We describe an algorithm that is able to estimate the entropy of EA parameters and we present a case study, based on extensive experimentation, to demonstrate the usefulness of this approach and some interesting insights that are gained.

  13. Evolving Quantum Oracles with Hybrid Quantum-inspired Evolutionary Algorithm

    CERN Document Server

    Ding, S; Yang, Q; Ding, Shengchao; Jin, Zhi; Yang, Qing

    2006-01-01

    Quantum oracles play key roles in the studies of quantum computation and quantum information. But implementing quantum oracles efficiently with universal quantum gates is a hard work. Motivated by genetic programming, this paper proposes a novel approach to evolve quantum oracles with a hybrid quantum-inspired evolutionary algorithm. The approach codes quantum circuits with numerical values and combines the cost and correctness of quantum circuits into the fitness function. To speed up the calculation of matrix multiplication in the evaluation of individuals, a fast algorithm of matrix multiplication with Kronecker product is also presented. The experiments show the validity and the effects of some parameters of the presented approach. And some characteristics of the novel approach are discussed too.

  14. Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization

    Energy Technology Data Exchange (ETDEWEB)

    HART,WILLIAM E.

    2000-06-01

    The authors describe a convergence theory for evolutionary pattern search algorithms (EPSAs) on a broad class of unconstrained and linearly constrained problems. EPSAs adaptively modify the step size of the mutation operator in response to the success of previous optimization steps. The design of EPSAs is inspired by recent analyses of pattern search methods. The analysis significantly extends the previous convergence theory for EPSAs. The analysis applies to a broader class of EPSAs,and it applies to problems that are nonsmooth, have unbounded objective functions, and which are linearly constrained. Further, they describe a modest change to the algorithmic framework of EPSAs for which a non-probabilistic convergence theory applies. These analyses are also noteworthy because they are considerably simpler than previous analyses of EPSAs.

  15. Academic Training: Evolutionary Heuristic Optimization: Genetic Algorithms and Estimation of Distribution Algorithms - Lecture series

    CERN Multimedia

    Françoise Benz

    2004-01-01

    ACADEMIC TRAINING LECTURE REGULAR PROGRAMME 1, 2, 3 and 4 June From 11:00 hrs to 12:00 hrs - Main Auditorium bldg. 500 Evolutionary Heuristic Optimization: Genetic Algorithms and Estimation of Distribution Algorithms V. Robles Forcada and M. Perez Hernandez / Univ. de Madrid, Spain In the real world, there exist a huge number of problems that require getting an optimum or near-to-optimum solution. Optimization can be used to solve a lot of different problems such as network design, sets and partitions, storage and retrieval or scheduling. On the other hand, in nature, there exist many processes that seek a stable state. These processes can be seen as natural optimization processes. Over the last 30 years several attempts have been made to develop optimization algorithms, which simulate these natural optimization processes. These attempts have resulted in methods such as Simulated Annealing, based on natural annealing processes or Evolutionary Computation, based on biological evolution processes. Geneti...

  16. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.

    Science.gov (United States)

    Friedrich, Tobias; Neumann, Frank

    2015-01-01

    Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a simple single objective evolutionary algorithm called (1 + 1) EA and a multiobjective evolutionary algorithm called GSEMO until they have obtained a good approximation for submodular functions. For the case of monotone submodular functions and uniform cardinality constraints, we show that the GSEMO achieves a (1 - 1/e)-approximation in expected polynomial time. For the case of monotone functions where the constraints are given by the intersection of K ≥ 2 matroids, we show that the (1 + 1) EA achieves a (1/k + δ)-approximation in expected polynomial time for any constant δ > 0. Turning to nonmonotone symmetric submodular functions with k ≥ 1 matroid intersection constraints, we show that the GSEMO achieves a 1/((k + 2)(1 + ε))-approximation in expected time O(n(k + 6)log(n)/ε.

  17. Fuzzy Preference Incorporated Evolutionary Algorithm for Multiobjective Optimization

    Directory of Open Access Journals (Sweden)

    Surafel Luleseged Tilahun

    2011-01-01

    Full Text Available Multiobjective evolutionary method is a way to overcome the limitation of the classical methods, by finding multiple solutions within a single run of the solution procedure. The aim of having a solution method for multiobjective optimization problem is to help the decision maker in getting the best solution. Usually the decision maker is not interested in a diverse set of Pareto optimal points. So, it is necessary to incorporate the decision maker’s preference so that the algorithm gives out alternative solutions around the decision maker’s preference. The problem in incorporating the decision maker’s preference is that the decision maker may not have a solid guide line in comparing tradeoffs of objectives. However, it is easy for the decision maker to compare in a fuzzy way. This paper discusses on incorporating a fuzzy tradeoffs in the evolutionary algorithm to zoom out the region where the decision maker’s preference lies. By using test functions it has shown that it is possible to give points in the region on the Pareto front where the decision maker’s interest lies.

  18. Bidirectional Dynamic Diversity Evolutionary Algorithm for Constrained Optimization

    Directory of Open Access Journals (Sweden)

    Weishang Gao

    2013-01-01

    Full Text Available Evolutionary algorithms (EAs were shown to be effective for complex constrained optimization problems. However, inflexible exploration-exploitation and improper penalty in EAs with penalty function would lead to losing the global optimum nearby or on the constrained boundary. To determine an appropriate penalty coefficient is also difficult in most studies. In this paper, we propose a bidirectional dynamic diversity evolutionary algorithm (Bi-DDEA with multiagents guiding exploration-exploitation through local extrema to the global optimum in suitable steps. In Bi-DDEA potential advantage is detected by three kinds of agents. The scale and the density of agents will change dynamically according to the emerging of potential optimal area, which play an important role of flexible exploration-exploitation. Meanwhile, a novel double optimum estimation strategy with objective fitness and penalty fitness is suggested to compute, respectively, the dominance trend of agents in feasible region and forbidden region. This bidirectional evolving with multiagents can not only effectively avoid the problem of determining penalty coefficient but also quickly converge to the global optimum nearby or on the constrained boundary. By examining the rapidity and veracity of Bi-DDEA across benchmark functions, the proposed method is shown to be effective.

  19. A multilevel evolutionary algorithm for optimizing numerical functions

    Directory of Open Access Journals (Sweden)

    Reza Akbari

    2011-04-01

    Full Text Available This is a study on the effects of multilevel selection (MLS theory in optimizing numerical functions. Based on this theory, a Multilevel Evolutionary Optimization algorithm (MLEO is presented. In MLEO, a species is subdivided in cooperative populations and then each population is subdivided in groups, and evolution occurs at two levels so called individual and group levels. A fast population dynamics occurs at individual level. At this level, selection occurs among individuals of the same group. The popular genetic operators such as mutation and crossover are applied within groups. A slow population dynamics occurs at group level. At this level, selection happens among groups of a population. The group level operators such as regrouping, migration, and extinction-colonization are applied among groups. In regrouping process, all the groups are mixed together and then new groups are formed. The migration process encourages an individual to leave its own group and move to one of its neighbour groups. In extinction-colonization process, a group is selected as extinct, and replaced by offspring of a colonist group. In order to evaluate MLEO, the proposed algorithms were used for optimizing a set of well known numerical functions. The preliminary results indicate that the MLEO theory has positive effect on the evolutionary process and provide an efficient way for numerical optimization.

  20. Multi-objective mixture-based iterated density estimation evolutionary algorithms

    NARCIS (Netherlands)

    Thierens, D.; Bosman, P.A.N.

    2001-01-01

    We propose an algorithm for multi-objective optimization using a mixture-based iterated density estimation evolutionary algorithm (MIDEA). The MIDEA algorithm is a prob- abilistic model building evolutionary algo- rithm that constructs at each generation a mixture of factorized probability

  1. Improved multilayer OLED architecture using evolutionary genetic algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Quirino, W.G. [LADOR - Laboratorio de Dispositivos Organicos, Dimat - Inmetro, Duque de Caxias, RJ (Brazil); Teixeira, K.C. [LADOR - Laboratorio de Dispositivos Organicos, Dimat - Inmetro, Duque de Caxias, RJ (Brazil); LOEM - Laboratorio de Optoeletronica Molecular, Physics Department, Pontifical Catholic University of Rio de Janeiro, 22453-900, Rio de Janeiro, RJ (Brazil); Legnani, C. [LADOR - Laboratorio de Dispositivos Organicos, Dimat - Inmetro, Duque de Caxias, RJ (Brazil); Calil, V.L. [LADOR - Laboratorio de Dispositivos Organicos, Dimat - Inmetro, Duque de Caxias, RJ (Brazil); LOEM - Laboratorio de Optoeletronica Molecular, Physics Department, Pontifical Catholic University of Rio de Janeiro, 22453-900, Rio de Janeiro, RJ (Brazil); Messer, B.; Neto, O.P. Vilela; Pacheco, M.A.C. [ICA - Laboratorio de Inteligencia Computacional Aplicada, Electrical Engineering Department, Pontifical Catholic University of Rio de Janeiro, 22451-900, Rio de Janeiro, RJ (Brazil); Cremona, M., E-mail: cremona@fis.puc-rio.b [LADOR - Laboratorio de Dispositivos Organicos, Dimat - Inmetro, Duque de Caxias, RJ (Brazil); LOEM - Laboratorio de Optoeletronica Molecular, Physics Department, Pontifical Catholic University of Rio de Janeiro, 22453-900, Rio de Janeiro, RJ (Brazil)

    2009-12-31

    Organic light-emitting diodes (OLEDs) constitute a new class of emissive devices, which present high efficiency and low voltage operation, among other advantages over current technology. Multilayer architecture (M-OLED) is generally used to optimize these devices, specially overcoming the suppression of light emission due to the exciton recombination near the metal layers. However, improvement in recombination, transport and charge injection can also be achieved by blending electron and hole transporting layers into the same one. Graded emissive region devices can provide promising results regarding quantum and power efficiency and brightness, as well. The massive number of possible model configurations, however, suggests that a search algorithm would be more suitable for this matter. In this work, multilayer OLEDs were simulated and fabricated using Genetic Algorithms (GAs) as evolutionary strategy to improve their efficiency. Genetic Algorithms are stochastic algorithms based on genetic inheritance and Darwinian strife to survival. In our simulations, it was assumed a 50 nm width graded region, divided into five equally sized layers. The relative concentrations of the materials within each layer were optimized to obtain the lower V/J{sup 0.5} ratio, where V is the applied voltage and J the current density. The best M-OLED architecture obtained by genetic algorithm presented a V/J{sup 0.5} ratio nearly 7% lower than the value reported in the literature. In order to check the experimental validity of the improved results obtained in the simulations, two M-OLEDs with different architectures were fabricated by thermal deposition in high vacuum environment. The results of the comparison between simulation and some experiments are presented and discussed.

  2. Efficiency of Evolutionary Algorithms for Calibration of Watershed Models

    Science.gov (United States)

    Ahmadi, M.; Arabi, M.

    2009-12-01

    Since the promulgation of the Clean Water Act in the U.S. and other similar legislations around the world over the past three decades, watershed management programs have focused on the nexus of pollution prevention and mitigation. In this context, hydrologic/water quality models have been increasingly embedded in the decision making process. Simulation models are now commonly used to investigate the hydrologic response of watershed systems under varying climatic and land use conditions, and also to study the fate and transport of contaminants at various spatiotemporal scales. Adequate calibration and corroboration of models for various outputs at varying scales is an essential component of watershed modeling. The parameter estimation process could be challenging when multiple objectives are important. For example, improving streamflow predictions of the model at a stream location may result in degradation of model predictions for sediments and/or nutrient at the same location or other outlets. This paper aims to evaluate the applicability and efficiency of single and multi objective evolutionary algorithms for parameter estimation of complex watershed models. To this end, the Shuffled Complex Evolution (SCE-UA) algorithm, a single-objective genetic algorithm (GA), and a multi-objective genetic algorithm (i.e., NSGA-II) were reconciled with the Soil and Water Assessment Tool (SWAT) to calibrate the model at various locations within the Wildcat Creek Watershed, Indiana. The efficiency of these methods were investigated using different error statistics including root mean square error, coefficient of determination and Nash-Sutcliffe efficiency coefficient for the output variables as well as the baseflow component of the stream discharge. A sensitivity analysis was carried out to screening model parameters that bear significant uncertainties. Results indicated that while flow processes can be reasonably ascertained, parameterization of nutrient and pesticide processes

  3. Online Optimal Controller Design using Evolutionary Algorithm with Convergence Properties

    Directory of Open Access Journals (Sweden)

    Yousef Alipouri

    2014-06-01

    Full Text Available Many real-world applications require minimization of a cost function. This function is the criterion that figures out optimally. In the control engineering, this criterion is used in the design of optimal controllers. Cost function optimization has difficulties including calculating gradient function and lack of information about the system and the control loop. In this article, for the first time, gradient memetic evolutionary programming is proposed for minimization of non-convex cost functions that have been defined in control engineering. Moreover, stability and convergence of the proposed algorithm are proved. Besides, it is modified to be used in online optimization. To achieve this, the sign of the gradient function is utilized. For calculating the sign of the gradient, there is no need to know the cost-function’s shape. The gradient functions are estimated by the algorithm. The proposed algorithm is used to design a PI controller for nonlinear benchmark system CSTR (Continuous Stirred Tank Reactor by online and off-line approaches.

  4. Self-Organized Criticality and Mass Extinction in Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Krink, Thiemo; Thomsen, Rene

    2001-01-01

    niches after mass extinction events. Furthermore, paleontological studies have shown that there is a power law relationship between the frequency of species extinction events and the sue of the extinction impact. Power law relationships of this kind are typical for complex systems, which operate...... at a critical state between chaos and order, known as self-organized criticality (SOC). Based on this background, we used SOC to control the size of spatial extinction zones in a diffusion model. The SOC selection process was easy to implement and implied only negligible computational costs. Our results show...... that the SOC spatial extinction model clearly outperforms simple evolutionary algorithms (EAs) and the difffision model (CGA). Further, our results support the biological hypothesis that mass extinctions might play an important role in evolution. However, the success of simple EAs indicates that evolution...

  5. Evidence of coevolution in multi-objective evolutionary algorithms

    CERN Document Server

    Whitacre, James M

    2009-01-01

    This paper demonstrates that simple yet important characteristics of coevolution can occur in evolutionary algorithms when only a few conditions are met. We find that interaction-based fitness measurements such as fitness (linear) ranking allow for a form of coevolutionary dynamics that is observed when 1) changes are made in what solutions are able to interact during the ranking process and 2) evolution takes place in a multi-objective environment. This research contributes to the study of simulated evolution in a at least two ways. First, it establishes a broader relationship between coevolution and multi-objective optimization than has been previously considered in the literature. Second, it demonstrates that the preconditions for coevolutionary behavior are weaker than previously thought. In particular, our model indicates that direct cooperation or competition between species is not required for coevolution to take place. Moreover, our experiments provide evidence that environmental perturbations can dri...

  6. Safety management in NPPs using an evolutionary algorithm technique

    Energy Technology Data Exchange (ETDEWEB)

    Mishra, Alok [Nuclear Power Corporation of India Limited, NUB Ent-2, Anushakti Nagar, Mumbai (India)]. E-mail: alok@kkhq.net; Patwardhan, Anand [Indian Institute of Tehnology Bombay (India); Verma, A.K. [Indian Institute of Tehnology Bombay (India)

    2007-07-15

    The general goal of safety management in Nuclear Power Plants (NPPs) is to make requirements and activities more risk effective and less costly. The technical specification and maintenance (TS and M) activities in a plant are associated with controlling risk or with satisfying requirements, and are candidates to be evaluated for their resource effectiveness in risk-informed applications. Accordingly, the risk-based analysis of technical specification (RBTS) is being considered in evaluating current TS. The multi-objective optimization of the TS and M requirements of a NPP based on risk and cost, gives the pareto-optimal solutions, from which the utility can pick its decision variables suiting its interest. In this paper, a multi-objective evolutionary algorithm technique has been used to make a trade-off between risk and cost both at the system level and at the plant level for loss of coolant accident (LOCA) and main steam line break (MSLB) as initiating events.

  7. MULTIOBJECT OPTIMIZATION OF A CENTRIFUGAL IMPELLER USING EVOLUTIONARY ALGORITHMS

    Institute of Scientific and Technical Information of China (English)

    Li Jun; Liu Lijun; Feng Zhenping

    2004-01-01

    Application of the multiobjective evolutionary algorithms to the aerodynamic optimization design of a centrifugal impeller is presented. The aerodynamic performance of a centrifugal impeller is evaluated by using the three-dimensional Navier-Stokes solutions. The typical centrifugal impeller is redesigned for maximization of the pressure rise and blade load and minimization of the rotational total pressure loss at the given flow conditions. The B閦ier curves are used to parameterize the three-dimensional impeller blade shape. The present method obtains many reasonable Pareto optimal designs that outperform the original centrifugal impeller. Detailed observation of the certain Pareto optimal design demonstrates the feasibility of the present multiobjective optimization method tool for turbomachinery design.

  8. EVOLUTIONARY ALGORITHMS WITH PREFERENCE FOR MANUFACTURING CELLS FORMATION

    Institute of Scientific and Technical Information of China (English)

    WANG Jianwei; WEI Xiaopeng; LI Rui

    2008-01-01

    Due to the combinatorial nature of cell formation problem and the characteristics of multi-objective and multi-constrain, a novel method of evolutionary algorithm with preference is proposed. The analytic hierarchy process (AHP) is adopted to determine scientifically the weights of the sub-objective functions. The satisfaction of constraints is considered as a new objective, the ratio of the population which doesn't satisfy all constraints is assigned as the weight of new objective. In addition, the self-adaptation of weights is applied in order to converge more easily towards the feasible domain. Therefore, both features multi-criteria and constrains are dealt with simultaneously. Finally, an example is selected from the literature to evaluate the performance of the proposed approach. The results validate the effectiveness of the proposed method in designing the manufacturing cells.

  9. Application of evolutionary algorithm for cast iron latent heat identification

    Directory of Open Access Journals (Sweden)

    J. Mendakiewicz

    2008-12-01

    Full Text Available In the paper the cast iron latent heat in the form of two components corresponding to the solidification of austenite and eutectic phases is assumed. The aim of investigations is to estimate the values of austenite and eutectic latent heats on the basis of cooling curve at the central point of the casting domain. This cooling curve has been obtained both on the basis of direct problem solution as well as from the experiment. To solve such inverse problem the evolutionary algorithm (EA has been applied. The numerical computations have been done using the finite element method by means of commercial software MSC MARC/MENTAT. In the final part of the paper the examples of identification are shown.

  10. Regular Network Class Features Enhancement Using an Evolutionary Synthesis Algorithm

    Directory of Open Access Journals (Sweden)

    O. G. Monahov

    2014-01-01

    Full Text Available This paper investigates a solution of the optimization problem concerning the construction of diameter-optimal regular networks (graphs. Regular networks are of practical interest as the graph-theoretical models of reliable communication networks of parallel supercomputer systems, as a basis of the structure in a model of small world in optical and neural networks. It presents a new class of parametrically described regular networks - hypercirculant networks (graphs. An approach that uses evolutionary algorithms for the automatic generation of parametric descriptions of optimal hypercirculant networks is developed. Synthesis of optimal hypercirculant networks is based on the optimal circulant networks with smaller degree of nodes. To construct optimal hypercirculant networks is used a template of circulant network from the known optimal families of circulant networks with desired number of nodes and with smaller degree of nodes. Thus, a generating set of the circulant network is used as a generating subset of the hypercirculant network, and the missing generators are synthesized by means of the evolutionary algorithm, which is carrying out minimization of diameter (average diameter of networks. A comparative analysis of the structural characteristics of hypercirculant, toroidal, and circulant networks is conducted. The advantage hypercirculant networks under such structural characteristics, as diameter, average diameter, and the width of bisection, with comparable costs of the number of nodes and the number of connections is demonstrated. It should be noted the advantage of hypercirculant networks of dimension three over four higher-dimensional tori. Thus, the optimization of hypercirculant networks of dimension three is more efficient than the introduction of an additional dimension for the corresponding toroidal structures. The paper also notes the best structural parameters of hypercirculant networks in comparison with iBT-networks previously

  11. Neural-Network-Biased Genetic Algorithms for Materials Design: Evolutionary Algorithms That Learn.

    Science.gov (United States)

    Patra, Tarak K; Meenakshisundaram, Venkatesh; Hung, Jui-Hsiang; Simmons, David S

    2017-02-13

    Machine learning has the potential to dramatically accelerate high-throughput approaches to materials design, as demonstrated by successes in biomolecular design and hard materials design. However, in the search for new soft materials exhibiting properties and performance beyond those previously achieved, machine learning approaches are frequently limited by two shortcomings. First, because they are intrinsically interpolative, they are better suited to the optimization of properties within the known range of accessible behavior than to the discovery of new materials with extremal behavior. Second, they require large pre-existing data sets, which are frequently unavailable and prohibitively expensive to produce. Here we describe a new strategy, the neural-network-biased genetic algorithm (NBGA), for combining genetic algorithms, machine learning, and high-throughput computation or experiment to discover materials with extremal properties in the absence of pre-existing data. Within this strategy, predictions from a progressively constructed artificial neural network are employed to bias the evolution of a genetic algorithm, with fitness evaluations performed via direct simulation or experiment. In effect, this strategy gives the evolutionary algorithm the ability to "learn" and draw inferences from its experience to accelerate the evolutionary process. We test this algorithm against several standard optimization problems and polymer design problems and demonstrate that it matches and typically exceeds the efficiency and reproducibility of standard approaches including a direct-evaluation genetic algorithm and a neural-network-evaluated genetic algorithm. The success of this algorithm in a range of test problems indicates that the NBGA provides a robust strategy for employing informatics-accelerated high-throughput methods to accelerate materials design in the absence of pre-existing data.

  12. Simulation and Tuning of PID Controllers using Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    K.R.S. Narayanan

    2012-10-01

    Full Text Available The Proportional Integral Derivative (PID controller is the most widely used control strategy in the Industry. The popularity of PID controllers can be attributed to their robust performance in a wide range of operating conditions and partly to their functional simplicity. The process of setting of PID controller can be determined as an optimization task. Over the years, use of intelligent strategies for tuning of these controllers has been growing. Biologically inspired evolutionary strategies have gained importance over other strategies because of their consistent performance over wide range of process models and their flexibility. The level control systems on Deaerator, Feed Water Heaters, and Condenser Hot well are critical to the proper operation of the units in Nuclear Power plants. For Precise control of level, available tuning technologies based on conventional optimization methods are found to be inadequate as these conventional methods are having limitations. To overcome the limitations, alternate tuning techniques based on Genetic Algorithm are emerging. This paper analyses the manual tuning techniques and compares the same with Genetic Algorithm tuning methods for tuning PID controllers for level control system and testing of the quality of process control in the simulation environment of PFBR Operator Training Simulator(OTS.

  13. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.

    Science.gov (United States)

    Lai, Xinsheng; Zhou, Yuren; Xia, Xiaoyun; Zhang, Qingfu

    2016-12-13

    The Steiner tree problem (STP) aims to determine some Steiner nodes such that the minimum spanning tree over these Steiner nodes and a given set of special nodes has the minimum weight, which is NP-hard. STP includes several important cases. The Steiner tree problem in graphs (GSTP) is one of them. Many heuristics have been proposed for STP, and some of them have proved to be performance guarantee approximation algorithms for this problem. Since evolutionary algorithms (EAs) are general and popular randomized heuristics, it is significant to investigate the performance of EAs for STP. Several empirical investigations have shown that EAs are efficient for STP. However, up to now, there is no theoretical work on the performance of EAs for STP. In this paper, we reveal that the (1 + 1) EA achieves 3/2-approximation ratio for STP in a special class of quasi-bipartite graphs in expected runtime O(r(r + s - 1) ⋅ wmax), where r, s and wmax are respectively the number of Steiner nodes, the number of special nodes and the largest weight among all edges in the input graph. We also show that the (1 + 1) EA is better than two other heuristics on two GSTP instances, and the (1 + 1) EA may be inefficient on a constructed GSTP instance.

  14. Multi-objective evolutionary algorithm for operating parallel reservoir system

    Science.gov (United States)

    Chang, Li-Chiu; Chang, Fi-John

    2009-10-01

    SummaryThis paper applies a multi-objective evolutionary algorithm, the non-dominated sorting genetic algorithm (NSGA-II), to examine the operations of a multi-reservoir system in Taiwan. The Feitsui and Shihmen reservoirs are the most important water supply reservoirs in Northern Taiwan supplying the domestic and industrial water supply needs for over 7 million residents. A daily operational simulation model is developed to guide the releases of the reservoir system and then to calculate the shortage indices (SI) of both reservoirs over a long-term simulation period. The NSGA-II is used to minimize the SI values through identification of optimal joint operating strategies. Based on a 49 year data set, we demonstrate that better operational strategies would reduce shortage indices for both reservoirs. The results indicate that the NSGA-II provides a promising approach. The pareto-front optimal solutions identified operational compromises for the two reservoirs that would be expected to improve joint operations.

  15. Sounds unheard of evolutionary algorithms as creative tools for the contemporary composer

    DEFF Research Database (Denmark)

    Dahlstedt, Palle

    2004-01-01

    Evolutionary algorithms are studied as tools for generating novel musical material in the form of musical scores and synthesized sounds. The choice of genetic representation defines a space of potential music. This space is explored using evolutionary algorithms, in search of useful musical mater...... composed with the tools described in the thesis are presented....

  16. An Allele Real-Coded Quantum Evolutionary Algorithm Based on Hybrid Updating Strategy.

    Science.gov (United States)

    Zhang, Yu-Xian; Qian, Xiao-Yi; Peng, Hui-Deng; Wang, Jian-Hui

    2016-01-01

    For improving convergence rate and preventing prematurity in quantum evolutionary algorithm, an allele real-coded quantum evolutionary algorithm based on hybrid updating strategy is presented. The real variables are coded with probability superposition of allele. A hybrid updating strategy balancing the global search and local search is presented in which the superior allele is defined. On the basis of superior allele and inferior allele, a guided evolutionary process as well as updating allele with variable scale contraction is adopted. And H ε gate is introduced to prevent prematurity. Furthermore, the global convergence of proposed algorithm is proved by Markov chain. Finally, the proposed algorithm is compared with genetic algorithm, quantum evolutionary algorithm, and double chains quantum genetic algorithm in solving continuous optimization problem, and the experimental results verify the advantages on convergence rate and search accuracy.

  17. An Allele Real-Coded Quantum Evolutionary Algorithm Based on Hybrid Updating Strategy

    Directory of Open Access Journals (Sweden)

    Yu-Xian Zhang

    2016-01-01

    Full Text Available For improving convergence rate and preventing prematurity in quantum evolutionary algorithm, an allele real-coded quantum evolutionary algorithm based on hybrid updating strategy is presented. The real variables are coded with probability superposition of allele. A hybrid updating strategy balancing the global search and local search is presented in which the superior allele is defined. On the basis of superior allele and inferior allele, a guided evolutionary process as well as updating allele with variable scale contraction is adopted. And Hε gate is introduced to prevent prematurity. Furthermore, the global convergence of proposed algorithm is proved by Markov chain. Finally, the proposed algorithm is compared with genetic algorithm, quantum evolutionary algorithm, and double chains quantum genetic algorithm in solving continuous optimization problem, and the experimental results verify the advantages on convergence rate and search accuracy.

  18. Academic Training: Evolutionary Heuristic Optimization: Genetic Algorithms and Estimation of Distribution Algorithms - Lecture serie

    CERN Multimedia

    Françoise Benz

    2004-01-01

    ENSEIGNEMENT ACADEMIQUE ACADEMIC TRAINING Françoise Benz 73127 academic.training@cern.ch ACADEMIC TRAINING LECTURE REGULAR PROGRAMME 1, 2, 3 and 4 June From 11:00 hrs to 12:00 hrs - Main Auditorium bldg. 500 Evolutionary Heuristic Optimization: Genetic Algorithms and Estimation of Distribution Algorithms V. Robles Forcada and M. Perez Hernandez / Univ. de Madrid, Spain In the real world, there exist a huge number of problems that require getting an optimum or near-to-optimum solution. Optimization can be used to solve a lot of different problems such as network design, sets and partitions, storage and retrieval or scheduling. On the other hand, in nature, there exist many processes that seek a stable state. These processes can be seen as natural optimization processes. Over the last 30 years several attempts have been made to develop optimization algorithms, which simulate these natural optimization processes. These attempts have resulted in methods such as Simulated Annealing, based on nat...

  19. Using Evolutionary Multiobjective Optimization Algorithms to Evolve Lacing Patterns for Bicycle Wheels

    OpenAIRE

    Svensson, Mats Krüger

    2015-01-01

    This thesis investigates the use of evolutionary algorithms (EAs) to evolve and optimize lacing patterns of spokes for a bicycle wheel. There are multiple objectives and tradeoffs to be considered when evaluating a lacing pattern, for instance, strength versus balance. To handle this, an evolutionary multiobjective optimization (EMO) method has been used. Various EMO algorithms and approaches are tested. Among these, the new NSGA-III algorithm is used. Different representations of the lac...

  20. Optimization of Microgrid Using Quantum Inspired Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Ebrahim Zare juybari

    2014-08-01

    Full Text Available This paper presents a generalized formulation for determining the optimal operating strategy and cost optimization scheme as well as reducing the emissions of a MicroGrid (MG. In this article a microgrid including a wind turbine, pv array and a CHP system consisting of fuel cells and a microturbine is studied and then the modeling of various DERs is conducted and the objective functions and constraints are developed. The model takes into consideration the operation and maintenance costs as well as the reduction in emissions of NOx, SO2, and CO2 In the end the Quantum-Inspired Evolutionary Algorithm is employed to solved the optimal model and an operation scheme is achieved while meeting various constraints on the basis of tariff details, equipment performance, weather conditions and forecasts, load details and forecasts and other necessary information and then the economic costs and environmental impacts are analyzed and a conclusion that the QEA can achieve high environmental benefits and spend as low operation cost as possible. according to power Output functions and cost function of the various units , can be achieve to minimize cost.

  1. Local structure of nanosized tungstates revealed by evolutionary algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Timoshenko, Janis; Anspoks, Andris; Kuzmin, Alexei [Institute of Solid State Physics, University of Latvia, Riga (Latvia); Kalinko, Alexandr [Institute of Solid State Physics, University of Latvia, Riga (Latvia); Synchrotron SOLEIL, l' Orme des Merisiers, Saint-Aubin, Gif-sur-Yvette (France)

    2015-02-01

    Nanostructured tungstates, such as CoWO{sub 4} and CuWO{sub 4}, are very promising catalytic materials, particularly for photocatalytic oxidation of water. The high catalytic activity of tungstate nanoparticles partially is a result of their extremely small sizes, and, consequently, high surface-to-volume ratio. Therefore their properties depend strongly on the atomic structure, which differ significantly from that of the bulk material. X-ray absorption spectroscopy is a powerful technique to address the challenging problem of the local structure determination in nanomaterials. In order to fully exploit the structural information contained in X-ray absorption spectra, in this study we employ a novel evolutionary algorithm (EA) for the interpretation of the Co and Cu K-edges as well as the W L{sub 3}-edge extended X-ray absorption fine structure (EXAFS) of nanosized CoWO{sub 4} and CuWO{sub 4}. The combined EA-EXAFS approach and simultaneous analysis of the W L{sub 3} and Co(Cu) K-edge EXAFS spectra allowed us for the first time to obtain a 3D structure model of the tungstate nanoparticles and to explore in details the effect of size, temperature and transition metal type. (copyright 2015 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  2. A Novel Diversity-Based Replacement Strategy for Evolutionary Algorithms.

    Science.gov (United States)

    Segura, Carlos; Coello Coello, Carlos A; Segredo, Eduardo; Aguirre, Arturo Hernandez

    2016-12-01

    Premature convergence is one of the best-known drawbacks that affects the performance of evolutionary algorithms. An alternative for dealing with this problem is to explicitly try to maintain proper diversity. In this paper, a new replacement strategy that preserves useful diversity is presented. The novelty of our method is that it combines the idea of transforming a single-objective problem into a multiobjective one, by considering diversity as an explicit objective, with the idea of adapting the balance induced between exploration and exploitation to the various optimization stages. Specifically, in the initial phases, larger amounts of diversity are accepted. The diversity measure considered in this paper is based on calculating distances to the closest surviving individual. Analyses with a multimodal function better justify the design decisions and provide greater insight into the working operation of the proposal. Computational results with a packing problem that was proposed in a popular contest illustrate the usefulness of the proposal. The new method significantly improves on the best results known to date for this problem and compares favorably against a large number of state-of-the-art schemes.

  3. Courses of action for effects based operations using evolutionary algorithms

    Science.gov (United States)

    Haider, Sajjad; Levis, Alexander H.

    2006-05-01

    This paper presents an Evolutionary Algorithms (EAs) based approach to identify effective courses of action (COAs) in Effects Based Operations. The approach uses Timed Influence Nets (TINs) as the underlying mathematical model to capture a dynamic uncertain situation. TINs provide a concise graph-theoretic probabilistic approach to specify the cause and effect relationships that exist among the variables of interest (actions, desired effects, and other uncertain events) in a problem domain. The purpose of building these TIN models is to identify and analyze several alternative courses of action. The current practice is to use trial and error based techniques which are not only labor intensive but also produce sub-optimal results and are not capable of modeling constraints among actionable events. The EA based approach presented in this paper is aimed to overcome these limitations. The approach generates multiple COAs that are close enough in terms of achieving the desired effect. The purpose of generating multiple COAs is to give several alternatives to a decision maker. Moreover, the alternate COAs could be generalized based on the relationships that exist among the actions and their execution timings. The approach also allows a system analyst to capture certain types of constraints among actionable events.

  4. Immune evolutionary algorithms with domain knowledge for simultaneous localization and mapping

    Institute of Scientific and Technical Information of China (English)

    LI Mei-yi; CAI Zi-xing

    2006-01-01

    Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were designed in algorithms, where the feature of parallel line segments without the problem of data association was used to construct a vaccination operator, and the characters of convex vertices in polygonal obstacle were extended to develop a pulling operator of key point grid. The experimental results of a real mobile robot show that the computational expensiveness of algorithms designed is less than other evolutionary algorithms for simultaneous localization and mapping and the maps obtained are very accurate. Because immune evolutionary algorithms with domain knowledge have some advantages, the convergence rate of designed algorithms is about 44 % higher than those of other algorithms.

  5. Effective hybrid evolutionary computational algorithms for global optimization and applied to construct prion AGAAAAGA fibril models

    CERN Document Server

    Zhang, Jiapu

    2010-01-01

    Evolutionary algorithms are parallel computing algorithms and simulated annealing algorithm is a sequential computing algorithm. This paper inserts simulated annealing into evolutionary computations and successful developed a hybrid Self-Adaptive Evolutionary Strategy $\\mu+\\lambda$ method and a hybrid Self-Adaptive Classical Evolutionary Programming method. Numerical results on more than 40 benchmark test problems of global optimization show that the hybrid methods presented in this paper are very effective. Lennard-Jones potential energy minimization is another benchmark for testing new global optimization algorithms. It is studied through the amyloid fibril constructions by this paper. To date, there is little molecular structural data available on the AGAAAAGA palindrome in the hydrophobic region (113-120) of prion proteins.This region belongs to the N-terminal unstructured region (1-123) of prion proteins, the structure of which has proved hard to determine using NMR spectroscopy or X-ray crystallography ...

  6. Co-evolutionary algorithm: An efficient approach for bilevel programming problems

    Science.gov (United States)

    Li, Hecheng; Fang, Lei

    2014-03-01

    The bilevel programming problem involves two optimization problems, which is hierarchical, strongly NP-hard and very challenging for most existing optimization approaches. An efficient universal co-evolutionary algorithm is developed in this article to deal with various bilevel programming problems. In the proposed algorithm, evolutionary algorithms are used to explore the leader's and the follower's decision-making spaces interactively. Unlike other existing approaches, in the suggested procedure the follower's problem is solved in two phases. First, an evolutionary algorithm is run for a few generations to obtain an approximation of lower level solutions. In the second phase, from all approximate solutions obtained above, only a small number of good points are selected and evolved again by a newly designed multi-criteria evolutionary algorithm. The technique refines some candidate solutions and can efficiently reduce the computational cost of obtaining feasible solutions. Proof-of-principle experiments demonstrate the efficiency of the proposed approach.

  7. PENERAPAN EVOLUTIONARY ALGORITHM PADA PENJADWALAN PRODUKSI (Studi Kasus di PT Brother Silver Product Indonesia

    Directory of Open Access Journals (Sweden)

    Lala Febriana

    2001-01-01

    Full Text Available This research gives an alternative to build production schedule using Evolutionary Algorithm. The objective function is minimizing production makespan. Shortest Processing Time (SPT and Longest Processing Time (LPT methods are used as initial solution. The algorithm is implemented on house ware factory and the result show the final solution has makespan 26,74 % less than initial solution. Abstract in Bahasa Indonesia : Penelitian ini memberikan alternatif dalam menyusun suatu jadwal produksi dengan menggunakan Evolutionary Algorithm. Fungsi tujuan yang akan dicapai adalah meminimumkan makespan produksi. Metode Shortest Processing Time (SPT dan Longest Processing Time (LPT digunakan sebagai solusi awal. Algoritma ini kemudian diterapkan pada pabrik peralatan rumah tangga dan solusi akhir menunjukan Evolutionary Algorithm memberikan makespan 26.74% lebih kecil dibandingkan dengan solusi awal. Kata kunci: Evolutionary Algorithm, Penjadwalan.

  8. A novel quantum-inspired immune clonal algorithm with the evolutionary game approach

    Institute of Scientific and Technical Information of China (English)

    Qiuyi Wu; Licheng Jiao; Yangyang Li; Xiaozheng Deng

    2009-01-01

    The quantum-inspired immune clonal algorithm (QICA) is a rising intelligence algorithm. Based on evolutionary game theory and QICA, a quantum-inspired immune algorithm embedded with evolutionary game (EGQICA) is proposed to solve combination optimi-zation problems. In this paper, we map the quantum antibody's finding the optimal solution to player's pursuing maximum utility by choosing strategies in evolutionary games. Replicator dynamics is used to model the behavior of the quantum antibody and the memory mechanism is also introduced in this work. Experimental results indicate that the proposed approach maintains a good diversity and achieves superior performance.

  9. Fuzzy evolutionary algorithm to solve chromosomes conflict and its application to lecture schedule problems

    Science.gov (United States)

    Marwati, Rini; Yulianti, Kartika; Pangestu, Herny Wulandari

    2016-02-01

    A fuzzy evolutionary algorithm is an integration of an evolutionary algorithm and a fuzzy system. In this paper, we present an application of a genetic algorithm to a fuzzy evolutionary algorithm to detect and to solve chromosomes conflict. A chromosome conflict is identified by existence of any two genes in a chromosome that has the same values as two genes in another chromosome. Based on this approach, we construct an algorithm to solve a lecture scheduling problem. Time codes, lecture codes, lecturer codes, and room codes are defined as genes. They are collected to become chromosomes. As a result, the conflicted schedule turns into chromosomes conflict. Built in the Delphi program, results show that the conflicted lecture schedule problem is solvable by this algorithm.

  10. Why Evolutionary Ontologies are a completely different field than Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    O. Matei

    2014-06-01

    Full Text Available Evolutionary ontologies (EO are a field of evolutionary computation as genetic algorithms (GA. Although there are commonalities between the two concepts, we will demonstrate by means of this article that there are significant differences, which makes them completely distinct.

  11. CONVERGENCE RATES FOR A CLASS OF EVOLUTIONARY ALGORITHMS WITH ELITIST STRATEGY

    Institute of Scientific and Technical Information of China (English)

    丁立新; 康立山

    2001-01-01

    This paper discusses the convergence rates about a class of evolutionary al-gorithms in general search spaces by means of the ergodic theory in Markov chain and some techniques in Banach algebra. Under certain conditions that transition probability functions of Markov chains corresponding to evolutionary algorithms satisfy, the authors obtain the convergence rates of the exponential order. Furthermore, they also analyze the characteristics of the conditions which can be met by genetic operators and selection strategies.

  12. Strength Pareto Evolutionary Algorithm using Self-Organizing Data Analysis Techniques

    Directory of Open Access Journals (Sweden)

    Ionut Balan

    2015-03-01

    Full Text Available Multiobjective optimization is widely used in problems solving from a variety of areas. To solve such problems there was developed a set of algorithms, most of them based on evolutionary techniques. One of the algorithms from this class, which gives quite good results is SPEA2, method which is the basis of the proposed algorithm in this paper. Results from this paper are obtained by running these two algorithms on a flow-shop problem.

  13. Can't See the Forest: Using an Evolutionary Algorithm to Produce an Animated Artwork

    Science.gov (United States)

    Trist, Karen; Ciesielski, Vic; Barile, Perry

    We describe an artist's journey of working with an evolutionary algorithm to create an artwork suitable for exhibition in a gallery. Software based on the evolutionary algorithm produces animations which engage the viewer with a target image slowly emerging from a random collection of greyscale lines. The artwork consists of a grid of movies of eucalyptus tree targets. Each movie resolves with different aesthetic qualities, tempo and energy. The artist exercises creative control by choice of target and values for evolutionary and drawing parameters.

  14. A Novel Evolutionary-Fuzzy Control Algorithm for Complex Systems

    Institute of Scientific and Technical Information of China (English)

    王攀; 徐承志; 冯珊; 徐爱华

    2002-01-01

    This paper presents an adaptive fuzzy control scheme based on modified genetic algorithm. In the control scheme, genetic algorithm is used to optimze the nonlinear quantization functions of the controller and some key parameters of the adaptive control algorithm. Simulation results show that this control scheme has satisfactory performance in MIMO systems, chaotic systems and delay systems.

  15. Development and validation of evolutionary algorithm software as an optimization tool for biological and environmental applications.

    Science.gov (United States)

    Sys, K; Boon, N; Verstraete, W

    2004-06-01

    A flexible, extendable tool for the optimization of (micro)biological processes and protocols using evolutionary algorithms was developed. It has been tested using three different theoretical optimization problems: 2 two-dimensional problems, one with three maxima and one with five maxima and a river autopurification optimization problem with boundary conditions. For each problem, different evolutionary parameter settings were used for the optimization. For each combination of evolutionary parameters, 15 generations were run 20 times. It has been shown that in all cases, the evolutionary algorithm gave rise to valuable results. Generally, the algorithms were able to detect the more stable sub-maximum even if there existed less stable maxima. The latter is, from a practical point of view, generally more desired. The most important factors influencing the convergence process were the parameter value randomization rate and distribution. The developed software, described in this work, is available for free.

  16. Why don’t you use Evolutionary Algorithms in Big Data?

    Science.gov (United States)

    Stanovov, Vladimir; Brester, Christina; Kolehmainen, Mikko; Semenkina, Olga

    2017-02-01

    In this paper we raise the question of using evolutionary algorithms in the area of Big Data processing. We show that evolutionary algorithms provide evident advantages due to their high scalability and flexibility, their ability to solve global optimization problems and optimize several criteria at the same time for feature selection, instance selection and other data reduction problems. In particular, we consider the usage of evolutionary algorithms with all kinds of machine learning tools, such as neural networks and fuzzy systems. All our examples prove that Evolutionary Machine Learning is becoming more and more important in data analysis and we expect to see the further development of this field especially in respect to Big Data.

  17. Analysis of Various Multi-Objective Optimization Evolutionary Algorithms for Monte Carlo Treatment Planning System

    CERN Document Server

    Tydrichova, Magdalena

    2017-01-01

    In this project, various available multi-objective optimization evolutionary algorithms were compared considering their performance and distribution of solutions. The main goal was to select the most suitable algorithms for applications in cancer hadron therapy planning. For our purposes, a complex testing and analysis software was developed. Also, many conclusions and hypothesis have been done for the further research.

  18. Evolutionary algorithms and other metaheuristics in water resources: Current status, research challenges and future directions

    NARCIS (Netherlands)

    Maier, H.R.; Kapelan, Z.; Kasprzyk, J.; Kollat, J.; Matott, L.S.; Cunha, M.C.; Dandy, G.C.; Gibbs, M.S.; Keedwell, E.; Marchi, A.; Ostfeld, A.; Savic, D.; Solomatine, D.P.; Vrugt, J.A.; Zecchin, A.C.; Minsker, B.S.; Barbour, E.J.; Kuczera, G.; Pasha, F.; Castelletti, A.; Giuliani, M.; Reed, P.M.

    2014-01-01

    The development and application of evolutionary algorithms (EAs) and other metaheuristics for the optimisation of water resources systems has been an active research field for over two decades. Research to date has emphasized algorithmic improvements and individual applications in specific areas (e.

  19. Evolutionary algorithms and other metaheuristics in water resources: Current status, research challenges and future directions

    NARCIS (Netherlands)

    Maier, H.R.; Kapelan, Z.; Kasprzyk, J.; Kollat, J.; Matott, L.S.; Cunha, M.C.; Dandy, G.C.; Gibbs, M.S.; Keedwell, E.; Marchi, A.; Ostfeld, A.; Savic, D.; Solomatine, D.P.; Vrugt, J.A.; Zecchin, A.C.; Minsker, B.S.; Barbour, E.J.; Kuczera, G.; Pasha, F.; Castelletti, A.; Giuliani, M.; Reed, P.M.

    2014-01-01

    The development and application of evolutionary algorithms (EAs) and other metaheuristics for the optimisation of water resources systems has been an active research field for over two decades. Research to date has emphasized algorithmic improvements and individual applications in specific areas

  20. Performance comparison of some evolutionary algorithms on job shop scheduling problems

    Science.gov (United States)

    Mishra, S. K.; Rao, C. S. P.

    2016-09-01

    Job Shop Scheduling as a state space search problem belonging to NP-hard category due to its complexity and combinational explosion of states. Several naturally inspire evolutionary methods have been developed to solve Job Shop Scheduling Problems. In this paper the evolutionary methods namely Particles Swarm Optimization, Artificial Intelligence, Invasive Weed Optimization, Bacterial Foraging Optimization, Music Based Harmony Search Algorithms are applied and find tuned to model and solve Job Shop Scheduling Problems. To compare about 250 Bench Mark instances have been used to evaluate the performance of these algorithms. The capabilities of each these algorithms in solving Job Shop Scheduling Problems are outlined.

  1. Interactive evolutionary algorithms and data mining for drug design

    NARCIS (Netherlands)

    Lameijer, Eric Marcel Wubbo

    2010-01-01

    One of the main problems of drug design is that it is quite hard to discover compounds that have all the required properties to become a drug (efficacy against the disease, good biological availability, low toxicity). This thesis describes the use of data mining and interactive evolutionary algorith

  2. Acoustic Environments: Applying Evolutionary Algorithms for Sound based Morphogenesis

    DEFF Research Database (Denmark)

    Foged, Isak Worre; Pasold, Anke; Jensen, Mads Brath

    2012-01-01

    The research investigates the application of evolutionary computation in relation to sound based morphogenesis. It does so by using the Sabine equation for performance benchmark in the development of the spatial volume and refl ectors, effectively creating the architectural expression as a whole...

  3. An Evolutionary Algorithm to Optimization of Discrete Problem Based on Pheromone

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The pheromone based positive feedback approach of ant algorithmis int r oduced in evolutionary computation of discrete problem, so as to accomplish the optimization of each allele. It ensures stable converge of the algorithm into global optimum. The optimal cutting problem is studied as an example to analyze the performance of the algorithm. The experimental results show the novel performa nce of the algorithm in the optimization of discrete problem.

  4. A novel evolutionary approach for optimizing content-based image indexing algorithms.

    Science.gov (United States)

    Saadatmand-Tarzjan, Mahdi; Moghaddam, Hamid Abrishami

    2007-02-01

    Optimization of content-based image indexing and retrieval (CBIR) algorithms is a complicated and time-consuming task since each time a parameter of the indexing algorithm is changed, all images in the database should be indexed again. In this paper, a novel evolutionary method called evolutionary group algorithm (EGA) is proposed for complicated time-consuming optimization problems such as finding optimal parameters of content-based image indexing algorithms. In the new evolutionary algorithm, the image database is partitioned into several smaller subsets, and each subset is used by an updating process as training patterns for each chromosome during evolution. This is in contrast to genetic algorithms that use the whole database as training patterns for evolution. Additionally, for each chromosome, a parameter called age is defined that implies the progress of the updating process. Similarly, the genes of the proposed chromosomes are divided into two categories: evolutionary genes that participate to evolution and history genes that save previous states of the updating process. Furthermore, a new fitness function is defined which evaluates the fitness of the chromosomes of the current population with different ages in each generation. We used EGA to optimize the quantization thresholds of the wavelet-correlogram algorithm for CBIR. The optimal quantization thresholds computed by EGA improved significantly all the evaluation measures including average precision, average weighted precision, average recall, and average rank for the wavelet-correlogram method.

  5. A hybrid evolutionary algorithm for distribution feeder reconfiguration

    Institute of Scientific and Technical Information of China (English)

    Taher; NIKNAM; Ehsan; AZAD; FARSANI

    2010-01-01

    This paper presents a new method to reduce the distribution system loss by feeder reconfiguration.This new method combines self-adaptive particle swarm optimization(SAPSO) with shuffled frog-leaping algorithm(SFLA) in an attempt to find the global optimal solutions for the distribution feeder reconfiguration(DFR).In PSO algorithm,appropriate adjustment of the parameters is cumbersome and usually requires a lot of time and effort.Thus,a self-adaptive framework is proposed to improve the robustness of PSO.In SAPSO the learning factors of PSO coevolve with the particles.SFLA is combined with the SAPSO algorithm to improve its performance.The proposed algorithm is tested on two distribution test networks.The results of simulation show that the proposed algorithm is very powerful and guarantees to obtain the global optimization in minimum time.

  6. Comparing the Robustness of Evolutionary Algorithms on the Basis of Benchmark Functions

    Directory of Open Access Journals (Sweden)

    DENIZ ULKER, E.

    2013-05-01

    Full Text Available In real-world optimization problems, even though the solution quality is of great importance, the robustness of the solution is also an important aspect. This paper investigates how the optimization algorithms are sensitive to the variations of control parameters and to the random initialization of the solution set for fixed control parameters. The comparison is performed of three well-known evolutionary algorithms which are Particle Swarm Optimization (PSO algorithm, Differential Evolution (DE algorithm and the Harmony Search (HS algorithm. Various benchmark functions with different characteristics are used for the evaluation of these algorithms. The experimental results show that the solution quality of the algorithms is not directly related to their robustness. In particular, the algorithm that is highly robust can have a low solution quality, or the algorithm that has a high quality of solution can be quite sensitive to the parameter variations.

  7. Estimating the ratios of the stationary distribution values for Markov chains modeling evolutionary algorithms.

    Science.gov (United States)

    Mitavskiy, Boris; Cannings, Chris

    2009-01-01

    The evolutionary algorithm stochastic process is well-known to be Markovian. These have been under investigation in much of the theoretical evolutionary computing research. When the mutation rate is positive, the Markov chain modeling of an evolutionary algorithm is irreducible and, therefore, has a unique stationary distribution. Rather little is known about the stationary distribution. In fact, the only quantitative facts established so far tell us that the stationary distributions of Markov chains modeling evolutionary algorithms concentrate on uniform populations (i.e., those populations consisting of a repeated copy of the same individual). At the same time, knowing the stationary distribution may provide some information about the expected time it takes for the algorithm to reach a certain solution, assessment of the biases due to recombination and selection, and is of importance in population genetics to assess what is called a "genetic load" (see the introduction for more details). In the recent joint works of the first author, some bounds have been established on the rates at which the stationary distribution concentrates on the uniform populations. The primary tool used in these papers is the "quotient construction" method. It turns out that the quotient construction method can be exploited to derive much more informative bounds on ratios of the stationary distribution values of various subsets of the state space. In fact, some of the bounds obtained in the current work are expressed in terms of the parameters involved in all the three main stages of an evolutionary algorithm: namely, selection, recombination, and mutation.

  8. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.

    Science.gov (United States)

    Sutton, Andrew M; Neumann, Frank; Nallaperuma, Samadhi

    2014-01-01

    Parameterized runtime analysis seeks to understand the influence of problem structure on algorithmic runtime. In this paper, we contribute to the theoretical understanding of evolutionary algorithms and carry out a parameterized analysis of evolutionary algorithms for the Euclidean traveling salesperson problem (Euclidean TSP). We investigate the structural properties in TSP instances that influence the optimization process of evolutionary algorithms and use this information to bound their runtime. We analyze the runtime in dependence of the number of inner points k. In the first part of the paper, we study a [Formula: see text] EA in a strictly black box setting and show that it can solve the Euclidean TSP in expected time [Formula: see text] where A is a function of the minimum angle [Formula: see text] between any three points. Based on insights provided by the analysis, we improve this upper bound by introducing a mixed mutation strategy that incorporates both 2-opt moves and permutation jumps. This strategy improves the upper bound to [Formula: see text]. In the second part of the paper, we use the information gained in the analysis to incorporate domain knowledge to design two fixed-parameter tractable (FPT) evolutionary algorithms for the planar Euclidean TSP. We first develop a [Formula: see text] EA based on an analysis by M. Theile, 2009, "Exact solutions to the traveling salesperson problem by a population-based evolutionary algorithm," Lecture notes in computer science, Vol. 5482 (pp. 145-155), that solves the TSP with k inner points in [Formula: see text] generations with probability [Formula: see text]. We then design a [Formula: see text] EA that incorporates a dynamic programming step into the fitness evaluation. We prove that a variant of this evolutionary algorithm using 2-opt mutation solves the problem after [Formula: see text] steps in expectation with a cost of [Formula: see text] for each fitness evaluation.

  9. A competitive comparison of different types of evolutionary algorithms

    CERN Document Server

    Hrstka, O; Leps, M; Zeman, J; 10.1016/S0045-7949(03)00217-7

    2009-01-01

    This paper presents comparison of several stochastic optimization algorithms developed by authors in their previous works for the solution of some problems arising in Civil Engineering. The introduced optimization methods are: the integer augmented simulated annealing (IASA), the real-coded augmented simulated annealing (RASA), the differential evolution (DE) in its original fashion developed by R. Storn and K. Price and simplified real-coded differential genetic algorithm (SADE). Each of these methods was developed for some specific optimization problem; namely the Chebychev trial polynomial problem, the so called type 0 function and two engineering problems - the reinforced concrete beam layout and the periodic unit cell problem respectively. Detailed and extensive numerical tests were performed to examine the stability and efficiency of proposed algorithms. The results of our experiments suggest that the performance and robustness of RASA, IASA and SADE methods are comparable, while the DE algorithm perfor...

  10. A multiobjective evolutionary algorithm to find community structures based on affinity propagation

    Science.gov (United States)

    Shang, Ronghua; Luo, Shuang; Zhang, Weitong; Stolkin, Rustam; Jiao, Licheng

    2016-07-01

    Community detection plays an important role in reflecting and understanding the topological structure of complex networks, and can be used to help mine the potential information in networks. This paper presents a Multiobjective Evolutionary Algorithm based on Affinity Propagation (APMOEA) which improves the accuracy of community detection. Firstly, APMOEA takes the method of affinity propagation (AP) to initially divide the network. To accelerate its convergence, the multiobjective evolutionary algorithm selects nondominated solutions from the preliminary partitioning results as its initial population. Secondly, the multiobjective evolutionary algorithm finds solutions approximating the true Pareto optimal front through constantly selecting nondominated solutions from the population after crossover and mutation in iterations, which overcomes the tendency of data clustering methods to fall into local optima. Finally, APMOEA uses an elitist strategy, called "external archive", to prevent degeneration during the process of searching using the multiobjective evolutionary algorithm. According to this strategy, the preliminary partitioning results obtained by AP will be archived and participate in the final selection of Pareto-optimal solutions. Experiments on benchmark test data, including both computer-generated networks and eight real-world networks, show that the proposed algorithm achieves more accurate results and has faster convergence speed compared with seven other state-of-art algorithms.

  11. Channel—Optimized VQ Design Based on Partial Distortion Theorem Using Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    LITianhao

    2003-01-01

    A partial distortion theorem based channel-optimized vector quantization(COVQ)design algorithm using the evolutionary algorithm on noisy algorithm is introduced into the design of COVQ to achieve a significant improvement of vector quantization(VQ)performance for given noisy channel status.The evolutionary strategy is utilized to adjust the subdistortion of each region determined by each codevector in order to improve the total expected distortion.Finally,compared with other conventional codebook design algorithms,the presented algorithm better adjusts the subdistortion of each region and achieves significant gains in average distortion due to hannel errors,over other conventional VQ design methods,as confirmed by the experimental results.

  12. Constrained Optimization Based on Hybrid Evolutionary Algorithm and Adaptive Constraint-Handling Technique

    DEFF Research Database (Denmark)

    Wang, Yong; Cai, Zixing; Zhou, Yuren

    2009-01-01

    A novel approach to deal with numerical and engineering constrained optimization problems, which incorporates a hybrid evolutionary algorithm and an adaptive constraint-handling technique, is presented in this paper. The hybrid evolutionary algorithm simultaneously uses simplex crossover and two...... mutation operators to generate the offspring population. Additionally, the adaptive constraint-handling technique consists of three main situations. In detail, at each situation, one constraint-handling mechanism is designed based on current population state. Experiments on 13 benchmark test functions...... and four well-known constrained design problems verify the effectiveness and efficiency of the proposed method. The experimental results show that integrating the hybrid evolutionary algorithm with the adaptive constraint-handling technique is beneficial, and the proposed method achieves competitive...

  13. Evolutionary programming CLEAN algorithm for UWB localization images of contiguous targets

    Institute of Scientific and Technical Information of China (English)

    XU Yong; LU Ying-hua

    2007-01-01

    In this article, a novel scattering center extraction method using genetic algorithm is proposed to deal with the ultra-wideband (UWB) localization image, which is called evolutionary programming (EP) CLEAN algorithm. Because of the UWB characters, the ideal point scattering model and EP method are used in the algorithm for optimizing the UWB localization images. After introducing the algorithm detail, the actual model is used to realize the EP CLEAN algorithm. Compared with the conventional localization imaging algorithm, this algorithm has advantages fitting the UWB characters such as accuracy, robustness, and better resolution, which are verified by the numerical simulations. Therefore the EP CLEAN algorithm could improve localization image performance to expand the UWB technique application.

  14. Self-Organized Criticality and Mass Extinction in Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Krink, Thiemo; Thomsen, Rene

    2001-01-01

    The gaps in the fossil record gave rise to the hypothesis that evolution proceeded in long periods of stasis, which alternated with occasional, rapid changes that yielded evolutionary progress. One mechanism that could cause these punctuated bursts is the re-colonbation of changing and deserted...... at a critical state between chaos and order, known as self-organized criticality (SOC). Based on this background, we used SOC to control the size of spatial extinction zones in a diffusion model. The SOC selection process was easy to implement and implied only negligible computational costs. Our results show...

  15. International Conference on Artificial Intelligence and Evolutionary Algorithms in Engineering Systems

    CERN Document Server

    Dash, Subhransu; Panigrahi, Bijaya

    2015-01-01

      The book is a collection of high-quality peer-reviewed research papers presented in Proceedings of International Conference on Artificial Intelligence and Evolutionary Algorithms in Engineering Systems (ICAEES 2014) held at Noorul Islam Centre for Higher Education, Kumaracoil, India. These research papers provide the latest developments in the broad area of use of artificial intelligence and evolutionary algorithms in engineering systems. The book discusses wide variety of industrial, engineering and scientific applications of the emerging techniques. It presents invited papers from the inventors/originators of new applications and advanced technologies.

  16. Design of synthetic biological logic circuits based on evolutionary algorithm.

    Science.gov (United States)

    Chuang, Chia-Hua; Lin, Chun-Liang; Chang, Yen-Chang; Jennawasin, Tanagorn; Chen, Po-Kuei

    2013-08-01

    The construction of an artificial biological logic circuit using systematic strategy is recognised as one of the most important topics for the development of synthetic biology. In this study, a real-structured genetic algorithm (RSGA), which combines general advantages of the traditional real genetic algorithm with those of the structured genetic algorithm, is proposed to deal with the biological logic circuit design problem. A general model with the cis-regulatory input function and appropriate promoter activity functions is proposed to synthesise a wide variety of fundamental logic gates such as NOT, Buffer, AND, OR, NAND, NOR and XOR. The results obtained can be extended to synthesise advanced combinational and sequential logic circuits by topologically distinct connections. The resulting optimal design of these logic gates and circuits are established via the RSGA. The in silico computer-based modelling technology has been verified showing its great advantages in the purpose.

  17. ITO-based evolutionary algorithm to solve traveling salesman problem

    Science.gov (United States)

    Dong, Wenyong; Sheng, Kang; Yang, Chuanhua; Yi, Yunfei

    2014-03-01

    In this paper, a ITO algorithm inspired by ITO stochastic process is proposed for Traveling Salesmen Problems (TSP), so far, many meta-heuristic methods have been successfully applied to TSP, however, as a member of them, ITO needs further demonstration for TSP. So starting from designing the key operators, which include the move operator, wave operator, etc, the method based on ITO for TSP is presented, and moreover, the ITO algorithm performance under different parameter sets and the maintenance of population diversity information are also studied.

  18. A novel evolutionary algorithm for global numerical optimization with continuous variables

    Institute of Scientific and Technical Information of China (English)

    Wenhong Zhao; Wei Wang; Yuping Wang

    2008-01-01

    Evolutionary algorithms (EAs) are a class of general optimization algorithms which are applicable to functions that are multimodal, non-differentiable, or even discontinuous. In this paper, a novel evolutionary algorithm is proposed to solve global numerical optimization with continuous variables. In order to make the algorithm more robust, the initial population is generated by combining determinate factors with random ones, and a decent scale function is designed to tailor the crossover operator so that it can not only find the decent direction quickly but also keep scanning evenly in the whole feasible space. In addition, to improve the performance of the algorithm, a mutation operator which increases the convergence-rate and ensures the convergence of the proposed algorithm is designed. Then, the global convergence of the presented algorithm is proved in detail. Finally, the presented algorithm is executed to solve 24 benchmark problems, and the results show that the convergence-rate of the proposed algorithm is much faster than that of the compared algorithms.

  19. Optimal Scheduling for Retrieval Jobs in Double-Deep AS/RS by Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Kuo-Yang Wu

    2013-01-01

    Full Text Available We investigate the optimal scheduling of retrieval jobs for double-deep type Automated Storage and Retrieval Systems (AS/RS in the Flexible Manufacturing System (FMS used in modern industrial production. Three types of evolutionary algorithms, the Genetic Algorithm (GA, the Immune Genetic Algorithm (IGA, and the Particle Swarm Optimization (PSO algorithm, are implemented to obtain the optimal assignments. The objective is to minimize the working distance, that is, the shortest retrieval time travelled by the Storage and Retrieval (S/R machine. Simulation results and comparisons show the advantages and feasibility of the proposed methods.

  20. Evolving the Topology of Hidden Markov Models using Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Thomsen, Réne

    2002-01-01

    Hidden Markov models (HMM) are widely used for speech recognition and have recently gained a lot of attention in the bioinformatics community, because of their ability to capture the information buried in biological sequences. Usually, heuristic algorithms such as Baum-Welch are used to estimate...

  1. Broadcast Networks based on the Virus Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Jian-xin Zhu

    2014-05-01

    Full Text Available An optimization algorithm for virus evolution is to research the spread process of a computer or biological virus in network system. The objective of the algorithm is mainly to control the speed of the virus evolution with limited network resource and to study how users can be infected in the network. A dynamical probabilistic system on a connected graph is adopted to model the virus evolution. A traditional virus evolution model needs to solve a non-convex optimization problem taking the spectral radius function of a nonnegative matrix as an optimization objective in the description of virus evolution model. On this basis, two novel approximation algorithms are proposed in this paper. Based on continuous convex approximation, the first one is a suboptimal with rapid speed. The second one can adopt branch-and-bound techniques to achieve a global optimal solution, which use some key inequalities of nonnegative matrix. Comparing with traditional virus evolution model, the simulation experiment shows that the improved algorithm can reach the global optimum in the process of virus evolution and has fast convergence capability in different network conditions.

  2. EVOLUTIONARY NEURAL NETWORKS ALGORITHM FOR THE DYNAMIC FREQUENCY ASSIGNMENT PROBLEM

    Directory of Open Access Journals (Sweden)

    Jamal Elhachmi

    2011-06-01

    Full Text Available Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application-specific characteristics. Researchers have developed different modelling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion. This paper presents a new approach for solving the problem of frequency allocation based on using initially a partial solution respecting all constraints according to a greedy algorithm. This partial solution is then used for the construction of our stimulation in the form of a neural network. In a second step, the approach will use searching techniques used in conjunction with iterative algorithms for theoptimization of the parameters and topology of the network. The iterative algorithms used are named hierarchical genetic algorithms (HGA. Our approach has been tested on standard benchmark problems called Philadelphia problems of frequency assignment. The results obtained are equivalent to those of current methods. Moreover, our approach shows more efficiency in terms of flexibility and autonomy.

  3. Multidistribution Center Location Based on Real-Parameter Quantum Evolutionary Clustering Algorithm

    Directory of Open Access Journals (Sweden)

    Huaixiao Wang

    2014-01-01

    Full Text Available To determine the multidistribution center location and the distribution scope of the distribution center with high efficiency, the real-parameter quantum-inspired evolutionary clustering algorithm (RQECA is proposed. RQECA is applied to choose multidistribution center location on the basis of the conventional fuzzy C-means clustering algorithm (FCM. The combination of the real-parameter quantum-inspired evolutionary algorithm (RQIEA and FCM can overcome the local search defect of FCM and make the optimization result independent of the choice of initial values. The comparison of FCM, clustering based on simulated annealing genetic algorithm (CSAGA, and RQECA indicates that RQECA has the same good convergence as CSAGA, but the search efficiency of RQECA is better than that of CSAGA. Therefore, RQECA is more efficient to solve the multidistribution center location problem.

  4. Evolutionary Algorithms Applied to Antennas and Propagation: Emerging Trends and Applications

    OpenAIRE

    Sotirios K. Goudos; Anagnostou, Dimitris E.; Christos Kalialakis; Pandian Vasant; Symeon Nikolaou

    2016-01-01

    Several evolutionary algorithms (EAs) have emerged in the past decades that mimic biological entities behavior and evolution. EAs are widely used for the solution of single and multiobjective optimization engineering problems. The EAs have also been applied to a variety of microwave component, antenna design, radar design, and wireless communications problems. These techniques, among others, include Genetic Algorithms (GAs), Evolution Strategies (ES), Particle Swarm Optimization (PSO), Differ...

  5. Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Lvjiang Yin

    2016-12-01

    Full Text Available Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researchers still focus on small scale problems with one objective: a single machine environment. However, the scheduling problem is a multi-objective optimization problem in real applications. In this paper, a single machine scheduling model with controllable processing and sequence dependence setup times is developed for minimizing the total earliness/tardiness (E/T, cost, and energy consumption simultaneously. An effective multi-objective evolutionary algorithm called local multi-objective evolutionary algorithm (LMOEA is presented to tackle this multi-objective scheduling problem. To accommodate the characteristic of the problem, a new solution representation is proposed, which can convert discrete combinational problems into continuous problems. Additionally, a multiple local search strategy with self-adaptive mechanism is introduced into the proposed algorithm to enhance the exploitation ability. The performance of the proposed algorithm is evaluated by instances with comparison to other multi-objective meta-heuristics such as Nondominated Sorting Genetic Algorithm II (NSGA-II, Strength Pareto Evolutionary Algorithm 2 (SPEA2, Multiobjective Particle Swarm Optimization (OMOPSO, and Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D. Experimental results demonstrate that the proposed LMOEA algorithm outperforms its counterparts for this kind of scheduling problems.

  6. Designing a parallel evolutionary algorithm for inferring gene networks on the cloud computing environment.

    Science.gov (United States)

    Lee, Wei-Po; Hsiao, Yu-Ting; Hwang, Wei-Che

    2014-01-16

    To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel computational framework, high

  7. Evolutionary Algorithms for the Detection of Structural Breaks in Time Series

    DEFF Research Database (Denmark)

    Doerr, Benjamin; Fischer, Paul; Hilbert, Astrid

    2013-01-01

    series under consideration is available. Therefore, a black-box optimization approach is our method of choice for detecting structural breaks. We describe a evolutionary algorithm framework which easily adapts to a large number of statistical settings. The experiments on artificial and real-world time...... series show that the algorithm detects break points with high precision and is computationally very efficient. A reference implementation is availble at the following address: http://www2.imm.dtu.dk/~pafi/SBX/launch.html...

  8. A Multi-Objective Optimal Evolutionary Algorithm Based on Tree-Ranking

    Institute of Scientific and Technical Information of China (English)

    Shi Chuan; Kang Li-shan; Li Yan; Yan Zhen-yu

    2003-01-01

    Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcoming s, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare to front, retain the diversity of the population, and use less time.

  9. Designing a parallel evolutionary algorithm for inferring gene networks on the cloud computing environment

    Science.gov (United States)

    2014-01-01

    Background To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. Results This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Conclusions Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel

  10. Evolutionary Algorithms Performance Comparison For Optimizing Unimodal And Multimodal Test Functions

    Directory of Open Access Journals (Sweden)

    Dr. Hanan A.R. Akkar

    2015-08-01

    Full Text Available Many evolutionary algorithms have been presented in the last few decades some of these algorithms were sufficiently tested and used in many researches and papers such as Particle Swarm Optimization PSO Genetic Algorithm GA and Differential Evolution Algorithm DEA. Other recently proposed algorithms were unknown and rarely used such as Stochastic Fractal Search SFS Symbiotic Organisms Search SOS and Grey Wolf Optimizer GWO. This paper trying to made a fair comprehensive comparison for the performance of these well-known algorithms and other less prevalent and recently proposed algorithms by using a variety of famous test functions that have multiple different characteristics through applying two experiments for each algorithm according to the used test function the first experiments carried out with the standard search space limits of the proposed test functions while the second experiment multiple ten times the maximum and minimum limits of the test functions search space recording the Average Mean Absolute Error AMAE Overall Algorithm Efficiency OAE Algorithms Stability AS Overall Algorithm Stability OAS each algorithm required Average Processing Time APT and Overall successful optimized test function Processing Time OPT for both of the experiments and with ten epochs each with 100 iterations for each algorithm.

  11. Computational Modeling of Teaching and Learning through Application of Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Richard Lamb

    2015-09-01

    Full Text Available Within the mind, there are a myriad of ideas that make sense within the bounds of everyday experience, but are not reflective of how the world actually exists; this is particularly true in the domain of science. Classroom learning with teacher explanation are a bridge through which these naive understandings can be brought in line with scientific reality. The purpose of this paper is to examine how the application of a Multiobjective Evolutionary Algorithm (MOEA can work in concert with an existing computational-model to effectively model critical-thinking in the science classroom. An evolutionary algorithm is an algorithm that iteratively optimizes machine learning based computational models. The research question is, does the application of an evolutionary algorithm provide a means to optimize the Student Task and Cognition Model (STAC-M and does the optimized model sufficiently represent and predict teaching and learning outcomes in the science classroom? Within this computational study, the authors outline and simulate the effect of teaching on the ability of a “virtual” student to solve a Piagetian task. Using the Student Task and Cognition Model (STAC-M a computational model of student cognitive processing in science class developed in 2013, the authors complete a computational experiment which examines the role of cognitive retraining on student learning. Comparison of the STAC-M and the STAC-M with inclusion of the Multiobjective Evolutionary Algorithm shows greater success in solving the Piagetian science-tasks post cognitive retraining with the Multiobjective Evolutionary Algorithm. This illustrates the potential uses of cognitive and neuropsychological computational modeling in educational research. The authors also outline the limitations and assumptions of computational modeling.

  12. Optimal Design of a Centrifugal Compressor Impeller Using Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Soo-Yong Cho

    2012-01-01

    Full Text Available An optimization study was conducted on a centrifugal compressor. Eight design variables were chosen from the control points for the Bezier curves which widely influenced the geometric variation; four design variables were selected to optimize the flow passage between the hub and the shroud, and other four design variables were used to improve the performance of the impeller blade. As an optimization algorithm, an artificial neural network (ANN was adopted. Initially, the design of experiments was applied to set up the initial data space of the ANN, which was improved during the optimization process using a genetic algorithm. If a result of the ANN reached a higher level, that result was re-calculated by computational fluid dynamics (CFD and was applied to develop a new ANN. The prediction difference between the ANN and CFD was consequently less than 1% after the 6th generation. Using this optimization technique, the computational time for the optimization was greatly reduced and the accuracy of the optimization algorithm was increased. The efficiency was improved by 1.4% without losing the pressure ratio, and Pareto-optimal solutions of the efficiency versus the pressure ratio were obtained through the 21st generation.

  13. Multi-objective evolutionary algorithms for fuzzy classification in survival prediction.

    Science.gov (United States)

    Jiménez, Fernando; Sánchez, Gracia; Juárez, José M

    2014-03-01

    This paper presents a novel rule-based fuzzy classification methodology for survival/mortality prediction in severe burnt patients. Due to the ethical aspects involved in this medical scenario, physicians tend not to accept a computer-based evaluation unless they understand why and how such a recommendation is given. Therefore, any fuzzy classifier model must be both accurate and interpretable. The proposed methodology is a three-step process: (1) multi-objective constrained optimization of a patient's data set, using Pareto-based elitist multi-objective evolutionary algorithms to maximize accuracy and minimize the complexity (number of rules) of classifiers, subject to interpretability constraints; this step produces a set of alternative (Pareto) classifiers; (2) linguistic labeling, which assigns a linguistic label to each fuzzy set of the classifiers; this step is essential to the interpretability of the classifiers; (3) decision making, whereby a classifier is chosen, if it is satisfactory, according to the preferences of the decision maker. If no classifier is satisfactory for the decision maker, the process starts again in step (1) with a different input parameter set. The performance of three multi-objective evolutionary algorithms, niched pre-selection multi-objective algorithm, elitist Pareto-based multi-objective evolutionary algorithm for diversity reinforcement (ENORA) and the non-dominated sorting genetic algorithm (NSGA-II), was tested using a patient's data set from an intensive care burn unit and a standard machine learning data set from an standard machine learning repository. The results are compared using the hypervolume multi-objective metric. Besides, the results have been compared with other non-evolutionary techniques and validated with a multi-objective cross-validation technique. Our proposal improves the classification rate obtained by other non-evolutionary techniques (decision trees, artificial neural networks, Naive Bayes, and case

  14. Simulation of Biochemical Pathway Adaptability Using Evolutionary Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Bosl, W J

    2005-01-26

    The systems approach to genomics seeks quantitative and predictive descriptions of cells and organisms. However, both the theoretical and experimental methods necessary for such studies still need to be developed. We are far from understanding even the simplest collective behavior of biomolecules, cells or organisms. A key aspect to all biological problems, including environmental microbiology, evolution of infectious diseases, and the adaptation of cancer cells is the evolvability of genomes. This is particularly important for Genomes to Life missions, which tend to focus on the prospect of engineering microorganisms to achieve desired goals in environmental remediation and climate change mitigation, and energy production. All of these will require quantitative tools for understanding the evolvability of organisms. Laboratory biodefense goals will need quantitative tools for predicting complicated host-pathogen interactions and finding counter-measures. In this project, we seek to develop methods to simulate how external and internal signals cause the genetic apparatus to adapt and organize to produce complex biochemical systems to achieve survival. This project is specifically directed toward building a computational methodology for simulating the adaptability of genomes. This project investigated the feasibility of using a novel quantitative approach to studying the adaptability of genomes and biochemical pathways. This effort was intended to be the preliminary part of a larger, long-term effort between key leaders in computational and systems biology at Harvard University and LLNL, with Dr. Bosl as the lead PI. Scientific goals for the long-term project include the development and testing of new hypotheses to explain the observed adaptability of yeast biochemical pathways when the myosin-II gene is deleted and the development of a novel data-driven evolutionary computation as a way to connect exploratory computational simulation with hypothesis

  15. On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

    DEFF Research Database (Denmark)

    Neumann, Frank; Witt, Carsten

    2015-01-01

    combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...

  16. Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups

    NARCIS (Netherlands)

    Franca, PM; Gupta, JND; Mendes, AS; Moscato, P; Veltink, KJ

    2005-01-01

    This paper considers the problem of scheduling part families and jobs within each part family in a flowshop manufacturing cell with sequence dependent family setups times where it is desired to minimize the makespan while processing parts (jobs) in each family together. Two evolutionary algorithms-a

  17. Optimal routes scheduling for municipal waste disposal garbage trucks using evolutionary algorithm and artificial immune system

    Directory of Open Access Journals (Sweden)

    Bogna MRÓWCZYŃSKA

    2011-01-01

    Full Text Available This paper describes an application of an evolutionary algorithm and an artificial immune systems to solve a problem of scheduling an optimal route for waste disposal garbage trucks in its daily operation. Problem of an optimisation is formulated and solved using both methods. The results are presented for an area in one of the Polish cities.

  18. Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups

    NARCIS (Netherlands)

    Franca, PM; Gupta, JND; Mendes, AS; Moscato, P; Veltink, KJ

    This paper considers the problem of scheduling part families and jobs within each part family in a flowshop manufacturing cell with sequence dependent family setups times where it is desired to minimize the makespan while processing parts (jobs) in each family together. Two evolutionary algorithms-a

  19. Micro-Turbine Generation Control System Optimization Using Evolutionary algorithm

    Directory of Open Access Journals (Sweden)

    Mohanraj B S

    2014-10-01

    Full Text Available Distribution systems management is becoming an increasingly complicated issue due to the introduction of new technologies, new energy trading strategies, and new deregulated environment. In the new deregulated energy market and considering the incentives coming from the technical and economical fields, it is reasonable to consider Distributed Generation (DG as a viable option to solve the lacking electric power supply problem. This paper presents a mathematical distribution system planning model considering three planning options to system expansion and to meet the load growth requirements with a reasonable price as well as the system power quality problems. DG is introduced as an attractive planning option in competition with voltage regulator devices and Interruptible load. This paper presents a dynamic modelling and simulation of a high speed single shaft micro-turbine generation (MTG system for grid connected operation and shows genetic algorithm (GA role in improvement of control system operation. The model is developed with the consideration of the main parts including: compressor-turbine, permanent magnet (PM generator, three phase bridge rectifier and inverter. The simulation results show the capability of Genetic Algorithm for controlling MTG system. The model is developed in Mat lab / Simulink.

  20. A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems

    Directory of Open Access Journals (Sweden)

    White Michael S

    2003-01-01

    Full Text Available A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.

  1. An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering

    Institute of Scientific and Technical Information of China (English)

    Taher NIKNAM; Babak AMIRI; Javad OLAMAEI; Ali AREFI

    2009-01-01

    The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Riplcy's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.

  2. SOLVING THE PROBLEM OF VEHICLE ROUTING BY EVOLUTIONARY ALGORITHM

    Directory of Open Access Journals (Sweden)

    Remigiusz Romuald Iwańkowicz

    2016-03-01

    Full Text Available In the presented work the vehicle routing problem is formulated, which concerns planning the collection of wastes by one garbage truck from a certain number of collection points. The garbage truck begins its route in the base point, collects the load in subsequent collection points, then drives the wastes to the disposal site (landfill or sorting plant and returns to the another visited collection points. The filled garbage truck each time goes to the disposal site. It returns to the base after driving wastes from all collection points. Optimization model is based on genetic algorithm where individual is the whole garbage collection plan. Permutation is proposed as the code of the individual.

  3. An Evolutionary Algorithm for Enhanced Magnetic Resonance Imaging Classification

    Directory of Open Access Journals (Sweden)

    T.S. Murunya

    2014-11-01

    Full Text Available This study presents an image classification method for retrieval of images from a multi-varied MRI database. With the development of sophisticated medical imaging technology which helps doctors in diagnosis, medical image databases contain a huge amount of digital images. Magnetic Resonance Imaging (MRI is a widely used imaging technique which picks signals from a body's magnetic particles spinning to magnetic tune and through a computer converts scanned data into pictures of internal organs. Image processing techniques are required to analyze medical images and retrieve it from database. The proposed framework extracts features using Moment Invariants (MI and Wavelet Packet Tree (WPT. Extracted features are reduced using Correlation based Feature Selection (CFS and a CFS with cuckoo search algorithm is proposed. Naïve Bayes and K-Nearest Neighbor (KNN classify the selected features. National Biomedical Imaging Archive (NBIA dataset including colon, brain and chest is used to evaluate the framework.

  4. Congestion Relief of Contingent Power Network with Evolutionary Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Abhinandan De

    2012-03-01

    Full Text Available This paper presents a differential evolution optimization technique based methodology for congestion management cost optimization of contingent power networks. In Deregulated systems, line congestion apart from causing stability problems can increase the cost of electricity. Restraining line flow to a particular level of congestion is quite imperative from stability as well as economy point of view. Employing ‘Congestion Sensitivity Index’ proposed in this paper, the algorithm proposed can be adopted for selecting the congested lines in a power networks and then to search for a congestion constrained optimal generation schedule at the cost of a minimum ‘congestion management charge’ without any load curtailment and installation of FACTS devices. It has been depicted that the methodology on application can provide better operating conditions in terms of improvement of bus voltage and loss profile of the system. The efficiency of the proposed methodology has been tested on an IEEE 30 bus benchmark system and the results look promising.

  5. A SAA-based Novel Hybrid Intelligent Evolutionary Algorithm for Job Shop Scheduling Problem

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Through systematic analysis and comparison of the common features of SAA, ES and traditional LS (local search) algorithm, a new hybrid strategy of mixing SA, ES with LS, namely HIEA (Hybrid Intelligent Evolutionary Algorithm), is proposed in this paper. Viewed as a whole, the hybrid strategy is also an intelligent heuristic searching procedure. But it has some characteristics such as generality, robustness, etc., because it synthesizes advantages of SA, ES and LS, while the shortages of the three methods are overcome. This paper applies Markov chain theory to describe the hybrid strategy mathematically, and proves that the algorithm possesses the global asymptotical convergence and analyzes the performance of HIEA.

  6. Influence of Topological Features on Spatially-Structured Evolutionary Algorithms Dynamics

    CERN Document Server

    DeFelice, Matteo; Panzieri, Stefano

    2012-01-01

    In the last decades, complex networks theory significantly influenced other disciplines on the modeling of both static and dynamic aspects of systems observed in nature. This work aims to investigate the effects of networks' topological features on the dynamics of an evolutionary algorithm, considering in particular the ability to find a large number of optima on multi-modal problems. We introduce a novel spatially-structured evolutionary algorithm and we apply it on two combinatorial problems: ONEMAX and the multi-modal NMAX. Considering three different network models we investigate the relationships between their features, algorithm's convergence and its ability to find multiple optima (for the multi-modal problem). In order to perform a deeper analysis we investigate the introduction of weighted graphs with time-varying weights. The results show that networks with a large Average Path Length lead to an higher number of optima and a consequent slow exploration dynamics (i.e. low First Hitting Time). Further...

  7. EXPLORATION/EXPLOITATION TRADEOFF WITH CELL-SHIFT AND HEURISTIC CROSSOVER FOR EVOLUTIONARY ALGORITHMS

    Institute of Scientific and Technical Information of China (English)

    Xinchao ZHAO; Junling HAO

    2007-01-01

    In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cellshift crossover operator for evolutionary algorithm(EA) is proposed in this paper.The definition domain is divided into n-dimension cubic sub-domains(cell) and each individual locates at an ndimensional cube.Cell-shift crossover first exchanges the cell numbers of the crossover pair if they are in the different cells(exploration)and subsequently shift the first individual from its initial place to the other individual's cell place.If they are already in the same cell heuristic crossover(exploitation) is used.Cell-shift/heuristic crossover adaptively executes exploration/exploitation search with the vary of genetic diversity.The cell-shift EA has excellent performance in terms of efficiency and efficacy on ten usually used optimization benchmarks when comparing with the recent well-known FEP evolutionary algorithm.

  8. The (1+λ) evolutionary algorithm with self-adjusting mutation rate

    DEFF Research Database (Denmark)

    Doerr, Benjamin; Witt, Carsten; Gießen, Christian

    2017-01-01

    is then updated to the rate used in that subpopulation which contains the best offspring. We analyze how the (1 + A) evolutionary algorithm with this self-adjusting mutation rate optimizes the OneMax test function. We prove that this dynamic version of the (1 + A) EA finds the optimum in an expected optimization...... time (number of fitness evaluations) of O(nA/log A + n log n). This time is asymptotically smaller than the optimization time of the classic (1 + A) EA. Previous work shows that this performance is best-possible among all A-parallel mutation-based unbiased black-box algorithms. This result shows......We propose a new way to self-adjust the mutation rate in population-based evolutionary algorithms. Roughly speaking, it consists of creating half the offspring with a mutation rate that is twice the current mutation rate and the other half with half the current rate. The mutation rate...

  9. An Encoding Technique for Multiobjective Evolutionary Algorithms Applied to Power Distribution System Reconfiguration

    Directory of Open Access Journals (Sweden)

    J. L. Guardado

    2014-01-01

    Full Text Available Network reconfiguration is an alternative to reduce power losses and optimize the operation of power distribution systems. In this paper, an encoding scheme for evolutionary algorithms is proposed in order to search efficiently for the Pareto-optimal solutions during the reconfiguration of power distribution systems considering multiobjective optimization. The encoding scheme is based on the edge window decoder (EWD technique, which was embedded in the Strength Pareto Evolutionary Algorithm 2 (SPEA2 and the Nondominated Sorting Genetic Algorithm II (NSGA-II. The effectiveness of the encoding scheme was proved by solving a test problem for which the true Pareto-optimal solutions are known in advance. In order to prove the practicability of the encoding scheme, a real distribution system was used to find the near Pareto-optimal solutions for different objective functions to optimize.

  10. A Multiagent Evolutionary Algorithm for the Resource-Constrained Project Portfolio Selection and Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Yongyi Shou

    2014-01-01

    Full Text Available A multiagent evolutionary algorithm is proposed to solve the resource-constrained project portfolio selection and scheduling problem. The proposed algorithm has a dual level structure. In the upper level a set of agents make decisions to select appropriate project portfolios. Each agent selects its project portfolio independently. The neighborhood competition operator and self-learning operator are designed to improve the agent’s energy, that is, the portfolio profit. In the lower level the selected projects are scheduled simultaneously and completion times are computed to estimate the expected portfolio profit. A priority rule-based heuristic is used by each agent to solve the multiproject scheduling problem. A set of instances were generated systematically from the widely used Patterson set. Computational experiments confirmed that the proposed evolutionary algorithm is effective for the resource-constrained project portfolio selection and scheduling problem.

  11. An encoding technique for multiobjective evolutionary algorithms applied to power distribution system reconfiguration.

    Science.gov (United States)

    Guardado, J L; Rivas-Davalos, F; Torres, J; Maximov, S; Melgoza, E

    2014-01-01

    Network reconfiguration is an alternative to reduce power losses and optimize the operation of power distribution systems. In this paper, an encoding scheme for evolutionary algorithms is proposed in order to search efficiently for the Pareto-optimal solutions during the reconfiguration of power distribution systems considering multiobjective optimization. The encoding scheme is based on the edge window decoder (EWD) technique, which was embedded in the Strength Pareto Evolutionary Algorithm 2 (SPEA2) and the Nondominated Sorting Genetic Algorithm II (NSGA-II). The effectiveness of the encoding scheme was proved by solving a test problem for which the true Pareto-optimal solutions are known in advance. In order to prove the practicability of the encoding scheme, a real distribution system was used to find the near Pareto-optimal solutions for different objective functions to optimize.

  12. A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems

    Science.gov (United States)

    Cao, Leilei; Xu, Lihong; Goodman, Erik D.

    2016-01-01

    A Guiding Evolutionary Algorithm (GEA) with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared. PMID:27293421

  13. A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems

    Directory of Open Access Journals (Sweden)

    Leilei Cao

    2016-01-01

    Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.

  14. A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems.

    Science.gov (United States)

    Cao, Leilei; Xu, Lihong; Goodman, Erik D

    2016-01-01

    A Guiding Evolutionary Algorithm (GEA) with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.

  15. A Probability-based Evolutionary Algorithm with Mutations to Learn Bayesian Networks

    Directory of Open Access Journals (Sweden)

    Sho Fukuda

    2014-12-01

    Full Text Available Bayesian networks are regarded as one of the essential tools to analyze causal relationship between events from data. To learn the structure of highly-reliable Bayesian networks from data as quickly as possible is one of the important problems that several studies have been tried to achieve. In recent years, probability-based evolutionary algorithms have been proposed as a new efficient approach to learn Bayesian networks. In this paper, we target on one of the probability-based evolutionary algorithms called PBIL (Probability-Based Incremental Learning, and propose a new mutation operator. Through performance evaluation, we found that the proposed mutation operator has a good performance in learning Bayesian networks

  16. Models of performance of evolutionary program induction algorithms based on indicators of problem difficulty.

    Science.gov (United States)

    Graff, Mario; Poli, Riccardo; Flores, Juan J

    2013-01-01

    Modeling the behavior of algorithms is the realm of evolutionary algorithm theory. From a practitioner's point of view, theory must provide some guidelines regarding which algorithm/parameters to use in order to solve a particular problem. Unfortunately, most theoretical models of evolutionary algorithms are difficult to apply to realistic situations. However, in recent work (Graff and Poli, 2008, 2010), where we developed a method to practically estimate the performance of evolutionary program-induction algorithms (EPAs), we started addressing this issue. The method was quite general; however, it suffered from some limitations: it required the identification of a set of reference problems, it required hand picking a distance measure in each particular domain, and the resulting models were opaque, typically being linear combinations of 100 features or more. In this paper, we propose a significant improvement of this technique that overcomes the three limitations of our previous method. We achieve this through the use of a novel set of features for assessing problem difficulty for EPAs which are very general, essentially based on the notion of finite difference. To show the capabilities or our technique and to compare it with our previous performance models, we create models for the same two important classes of problems-symbolic regression on rational functions and Boolean function induction-used in our previous work. We model a variety of EPAs. The comparison showed that for the majority of the algorithms and problem classes, the new method produced much simpler and more accurate models than before. To further illustrate the practicality of the technique and its generality (beyond EPAs), we have also used it to predict the performance of both autoregressive models and EPAs on the problem of wind speed forecasting, obtaining simpler and more accurate models that outperform in all cases our previous performance models.

  17. Differential evolutionary algorithm for distribution capacitor allocation considering varying load conditions

    OpenAIRE

    Karimi, Mohammad

    2011-01-01

    Many loads in power systems are inductive loads then consume reactive power, this fact lead to drop voltage and in worst case blackout and collapse voltage. Best option in distribution networks for avoid of this problem is installation of capacitor bank. In capacitor installation, finding optimal location and size of capacitor have special importance. In this paper, Differential Evolutionary (DE) algorithm is proposed for optimal placement and sizing of capacitor. Our objective funct...

  18. XTALOPT Version r10: An open-source evolutionary algorithm for crystal structure prediction

    Science.gov (United States)

    Avery, Patrick; Falls, Zackary; Zurek, Eva

    2017-08-01

    A new version of XTALOPT, an evolutionary algorithm for crystal structure prediction, is available for download from the CPC library or the XTALOPT website, http://xtalopt.github.io. XTALOPT is published under the Gnu Public License (GPL), which is an open source license that is recognized by the Open Source Initiative. The new version incorporates many bug-fixes and new features, as detailed below.

  19. δ-Similar Elimination to Enhance Search Performance of Multiobjective Evolutionary Algorithms

    Science.gov (United States)

    Aguirre, Hernán; Sato, Masahiko; Tanaka, Kiyoshi

    In this paper, we propose δ-similar elimination to improve the search performance of multiobjective evolutionary algorithms in combinatorial optimization problems. This method eliminates similar individuals in objective space to fairly distribute selection among the different regions of the instantaneous Pareto front. We investigate four eliminating methods analyzing their effects using NSGA-II. In addition, we compare the search performance of NSGA-II enhanced by our method and NSGA-II enhanced by controlled elitism.

  20. Combining Diffusion and Grey Models Based on Evolutionary Optimization Algorithms to Forecast Motherboard Shipments

    Directory of Open Access Journals (Sweden)

    Fu-Kwun Wang

    2012-01-01

    Full Text Available It is important for executives to predict the future trends. Otherwise, their companies cannot make profitable decisions and investments. The Bass diffusion model can describe the empirical adoption curve for new products and technological innovations. The Grey model provides short-term forecasts using four data points. This study develops a combined model based on the rolling Grey model (RGM and the Bass diffusion model to forecast motherboard shipments. In addition, we investigate evolutionary optimization algorithms to determine the optimal parameters. Our results indicate that the combined model using a hybrid algorithm outperforms other methods for the fitting and forecasting processes in terms of mean absolute percentage error.

  1. A New Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Complex Networks

    Directory of Open Access Journals (Sweden)

    Guoqiang Chen

    2013-01-01

    Full Text Available Community detection in dynamic networks is an important research topic and has received an enormous amount of attention in recent years. Modularity is selected as a measure to quantify the quality of the community partition in previous detection methods. But, the modularity has been exposed to resolution limits. In this paper, we propose a novel multiobjective evolutionary algorithm for dynamic networks community detection based on the framework of nondominated sorting genetic algorithm. Modularity density which can address the limitations of modularity function is adopted to measure the snapshot cost, and normalized mutual information is selected to measure temporal cost, respectively. The characteristics knowledge of the problem is used in designing the genetic operators. Furthermore, a local search operator was designed, which can improve the effectiveness and efficiency of community detection. Experimental studies based on synthetic datasets show that the proposed algorithm can obtain better performance than the compared algorithms.

  2. A New Evolutionary Algorithm for Solving Multi-Objective Optimization Problems

    Institute of Scientific and Technical Information of China (English)

    Chen Wen-ping; Kang Li-shan

    2003-01-01

    Multi-objective optimization is a new focus of evolutionary computation research. This paper puts forward a new algorithm, which can not only converge quickly, but also keep diversity among population efficiently, in order to find the Pareto-optimal set. This new algorithm replaces the worst individual with a newly-created one by "multi parent crossover", so that the population could converge near the true Pareto-optimal solutions in the end. At the same time, this new algorithm adopts niching and fitness-sharing techniques to keep the population in a good distribution. Numerical experiments show that the algorithm is rather effective in solving some Benchmarks. No matter whether the Pareto front of problems is convex or non-convex, continuous or discontinuous, and the problems are with constraints or not, the program turns out to do well.

  3. A New Algorithm for On- Line Handwriting Signature Verification Based on Evolutionary Computation

    Institute of Scientific and Technical Information of China (English)

    ZHENG Jianbin; ZHU Guangxi

    2006-01-01

    The paper proposes an on-line signature verification algorithm, through which test sample and template signatures can be optimizedly matched, based on evolutionary computation (EC). Firstly, the similarity of signature curve segment is defined, and shift and scale transforms are also introduced due to the randoness of on-line signature. Secondly,this paper puts forward signature verification matching algorithm after establishment of the mathematical model. Thirdly, the concrete realization of the algorithm based on EC is discussed as well. In addition, the influence of shift and scale on the matching result is fully considered in the algorithm.Finally, a computation example is given, and the matching results between the test sample curve and the template signature curve are analyzed in detail. The preliminary experiments reveal that the type of signature verification problem can be solved by EC.

  4. Development of a Multi-Objective Evolutionary Algorithm for Strain-Enhanced Quantum Cascade Lasers

    Directory of Open Access Journals (Sweden)

    David Mueller

    2016-07-01

    Full Text Available An automated design approach using an evolutionary algorithm for the development of quantum cascade lasers (QCLs is presented. Our algorithmic approach merges computational intelligence techniques with the physics of device structures, representing a design methodology that reduces experimental effort and costs. The algorithm was developed to produce QCLs with a three-well, diagonal-transition active region and a five-well injector region. Specifically, we applied this technique to Al x Ga 1 - x As/In y Ga 1 - y As strained active region designs. The algorithmic approach is a non-dominated sorting method using four aggregate objectives: target wavelength, population inversion via longitudinal-optical (LO phonon extraction, injector level coupling, and an optical gain metric. Analysis indicates that the most plausible device candidates are a result of the optical gain metric and a total aggregate of all objectives. However, design limitations exist in many of the resulting candidates, indicating need for additional objective criteria and parameter limits to improve the application of this and other evolutionary algorithm methods.

  5. A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Qianwang Deng

    2017-01-01

    Full Text Available Flexible job-shop scheduling problem (FJSP is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II for multiobjective FJSP (MO-FJSP with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N, in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed.

  6. A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling.

    Science.gov (United States)

    Deng, Qianwang; Gong, Guiliang; Gong, Xuran; Zhang, Like; Liu, Wei; Ren, Qinghua

    2017-01-01

    Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N, in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed.

  7. How effective and efficient are multiobjective evolutionary algorithms at hydrologic model calibration?

    Directory of Open Access Journals (Sweden)

    Y. Tang

    2006-01-01

    Full Text Available This study provides a comprehensive assessment of state-of-the-art evolutionary multiobjective optimization (EMO tools' relative effectiveness in calibrating hydrologic models. The relative computational efficiency, accuracy, and ease-of-use of the following EMO algorithms are tested: Epsilon Dominance Nondominated Sorted Genetic Algorithm-II (ε-NSGAII, the Multiobjective Shuffled Complex Evolution Metropolis algorithm (MOSCEM-UA, and the Strength Pareto Evolutionary Algorithm 2 (SPEA2. This study uses three test cases to compare the algorithms' performances: (1 a standardized test function suite from the computer science literature, (2 a benchmark hydrologic calibration test case for the Leaf River near Collins, Mississippi, and (3 a computationally intensive integrated surface-subsurface model application in the Shale Hills watershed in Pennsylvania. One challenge and contribution of this work is the development of a methodology for comprehensively comparing EMO algorithms that have different search operators and randomization techniques. Overall, SPEA2 attained competitive to superior results for most of the problems tested in this study. The primary strengths of the SPEA2 algorithm lie in its search reliability and its diversity preservation operator. The biggest challenge in maximizing the performance of SPEA2 lies in specifying an effective archive size without a priori knowledge of the Pareto set. In practice, this would require significant trial-and-error analysis, which is problematic for more complex, computationally intensive calibration applications. ε-NSGAII appears to be superior to MOSCEM-UA and competitive with SPEA2 for hydrologic model calibration. ε-NSGAII's primary strength lies in its ease-of-use due to its dynamic population sizing and archiving which lead to rapid convergence to very high quality solutions with minimal user input. MOSCEM-UA is best suited for hydrologic model calibration applications that have small

  8. Optimization of externalities using DTM measures: a Pareto optimal multi objective optimization using the evolutionary algorithm SPEA2+

    NARCIS (Netherlands)

    Wismans, Luc; Berkum, van Eric; Bliemer, Michiel; Allkim, T.P.; Arem, van B.

    2748-01-01

    Multi objective optimization of externalities of traffic is performed solving a network design problem in which Dynamic Traffic Management measures are used. The resulting Pareto optimal set is determined by employing the SPEA2+ evolutionary algorithm.

  9. ETEA: a Euclidean minimum spanning tree-based evolutionary algorithm for multi-objective optimization.

    Science.gov (United States)

    Li, Miqing; Yang, Shengxiang; Zheng, Jinhua; Liu, Xiaohui

    2014-01-01

    The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in space where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and position information of solutions. This paper explores the properties of EMSTs and proposes an EMST-based evolutionary algorithm (ETEA) to solve multi-objective optimization problems (MOPs). Unlike most EMO algorithms that focus on the Pareto dominance relation, the proposed algorithm mainly considers distance-based measures to evaluate and compare individuals during the evolutionary search. Specifically, in ETEA, four strategies are introduced: (1) An EMST-based crowding distance (ETCD) is presented to estimate the density of individuals in the population; (2) A distance comparison approach incorporating ETCD is used to assign the fitness value for individuals; (3) A fitness adjustment technique is designed to avoid the partial overcrowding in environmental selection; (4) Three diversity indicators-the minimum edge, degree, and ETCD-with regard to EMSTs are applied to determine the survival of individuals in archive truncation. From a series of extensive experiments on 32 test instances with different characteristics, ETEA is found to be competitive against five state-of-the-art algorithms and its predecessor in providing a good balance among convergence, uniformity, and spread.

  10. A diagnostic assessment of evolutionary algorithms for multi-objective surface water reservoir control

    Science.gov (United States)

    Zatarain Salazar, Jazmin; Reed, Patrick M.; Herman, Jonathan D.; Giuliani, Matteo; Castelletti, Andrea

    2016-06-01

    Globally, the pressures of expanding populations, climate change, and increased energy demands are motivating significant investments in re-operationalizing existing reservoirs or designing operating policies for new ones. These challenges require an understanding of the tradeoffs that emerge across the complex suite of multi-sector demands in river basin systems. This study benchmarks our current capabilities to use Evolutionary Multi-Objective Direct Policy Search (EMODPS), a decision analytic framework in which reservoirs' candidate operating policies are represented using parameterized global approximators (e.g., radial basis functions) then those parameterized functions are optimized using multi-objective evolutionary algorithms to discover the Pareto approximate operating policies. We contribute a comprehensive diagnostic assessment of modern MOEAs' abilities to support EMODPS using the Conowingo reservoir in the Lower Susquehanna River Basin, Pennsylvania, USA. Our diagnostic results highlight that EMODPS can be very challenging for some modern MOEAs and that epsilon dominance, time-continuation, and auto-adaptive search are helpful for attaining high levels of performance. The ɛ-MOEA, the auto-adaptive Borg MOEA, and ɛ-NSGAII all yielded superior results for the six-objective Lower Susquehanna benchmarking test case. The top algorithms show low sensitivity to different MOEA parameterization choices and high algorithmic reliability in attaining consistent results for different random MOEA trials. Overall, EMODPS poses a promising method for discovering key reservoir management tradeoffs; however algorithmic choice remains a key concern for problems of increasing complexity.

  11. Large-Scale Portfolio Optimization Using Multiobjective Evolutionary Algorithms and Preselection Methods

    Directory of Open Access Journals (Sweden)

    B. Y. Qu

    2017-01-01

    Full Text Available Portfolio optimization problems involve selection of different assets to invest in order to maximize the overall return and minimize the overall risk simultaneously. The complexity of the optimal asset allocation problem increases with an increase in the number of assets available to select from for investing. The optimization problem becomes computationally challenging when there are more than a few hundreds of assets to select from. To reduce the complexity of large-scale portfolio optimization, two asset preselection procedures that consider return and risk of individual asset and pairwise correlation to remove assets that may not potentially be selected into any portfolio are proposed in this paper. With these asset preselection methods, the number of assets considered to be included in a portfolio can be increased to thousands. To test the effectiveness of the proposed methods, a Normalized Multiobjective Evolutionary Algorithm based on Decomposition (NMOEA/D algorithm and several other commonly used multiobjective evolutionary algorithms are applied and compared. Six experiments with different settings are carried out. The experimental results show that with the proposed methods the simulation time is reduced while return-risk trade-off performances are significantly improved. Meanwhile, the NMOEA/D is able to outperform other compared algorithms on all experiments according to the comparative analysis.

  12. Individually Directional Evolutionary Algorithm for Solving Global Optimization Problems-Comparative Study

    Directory of Open Access Journals (Sweden)

    Łukasz Kubuś

    2015-08-01

    Full Text Available Limited applicability of classical optimization methods influence the popularization of stochastic optimization techniques such as evolutionary algorithms (EAs. EAs are a class of probabilistic optimization techniques inspired by natural evolution process, witch belong to methods of Computational Intelligence (CI. EAs are based on concepts of natural selection and natural genetics. The basic principle of EA is searching optimal solution by processing population of individuals. This paper presents the results of simulation analysis of global optimization of benchmark function by Individually Directional Evolutionary Algorithm (IDEA and other EAs such as Real Coded Genetic Algorithm (RCGA, elite RCGA with the one elite individual, elite RCGA with the number of elite individuals equal to population size. IDEA is a newly developed algorithm for global optimization. Main principle of IDEA is to monitor and direct the evolution of selected individuals of population to explore promising areas in the search space. The idea of IDEA is an independent evolution of individuals in current population. This process is focused on indicating correct direction of changes in the elements of solution vector. This paper presents a flowchart, selection method and genetic operators used in IDEA. Moreover, similar mechanisms and genetic operators are also discussed.

  13. Evolutionary algorithm based offline/online path planner for UAV navigation.

    Science.gov (United States)

    Nikolos, I K; Valavanis, K P; Tsourveloudis, N C; Kostaras, A N

    2003-01-01

    An evolutionary algorithm based framework, a combination of modified breeder genetic algorithms incorporating characteristics of classic genetic algorithms, is utilized to design an offline/online path planner for unmanned aerial vehicles (UAVs) autonomous navigation. The path planner calculates a curved path line with desired characteristics in a three-dimensional (3-D) rough terrain environment, represented using B-spline curves, with the coordinates of its control points being the evolutionary algorithm artificial chromosome genes. Given a 3-D rough environment and assuming flight envelope restrictions, two problems are solved: i) UAV navigation using an offline planner in a known environment, and, ii) UAV navigation using an online planner in a completely unknown environment. The offline planner produces a single B-Spline curve that connects the starting and target points with a predefined initial direction. The online planner, based on the offline one, is given on-board radar readings which gradually produces a smooth 3-D trajectory aiming at reaching a predetermined target in an unknown environment; the produced trajectory consists of smaller B-spline curves smoothly connected with each other. Both planners have been tested under different scenarios, and they have been proven effective in guiding an UAV to its final destination, providing near-optimal curved paths quickly and efficiently.

  14. Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios

    Directory of Open Access Journals (Sweden)

    Lyubetsky Vassily A

    2012-12-01

    Full Text Available Abstract Background A long recognized problem is the inference of the supertree S that amalgamates a given set {Gj} of trees Gj, with leaves in each Gj being assigned homologous elements. We ground on an approach to find the tree S by minimizing the total cost of mappings αj of individual gene trees Gj into S. Traditionally, this cost is defined basically as a sum of duplications and gaps in each αj. The classical problem is to minimize the total cost, where S runs over the set of all trees that contain an exhaustive non-redundant set of species from all input Gj. Results We suggest a reformulation of the classical NP-hard problem of building a supertree in terms of the global minimization of the same cost functional but only over species trees S that consist of clades belonging to a fixed set P (e.g., an exhaustive set of clades in all Gj. We developed a deterministic solving algorithm with a low degree polynomial (typically cubic time complexity with respect to the size of input data. We define an extensive set of elementary evolutionary events and suggest an original definition of mapping β of tree G into tree S. We introduce the cost functional c(G, S, f and define the mapping β as the global minimum of this functional with respect to the variable f, in which sense it is a generalization of classical mapping α. We suggest a reformulation of the classical NP-hard mapping (reconciliation problem by introducing time slices into the species tree S and present a cubic time solving algorithm to compute the mapping β. We introduce two novel definitions of the evolutionary scenario based on mapping β or a random process of gene evolution along a species tree. Conclusions Developed algorithms are mathematically proved, which justifies the following statements. The supertree building algorithm finds exactly the global minimum of the total cost if only gene duplications and losses are allowed and the given sets of gene trees satisfies a certain

  15. Application of evolutionary algorithms for multi-objective optimization in VLSI and embedded systems

    CERN Document Server

    2015-01-01

    This book describes how evolutionary algorithms (EA), including genetic algorithms (GA) and particle swarm optimization (PSO) can be utilized for solving multi-objective optimization problems in the area of embedded and VLSI system design. Many complex engineering optimization problems can be modelled as multi-objective formulations. This book provides an introduction to multi-objective optimization using meta-heuristic algorithms, GA and PSO, and how they can be applied to problems like hardware/software partitioning in embedded systems, circuit partitioning in VLSI, design of operational amplifiers in analog VLSI, design space exploration in high-level synthesis, delay fault testing in VLSI testing, and scheduling in heterogeneous distributed systems. It is shown how, in each case, the various aspects of the EA, namely its representation, and operators like crossover, mutation, etc. can be separately formulated to solve these problems. This book is intended for design engineers and researchers in the field ...

  16. Global Evolutionary Algorithms in the Design of Electromagnetic Band Gap Structures with Suppressed Surface Waves Propagation

    Directory of Open Access Journals (Sweden)

    P. Kovacs

    2010-04-01

    Full Text Available The paper is focused on the automated design and optimization of electromagnetic band gap structures suppressing the propagation of surface waves. For the optimization, we use different global evolutionary algorithms like the genetic algorithm with the single-point crossover (GAs and the multi-point (GAm one, the differential evolution (DE and particle swarm optimization (PSO. The algorithms are mutually compared in terms of convergence velocity and accuracy. The developed technique is universal (applicable for any unit cell geometry. The method is based on the dispersion diagram calculation in CST Microwave Studio (CST MWS and optimization in Matlab. A design example of a mushroom structure with simultaneous electromagnetic band gap properties (EBG and the artificial magnetic conductor ones (AMC in the required frequency band is presented.

  17. Classification of Medical Datasets Using SVMs with Hybrid Evolutionary Algorithms Based on Endocrine-Based Particle Swarm Optimization and Artificial Bee Colony Algorithms.

    Science.gov (United States)

    Lin, Kuan-Cheng; Hsieh, Yi-Hsiu

    2015-10-01

    The classification and analysis of data is an important issue in today's research. Selecting a suitable set of features makes it possible to classify an enormous quantity of data quickly and efficiently. Feature selection is generally viewed as a problem of feature subset selection, such as combination optimization problems. Evolutionary algorithms using random search methods have proven highly effective in obtaining solutions to problems of optimization in a diversity of applications. In this study, we developed a hybrid evolutionary algorithm based on endocrine-based particle swarm optimization (EPSO) and artificial bee colony (ABC) algorithms in conjunction with a support vector machine (SVM) for the selection of optimal feature subsets for the classification of datasets. The results of experiments using specific UCI medical datasets demonstrate that the accuracy of the proposed hybrid evolutionary algorithm is superior to that of basic PSO, EPSO and ABC algorithms, with regard to classification accuracy using subsets with a reduced number of features.

  18. Anticipation versus adaptation in Evolutionary Algorithms: The case of Non-Stationary Clustering

    Science.gov (United States)

    González, A. I.; Graña, M.; D'Anjou, A.; Torrealdea, F. J.

    1998-07-01

    From the technological point of view is usually more important to ensure the ability to react promptly to changing environmental conditions than to try to forecast them. Evolution Algorithms were proposed initially to drive the adaptation of complex systems to varying or uncertain environments. In the general setting, the adaptive-anticipatory dilemma reduces itself to the placement of the interaction with the environment in the computational schema. Adaptation consists of the estimation of the proper parameters from present data in order to react to a present environment situation. Anticipation consists of the estimation from present data in order to react to a future environment situation. This duality is expressed in the Evolutionary Computation paradigm by the precise location of the consideration of present data in the computation of the individuals fitness function. In this paper we consider several instances of Evolutionary Algorithms applied to precise problem and perform an experiment that test their response as anticipative and adaptive mechanisms. The non stationary problem considered is that of Non Stationary Clustering, more precisely the adaptive Color Quantization of image sequences. The experiment illustrates our ideas and gives some quantitative results that may support the proposition of the Evolutionary Computation paradigm for other tasks that require the interaction with a Non-Stationary environment.

  19. An efficient hybrid evolutionary algorithm based on PSO and HBMO algorithms for multi-objective Distribution Feeder Reconfiguration

    Energy Technology Data Exchange (ETDEWEB)

    Niknam, Taher [Electronic and Electrical Engineering Department, Shiraz University of Technology, Shiraz (Iran)

    2009-08-15

    This paper introduces a robust searching hybrid evolutionary algorithm to solve the multi-objective Distribution Feeder Reconfiguration (DFR). The main objective of the DFR is to minimize the real power loss, deviation of the nodes' voltage, the number of switching operations, and balance the loads on the feeders. Because of the fact that the objectives are different and no commensurable, it is difficult to solve the problem by conventional approaches that may optimize a single objective. This paper presents a new approach based on norm3 for the DFR problem. In the proposed method, the objective functions are considered as a vector and the aim is to maximize the distance (norm2) between the objective function vector and the worst objective function vector while the constraints are met. Since the proposed DFR is a multi objective and non-differentiable optimization problem, a new hybrid evolutionary algorithm (EA) based on the combination of the Honey Bee Mating Optimization (HBMO) and the Discrete Particle Swarm Optimization (DPSO), called DPSO-HBMO, is implied to solve it. The results of the proposed reconfiguration method are compared with the solutions obtained by other approaches, the original DPSO and HBMO over different distribution test systems. (author)

  20. Hybrid chaotic quantum evolutionary algorithm%混合混沌量子进化算法

    Institute of Scientific and Technical Information of China (English)

    蔡延光; 张敏捷; 蔡颢; 章云

    2012-01-01

    针对量子进化算法计算量大、收敛速度慢以及容易出现早熟等问题,提出混合混沌量子进化算法.该算法采用混沌初始化方法产生初始种群,使种群具有较好的多样性;采用简单量子旋转门更新当前种群中的非最优个体,降低算法的计算量;提出混合混沌搜索策略以提高算法的收敛速度和全局搜索能力.大量的测试表明,与量子进化算法、实数编码量子进化算法和混合量子遗传算法相比,所提出的算法具有较快的收敛速度和较好的寻优能力.大量的测试也表明,若将混沌引入量子进化算法,则混合混沌搜索策略的综合性能明显优于载波混沌策略,在大多数情况下优于混沌变异策略.本文提出的算法是惟一的每次测试都收敛的算法,且实现简单,便于工程应用.将其用于求解城市道路的交通信号配时优化问题,实际效果令人满意.%In order to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm, a hybrid chaotic quantum evolutionary algorithm is presented. The algorithm uses the chaotic initialization method to generate initial population that have better diversity, the simple quantum rotation gate to update non-optimal individuals of population to reduce amount of computation, and the hybrid chaotic search strategy to speed up its convergence and enhance its global search ability. A large number of tests show that the proposed algorithm has higher convergence speed and better optimizing ability than quantum evolutionary algorithm, real-coded quantum evolutionary algorithm and hybrid quantum genetic algorithm. Tests also show that when chaos is introduced to quantum evolutionary algorithm, the hybrid chaotic search strategy is superior to the carrier chaotic strategy, and has better comprehensive performance than the chaotic mutation strategy in most of cases. The proposed algorithm is the only one all

  1. An Evolutionary Algorithm for Multiobjective Fuzzy Portfolio Selection Models with Transaction Cost and Liquidity

    Directory of Open Access Journals (Sweden)

    Wei Yue

    2015-01-01

    Full Text Available The major issues for mean-variance-skewness models are the errors in estimations that cause corner solutions and low diversity in the portfolio. In this paper, a multiobjective fuzzy portfolio selection model with transaction cost and liquidity is proposed to maintain the diversity of portfolio. In addition, we have designed a multiobjective evolutionary algorithm based on decomposition of the objective space to maintain the diversity of obtained solutions. The algorithm is used to obtain a set of Pareto-optimal portfolios with good diversity and convergence. To demonstrate the effectiveness of the proposed model and algorithm, the performance of the proposed algorithm is compared with the classic MOEA/D and NSGA-II through some numerical examples based on the data of the Shanghai Stock Exchange Market. Simulation results show that our proposed algorithm is able to obtain better diversity and more evenly distributed Pareto front than the other two algorithms and the proposed model can maintain quite well the diversity of portfolio. The purpose of this paper is to deal with portfolio problems in the weighted possibilistic mean-variance-skewness (MVS and possibilistic mean-variance-skewness-entropy (MVS-E frameworks with transaction cost and liquidity and to provide different Pareto-optimal investment strategies as diversified as possible for investors at a time, rather than one strategy for investors at a time.

  2. Exploiting Genomic Knowledge in Optimising Molecular Breeding Programmes: Algorithms from Evolutionary Computing

    Science.gov (United States)

    O'Hagan, Steve; Knowles, Joshua; Kell, Douglas B.

    2012-01-01

    Comparatively few studies have addressed directly the question of quantifying the benefits to be had from using molecular genetic markers in experimental breeding programmes (e.g. for improved crops and livestock), nor the question of which organisms should be mated with each other to best effect. We argue that this requires in silico modelling, an approach for which there is a large literature in the field of evolutionary computation (EC), but which has not really been applied in this way to experimental breeding programmes. EC seeks to optimise measurable outcomes (phenotypic fitnesses) by optimising in silico the mutation, recombination and selection regimes that are used. We review some of the approaches from EC, and compare experimentally, using a biologically relevant in silico landscape, some algorithms that have knowledge of where they are in the (genotypic) search space (G-algorithms) with some (albeit well-tuned ones) that do not (F-algorithms). For the present kinds of landscapes, F- and G-algorithms were broadly comparable in quality and effectiveness, although we recognise that the G-algorithms were not equipped with any ‘prior knowledge’ of epistatic pathway interactions. This use of algorithms based on machine learning has important implications for the optimisation of experimental breeding programmes in the post-genomic era when we shall potentially have access to the full genome sequence of every organism in a breeding population. The non-proprietary code that we have used is made freely available (via Supplementary information). PMID:23185279

  3. Exploiting genomic knowledge in optimising molecular breeding programmes: algorithms from evolutionary computing.

    Directory of Open Access Journals (Sweden)

    Steve O'Hagan

    Full Text Available Comparatively few studies have addressed directly the question of quantifying the benefits to be had from using molecular genetic markers in experimental breeding programmes (e.g. for improved crops and livestock, nor the question of which organisms should be mated with each other to best effect. We argue that this requires in silico modelling, an approach for which there is a large literature in the field of evolutionary computation (EC, but which has not really been applied in this way to experimental breeding programmes. EC seeks to optimise measurable outcomes (phenotypic fitnesses by optimising in silico the mutation, recombination and selection regimes that are used. We review some of the approaches from EC, and compare experimentally, using a biologically relevant in silico landscape, some algorithms that have knowledge of where they are in the (genotypic search space (G-algorithms with some (albeit well-tuned ones that do not (F-algorithms. For the present kinds of landscapes, F- and G-algorithms were broadly comparable in quality and effectiveness, although we recognise that the G-algorithms were not equipped with any 'prior knowledge' of epistatic pathway interactions. This use of algorithms based on machine learning has important implications for the optimisation of experimental breeding programmes in the post-genomic era when we shall potentially have access to the full genome sequence of every organism in a breeding population. The non-proprietary code that we have used is made freely available (via Supplementary information.

  4. Exploiting genomic knowledge in optimising molecular breeding programmes: algorithms from evolutionary computing.

    Science.gov (United States)

    O'Hagan, Steve; Knowles, Joshua; Kell, Douglas B

    2012-01-01

    Comparatively few studies have addressed directly the question of quantifying the benefits to be had from using molecular genetic markers in experimental breeding programmes (e.g. for improved crops and livestock), nor the question of which organisms should be mated with each other to best effect. We argue that this requires in silico modelling, an approach for which there is a large literature in the field of evolutionary computation (EC), but which has not really been applied in this way to experimental breeding programmes. EC seeks to optimise measurable outcomes (phenotypic fitnesses) by optimising in silico the mutation, recombination and selection regimes that are used. We review some of the approaches from EC, and compare experimentally, using a biologically relevant in silico landscape, some algorithms that have knowledge of where they are in the (genotypic) search space (G-algorithms) with some (albeit well-tuned ones) that do not (F-algorithms). For the present kinds of landscapes, F- and G-algorithms were broadly comparable in quality and effectiveness, although we recognise that the G-algorithms were not equipped with any 'prior knowledge' of epistatic pathway interactions. This use of algorithms based on machine learning has important implications for the optimisation of experimental breeding programmes in the post-genomic era when we shall potentially have access to the full genome sequence of every organism in a breeding population. The non-proprietary code that we have used is made freely available (via Supplementary information).

  5. Tuning of MEMS Gyroscope using Evolutionary Algorithm and "Switched Drive-Angle" Method

    Science.gov (United States)

    Keymeulen, Didier; Ferguson, Michael I.; Breuer, Luke; Peay, Chris; Oks, Boris; Cheng, Yen; Kim, Dennis; MacDonald, Eric; Foor, David; Terrile, Rich; Yee, Karl

    2006-01-01

    We propose a tuning method for Micro-Electro-Mechanical Systems (MEMS) gyroscopes based on evolutionary computation that has the capacity to efficiently increase the sensitivity of MEMS gyroscopes through tuning and, furthermore, to find the optimally tuned configuration for this state of increased sensitivity. We present the results of an experiment to determine the speed and efficiency of an evolutionary algorithm applied to electrostatic tuning of MEMS micro gyros. The MEMS gyro used in this experiment is a pyrex post resonator gyro (PRG) in a closed-loop control system. A measure of the quality of tuning is given by the difference in resonant frequencies, or frequency split, for the two orthogonal rocking axes. The current implementation of the closed-loop platform is able to measure and attain a relative stability in the sub-millihertz range, leading to a reduction of the frequency split to less than 100 mHz.

  6. Chaotic Multiobjective Evolutionary Algorithm Based on Decomposition for Test Task Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Hui Lu

    2014-01-01

    Full Text Available Test task scheduling problem (TTSP is a complex optimization problem and has many local optima. In this paper, a hybrid chaotic multiobjective evolutionary algorithm based on decomposition (CMOEA/D is presented to avoid becoming trapped in local optima and to obtain high quality solutions. First, we propose an improving integrated encoding scheme (IES to increase the efficiency. Then ten chaotic maps are applied into the multiobjective evolutionary algorithm based on decomposition (MOEA/D in three phases, that is, initial population and crossover and mutation operators. To identify a good approach for hybrid MOEA/D and chaos and indicate the effectiveness of the improving IES several experiments are performed. The Pareto front and the statistical results demonstrate that different chaotic maps in different phases have different effects for solving the TTSP especially the circle map and ICMIC map. The similarity degree of distribution between chaotic maps and the problem is a very essential factor for the application of chaotic maps. In addition, the experiments of comparisons of CMOEA/D and variable neighborhood MOEA/D (VNM indicate that our algorithm has the best performance in solving the TTSP.

  7. Optimization of Feedback Controller in Restructured Power System Using Evolutionary Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    S.Farook,

    2011-05-01

    Full Text Available In this paper an attempt is made to optimize the feedback controller to improve the dynamics of a restructured multiarea power system using Evolutionary Real coded Genetic Algorithm (RCGA.Optimization using state variables is a difficult task as the access to all variables is limited and also measuring all of them is impossible. To solve the problem Evolutionary Genetic algorithms wereproposed to optimize the feedback gains of the controller, having access to few of the AGC variables. The feasibility and robustness of the algorithm is investigated on a two area interconnected power system consisting of two identical thermal plants in each areas in restructured environment. The dynamics of frequency deviations and tie-line power deviations were investigated by considering a demand of 0.1pu MW contracted by GENCOs in each area of the restructured power system. The results obtained by the proposed method are found to be quite encouraging when compared with those achieved using optimal controllers derived using Linear Quadratic Regulator (LQR theory.

  8. A multi-objective evolutionary algorithm for protein structure prediction with immune operators.

    Science.gov (United States)

    Judy, M V; Ravichandran, K S; Murugesan, K

    2009-08-01

    Genetic algorithms (GA) are often well suited for optimisation problems involving several conflicting objectives. It is more suitable to model the protein structure prediction problem as a multi-objective optimisation problem since the potential energy functions used in the literature to evaluate the conformation of a protein are based on the calculations of two different interaction energies: local (bond atoms) and non-local (non-bond atoms) and experiments have shown that those types of interactions are in conflict, by using the potential energy function, Chemistry at Harvard Macromolecular Mechanics. In this paper, we have modified the immune inspired Pareto archived evolutionary strategy (I-PAES) algorithm and denoted it as MI-PAES. It can effectively exploit some prior knowledge about the hydrophobic interactions, which is one of the most important driving forces in protein folding to make vaccines. The proposed MI-PAES is comparable with other evolutionary algorithms proposed in literature, both in terms of best solution found and the computational time and often results in much better search ability than that of the canonical GA.

  9. [In Silico Drug Design Using an Evolutionary Algorithm and Compound Database].

    Science.gov (United States)

    Kawai, Kentaro; Takahashi, Yoshimasa

    2016-01-01

      Computational drug design plays an important role in the discovery of new drugs. Recently, we proposed an algorithm for designing new drug-like molecules utilizing the structure of a known active molecule. To design molecules, three types of fragments (ring, linker, and side-chain fragments) were defined as building blocks, and a fragment library was prepared from molecules listed in G protein-coupled receptor (GPCR)-SARfari database. An evolutionary algorithm which executes evolutionary operations, such as crossover, mutation, and selection, was implemented to evolve the molecules. As a case study, some GPCRs were selected for computational experiments in which we tried to design ligands from simple seed fragments using the Tanimoto coefficient as a fitness function. The results showed that the algorithm could be used successfully to design new molecules with structural similarity, scaffold variety, and chemical validity. In addition, a docking study revealed that these designed molecules also exhibited shape complementarity with the binding site of the target protein. Therefore, this is expected to become a powerful tool for designing new drug-like molecules in drug discovery projects.

  10. Optimising operational amplifiers by evolutionary algorithms and gm/Id method

    Science.gov (United States)

    Tlelo-Cuautle, E.; Sanabria-Borbon, A. C.

    2016-10-01

    The evolutionary algorithm called non-dominated sorting genetic algorithm (NSGA-II) is applied herein in the optimisation of operational transconductance amplifiers. NSGA-II is accelerated by applying the gm/Id method to estimate reduced search spaces associated to widths (W) and lengths (L) of the metal-oxide-semiconductor field-effect-transistor (MOSFETs), and to guarantee their appropriate bias levels conditions. In addition, we introduce an integer encoding for the W/L sizes of the MOSFETs to avoid a post-processing step for rounding-off their values to be multiples of the integrated circuit fabrication technology. Finally, from the feasible solutions generated by NSGA-II, we introduce a second optimisation stage to guarantee that the final feasible W/L sizes solutions support process, voltage and temperature (PVT) variations. The optimisation results lead us to conclude that the gm/Id method and integer encoding are quite useful to accelerate the convergence of the evolutionary algorithm NSGA-II, while the second optimisation stage guarantees robustness of the feasible solutions to PVT variations.

  11. Minimizing the symbol-error-rate for amplify-and-forward relaying systems using evolutionary algorithms

    KAUST Repository

    Ahmed, Qasim Zeeshan

    2015-02-01

    In this paper, a new detector is proposed for an amplify-and-forward (AF) relaying system. The detector is designed to minimize the symbol-error-rate (SER) of the system. The SER surface is non-linear and may have multiple minimas, therefore, designing an SER detector for cooperative communications becomes an optimization problem. Evolutionary based algorithms have the capability to find the global minima, therefore, evolutionary algorithms such as particle swarm optimization (PSO) and differential evolution (DE) are exploited to solve this optimization problem. The performance of proposed detectors is compared with the conventional detectors such as maximum likelihood (ML) and minimum mean square error (MMSE) detector. In the simulation results, it can be observed that the SER performance of the proposed detectors is less than 2 dB away from the ML detector. Significant improvement in SER performance is also observed when comparing with the MMSE detector. The computational complexity of the proposed detector is much less than the ML and MMSE algorithms. Moreover, in contrast to ML and MMSE detectors, the computational complexity of the proposed detectors increases linearly with respect to the number of relays.

  12. Evaluating and Improving Automatic Sleep Spindle Detection by Using Multi-Objective Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Min-Yin Liu

    2017-05-01

    Full Text Available Sleep spindles are brief bursts of brain activity in the sigma frequency range (11–16 Hz measured by electroencephalography (EEG mostly during non-rapid eye movement (NREM stage 2 sleep. These oscillations are of great biological and clinical interests because they potentially play an important role in identifying and characterizing the processes of various neurological disorders. Conventionally, sleep spindles are identified by expert sleep clinicians via visual inspection of EEG signals. The process is laborious and the results are inconsistent among different experts. To resolve the problem, numerous computerized methods have been developed to automate the process of sleep spindle identification. Still, the performance of these automated sleep spindle detection methods varies inconsistently from study to study. There are two reasons: (1 the lack of common benchmark databases, and (2 the lack of commonly accepted evaluation metrics. In this study, we focus on tackling the second problem by proposing to evaluate the performance of a spindle detector in a multi-objective optimization context and hypothesize that using the resultant Pareto fronts for deriving evaluation metrics will improve automatic sleep spindle detection. We use a popular multi-objective evolutionary algorithm (MOEA, the Strength Pareto Evolutionary Algorithm (SPEA2, to optimize six existing frequency-based sleep spindle detection algorithms. They include three Fourier, one continuous wavelet transform (CWT, and two Hilbert-Huang transform (HHT based algorithms. We also explore three hybrid approaches. Trained and tested on open-access DREAMS and MASS databases, two new hybrid methods of combining Fourier with HHT algorithms show significant performance improvement with F1-scores of 0.726–0.737.

  13. A multiobjective evolutionary algorithm based on similarity for community detection from signed social networks.

    Science.gov (United States)

    Liu, Chenlong; Liu, Jing; Jiang, Zhongzhou

    2014-12-01

    Various types of social relationships, such as friends and foes, can be represented as signed social networks (SNs) that contain both positive and negative links. Although many community detection (CD) algorithms have been proposed, most of them were designed primarily for networks containing only positive links. Thus, it is important to design CD algorithms which can handle large-scale SNs. To this purpose, we first extend the original similarity to the signed similarity based on the social balance theory. Then, based on the signed similarity and the natural contradiction between positive and negative links, two objective functions are designed to model the problem of detecting communities in SNs as a multiobjective problem. Afterward, we propose a multiobjective evolutionary algorithm, called MEAs-SN. In MEAs-SN, to overcome the defects of direct and indirect representations for communities, a direct and indirect combined representation is designed. Attributing to this representation, MEAs-SN can switch between different representations during the evolutionary process. As a result, MEAs-SN can benefit from both representations. Moreover, owing to this representation, MEAs-SN can also detect overlapping communities directly. In the experiments, both benchmark problems and large-scale synthetic networks generated by various parameter settings are used to validate the performance of MEAs-SN. The experimental results show the effectiveness and efficacy of MEAs-SN on networks with 1000, 5000, and 10,000 nodes and also in various noisy situations. A thorough comparison is also made between MEAs-SN and three existing algorithms, and the results show that MEAs-SN outperforms other algorithms.

  14. An evolutionary algorithm technique for intelligence, surveillance, and reconnaissance plan optimization

    Science.gov (United States)

    Langton, John T.; Caroli, Joseph A.; Rosenberg, Brad

    2008-04-01

    To support an Effects Based Approach to Operations (EBAO), Intelligence, Surveillance, and Reconnaissance (ISR) planners must optimize collection plans within an evolving battlespace. A need exists for a decision support tool that allows ISR planners to rapidly generate and rehearse high-performing ISR plans that balance multiple objectives and constraints to address dynamic collection requirements for assessment. To meet this need we have designed an evolutionary algorithm (EA)-based "Integrated ISR Plan Analysis and Rehearsal System" (I2PARS) to support Effects-based Assessment (EBA). I2PARS supports ISR mission planning and dynamic replanning to coordinate assets and optimize their routes, allocation and tasking. It uses an evolutionary algorithm to address the large parametric space of route-finding problems which is sometimes discontinuous in the ISR domain because of conflicting objectives such as minimizing asset utilization yet maximizing ISR coverage. EAs are uniquely suited for generating solutions in dynamic environments and also allow user feedback. They are therefore ideal for "streaming optimization" and dynamic replanning of ISR mission plans. I2PARS uses the Non-dominated Sorting Genetic Algorithm (NSGA-II) to automatically generate a diverse set of high performing collection plans given multiple objectives, constraints, and assets. Intended end users of I2PARS include ISR planners in the Combined Air Operations Centers and Joint Intelligence Centers. Here we show the feasibility of applying the NSGA-II algorithm and EAs in general to the ISR planning domain. Unique genetic representations and operators for optimization within the ISR domain are presented along with multi-objective optimization criteria for ISR planning. Promising results of the I2PARS architecture design, early software prototype, and limited domain testing of the new algorithm are discussed. We also present plans for future research and development, as well as technology

  15. An Extensible Component-Based Multi-Objective Evolutionary Algorithm Framework

    DEFF Research Database (Denmark)

    Sørensen, Jan Corfixen; Jørgensen, Bo Nørregaard

    2017-01-01

    The ability to easily modify the problem definition is currently missing in Multi-Objective Evolutionary Algorithms (MOEA). Existing MOEA frameworks do not support dynamic addition and extension of the problem formulation. The existing frameworks require a re-specification of the problem definition...... with different compositions of objectives from the horticulture domain are formulated based on a state of the art micro-climate simulator, electricity prices and weather forecasts. The experimental results demonstrate that the Controleum framework support dynamic reconfiguration of the problem formulation...

  16. NodIO, a JavaScript framework for volunteer-based evolutionary algorithms : first results

    OpenAIRE

    Merelo, Juan-J.; García-Valdez, Mario; Castillo, Pedro A.; García-Sánchez, Pablo; Cuevas, P. de las; Rico, Nuria

    2016-01-01

    JavaScript is an interpreted language mainly known for its inclusion in web browsers, making them a container for rich Internet based applications. This has inspired its use, for a long time, as a tool for evolutionary algorithms, mainly so in browser-based volunteer computing environments. Several libraries have also been published so far and are in use. However, the last years have seen a resurgence of interest in the language, becoming one of the most popular and thus spawning the improvem...

  17. A Parallel Global-Local Mixed Evolutionary Algorithm for Multimodal Function Optimization Based on Domain Decomposition

    Institute of Scientific and Technical Information of China (English)

    Wu Zhi-jian; Tang Zhi-long; Kang Li-shan

    2003-01-01

    This paper presents a parallel two level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions.By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optirma and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.

  18. HYEI: A New Hybrid Evolutionary Imperialist Competitive Algorithm for Fuzzy Knowledge Discovery

    Directory of Open Access Journals (Sweden)

    D. Jalal Nouri

    2014-01-01

    Full Text Available In recent years, imperialist competitive algorithm (ICA, genetic algorithm (GA, and hybrid fuzzy classification systems have been successfully and effectively employed for classification tasks of data mining. Due to overcoming the gaps related to ineffectiveness of current algorithms for analysing high-dimension independent datasets, a new hybrid approach, named HYEI, is presented to discover generic rule-based systems in this paper. This proposed approach consists of three stages and combines an evolutionary-based fuzzy system with two ICA procedures to generate high-quality fuzzy-classification rules. Initially, the best feature subset is selected by using the embedded ICA feature selection, and then these features are used to generate basic fuzzy-classification rules. Finally, all rules are optimized by using an ICA algorithm to reduce their length or to eliminate some of them. The performance of HYEI has been evaluated by using several benchmark datasets from the UCI machine learning repository. The classification accuracy attained by the proposed algorithm has the highest classification accuracy in 6 out of the 7 dataset problems and is comparative to the classification accuracy of the 5 other test problems, as compared to the best results previously published.

  19. A Problem-Reduction Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Wanfeng Liu

    2015-01-01

    Full Text Available Assessment of the components of a solution helps provide useful information for an optimization problem. This paper presents a new population-based problem-reduction evolutionary algorithm (PREA based on the solution components assessment. An individual solution is regarded as being constructed by basic elements, and the concept of acceptability is introduced to evaluate them. The PREA consists of a searching phase and an evaluation phase. The acceptability of basic elements is calculated in the evaluation phase and passed to the searching phase. In the searching phase, for each individual solution, the original optimization problem is reduced to a new smaller-size problem. With the evolution of the algorithm, the number of common basic elements in the population increases until all individual solutions are exactly the same which is supposed to be the near-optimal solution of the optimization problem. The new algorithm is applied to a large variety of capacitated vehicle routing problems (CVRP with customers up to nearly 500. Experimental results show that the proposed algorithm has the advantages of fast convergence and robustness in solution quality over the comparative algorithms.

  20. An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts.

    Science.gov (United States)

    Jiang, Shouyong; Yang, Shengxiang

    2016-02-01

    The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has been shown to be very efficient in solving multiobjective optimization problems (MOPs). In practice, the Pareto-optimal front (POF) of many MOPs has complex characteristics. For example, the POF may have a long tail and sharp peak and disconnected regions, which significantly degrades the performance of MOEA/D. This paper proposes an improved MOEA/D for handling such kind of complex problems. In the proposed algorithm, a two-phase strategy (TP) is employed to divide the whole optimization procedure into two phases. Based on the crowdedness of solutions found in the first phase, the algorithm decides whether or not to delicate computational resources to handle unsolved subproblems in the second phase. Besides, a new niche scheme is introduced into the improved MOEA/D to guide the selection of mating parents to avoid producing duplicate solutions, which is very helpful for maintaining the population diversity when the POF of the MOP being optimized is discontinuous. The performance of the proposed algorithm is investigated on some existing benchmark and newly designed MOPs with complex POF shapes in comparison with several MOEA/D variants and other approaches. The experimental results show that the proposed algorithm produces promising performance on these complex problems.

  1. Decomposition-Based Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Social Networks

    Directory of Open Access Journals (Sweden)

    Jingjing Ma

    2014-01-01

    Full Text Available Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms.

  2. Decomposition-based multiobjective evolutionary algorithm for community detection in dynamic social networks.

    Science.gov (United States)

    Ma, Jingjing; Liu, Jie; Ma, Wenping; Gong, Maoguo; Jiao, Licheng

    2014-01-01

    Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms.

  3. Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming

    Institute of Scientific and Technical Information of China (English)

    Xiong LUO; Xiaoping FAN; Heng ZHANG; Tefang CHEN

    2004-01-01

    Optimal trajectory planning for robot manipulators plays an important role in implementing the high productivity for robots.The performance indexes used in optimal trajectory planning are classified into two main categories:optimum traveling time and optimum mechanical energy of the actuators.The current trajectory planning algorithms are designed based on one of the above two performance indexes.So far,there have been few planning algorithms designed to satisfy two performance indexes simultaneously.On the other hand,some deficiencies arise in the existing integrated optimization algorithms of trajectory planning.In order to overcome those deficiencies,the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators.In the algorithm,two object functions are designed based on the specific weight coefficient method and "ideal point" strategy.Moreover,based on the features of optimization problem,the intensified evolutionary programming is proposed to solve the corresponding optimization model.Especially,for the Stanford Robot,the high-quality solutions are found at a lower cost.

  4. Comparative Study of Evolutionary Multi-objective Optimization Algorithms for a Non-linear Greenhouse Climate Control Problem

    DEFF Research Database (Denmark)

    Ghoreishi, Newsha; Sørensen, Jan Corfixen; Jørgensen, Bo Nørregaard

    2015-01-01

    compare the performance of state-of-the-art multi-objective evolutionary algorithms to solve a non-linear multi-objective multi-issue optimisation problem found in Greenhouse climate control. The chosen algorithms in the study includes NSGAII, eNSGAII, eMOEA, PAES, PESAII and SPEAII. The performance...

  5. Parallel and Distributed Genetic Algorithm with Multiple-Objectives to Improve and Develop of Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Khalil Ibrahim Mohammad Abuzanouneh

    2016-05-01

    Full Text Available In this paper, we argue that the timetabling problem reflects the problem of scheduling university courses, So you must specify the range of time periods and a group of instructors for a range of lectures to check a set of constraints and reduce the cost of other constraints ,this is the problem called NP-hard, it is a class of problems that are informally, it’s mean that necessary operations to solve the problem will increases exponentially and directly proportional to the size of the problem, The construction of timetable is most complicated problem that was facing many universities, and increased by size of the university data and overlapping disciplines between colleges, and when a traditional algorithm (EA is unable to provide satisfactory results, a distributed EA (dEA, which deploys the population on distributed systems ,it also offers an opportunity to solve extremely high dimensional problems through distributed coevolution using a divide-and-conquer mechanism, Further, the distributed environment allows a dEA to maintain population diversity, thereby avoiding local optima and also facilitating multi-objective search, by employing different distributed models to parallelize the processing of EAs, we designed a genetic algorithm suitable for Universities environment and the constraints facing it when building timetable for lectures.

  6. Comparison of Multiobjective Evolutionary Algorithms for Operations Scheduling under Machine Availability Constraints

    Directory of Open Access Journals (Sweden)

    M. Frutos

    2013-01-01

    Full Text Available Many of the problems that arise in production systems can be handled with multiobjective techniques. One of those problems is that of scheduling operations subject to constraints on the availability of machines and buffer capacity. In this paper we analyze different Evolutionary multiobjective Algorithms (MOEAs for this kind of problems. We consider an experimental framework in which we schedule production operations for four real world Job-Shop contexts using three algorithms, NSGAII, SPEA2, and IBEA. Using two performance indexes, Hypervolume and R2, we found that SPEA2 and IBEA are the most efficient for the tasks at hand. On the other hand IBEA seems to be a better choice of tool since it yields more solutions in the approximate Pareto frontier.

  7. On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms

    CERN Document Server

    Lehre, Per Kristian

    2010-01-01

    The interplay between mutation and selection plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is still not completely understood. This paper presents a rigorous runtime analysis of a non-elitist population-based EA that uses the linear ranking selection mechanism. The analysis focuses on how the balance between parameter $\\eta$, controlling the selection pressure in linear ranking, and parameter $\\chi$ controlling the bit-wise mutation rate, impacts the runtime of the algorithm. The results point out situations where a correct balance between selection pressure and mutation rate is essential for finding the optimal solution in polynomial time. In particular, it is shown that there exist fitness functions which can only be solved in polynomial time if the ratio between parameters $\\eta$ and $\\chi$ is within a narrow critical interval, and where a small change in this ratio can increase the runtime exponentially. Furthermore, it is shown quantitatively how the ...

  8. Synthesis of Steered Flat-top Beam Pattern Using Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    D. Mandal

    2016-12-01

    Full Text Available In this paper a pattern synthesis method based on Evolutionary Algorithm is presented. A Flat-top beam pattern has been generated from a concentric ring array of isotropic elements by finding out the optimum set of elements amplitudes and phases using Differential Evolution algorithm. The said pattern is generated in three predefined azimuth planes instate of a single phi plane and also verified for a range of azimuth plane for the same optimum excitations. The main beam is steered to an elevation angle of 30 degree with lower peak SLL and ripple. Dynamic range ratio (DRR is also being improved by eliminating the weakly excited array elements, which simplify the design complexity of feed networks.

  9. A novel evolutionary algorithm applied to algebraic modifications of the RANS stress-strain relationship

    Science.gov (United States)

    Weatheritt, Jack; Sandberg, Richard

    2016-11-01

    This paper presents a novel and promising approach to turbulence model formulation, rather than putting forward a particular new model. Evolutionary computation has brought symbolic regression of scalar fields into the domain of algorithms and this paper describes a novel expansion of Gene Expression Programming for the purpose of tensor modeling. By utilizing high-fidelity data and uncertainty measures, mathematical models for tensors are created. The philosophy behind the framework is to give freedom to the algorithm to produce a constraint-free model; its own functional form that was not previously imposed. Turbulence modeling is the target application, specifically the improvement of separated flow prediction. Models are created by considering the anisotropy of the turbulent stress tensor and formulating non-linear constitutive stress-strain relationships. A previously unseen flow field is computed and compared to the baseline linear model and an established non-linear model of comparable complexity. The results are highly encouraging.

  10. An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

    Directory of Open Access Journals (Sweden)

    Ji Ung Sun

    2015-01-01

    Full Text Available We consider a capacitated hub location-routing problem (HLRP which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitated p-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.

  11. Multi-objective flexible job shop scheduling problem using variable neighborhood evolutionary algorithm

    Science.gov (United States)

    Wang, Chun; Ji, Zhicheng; Wang, Yan

    2017-07-01

    In this paper, multi-objective flexible job shop scheduling problem (MOFJSP) was studied with the objects to minimize makespan, total workload and critical workload. A variable neighborhood evolutionary algorithm (VNEA) was proposed to obtain a set of Pareto optimal solutions. First, two novel crowded operators in terms of the decision space and object space were proposed, and they were respectively used in mating selection and environmental selection. Then, two well-designed neighborhood structures were used in local search, which consider the problem characteristics and can hold fast convergence. Finally, extensive comparison was carried out with the state-of-the-art methods specially presented for solving MOFJSP on well-known benchmark instances. The results show that the proposed VNEA is more effective than other algorithms in solving MOFJSP.

  12. A New Evolutionary Algorithm Based on Bacterial Evolution and Its Application for Scheduling A Flexible Manufacturing System

    Directory of Open Access Journals (Sweden)

    Chandramouli Anandaraman

    2012-01-01

    Full Text Available A new evolutionary computation algorithm, Superbug algorithm, which simulates evolution of bacteria in a culture, is proposed. The algorithm is developed for solving large scale optimization problems such as scheduling, transportation and assignment problems. In this work, the algorithm optimizes machine schedules in a Flexible Manufacturing System (FMS by minimizing makespan. The FMS comprises of four machines and two identical Automated Guided Vehicles (AGVs. AGVs are used for carrying jobs between the Load/Unload (L/U station and the machines. Experimental results indicate the efficiency of the proposed algorithm in its optimization performance in scheduling is noticeably superior to other evolutionary algorithms when compared to the best results reported in the literature for FMS Scheduling.

  13. Monkey-King immune evolutionary algorithm%猴王免疫进化算法

    Institute of Scientific and Technical Information of China (English)

    邹艳玲; 吴启满; 李育强; 王兵

    2011-01-01

    猴王遗传算法具有原理简单、易于计算的优点,但存在猴王点(最优个体)附近空间局部寻优能力弱,进而影响全局搜索能力的局限.通过引入免疫进化算法,对猴王点进行免疫进化迭代优化,使得既加大对最优个体附近解空间搜索的同时,也兼顾了对最优个体附近解空间以外区域的搜索,避免了不成熟收敛;且随着迭代的进行,局部搜索能力不断得到加强,算法以更高的精度逼近全局最优解.对多个典型测试函数的计算,并与猴王遗传算法、改进后的猴王遗传算法和普通爬山算子遗传算法的优化计算结果进行了比较.结果表明猴王免疫进化算法具有更佳的寻优能力和更好的稳定性.%Monkey-King genetic algorithm has the shortages of the lower searching ability in the local area and further in the whole area at monkey-king point, in spite of the advantages of the simple principle and simplicity in calculation. Monkey-king point was optimized iteratively by using immune evolutionary algorithm. This method overcomes the premature convergence because of the optimal searching in the out as well as in of the areas at the monkey-king point. At the same time, with the process of iteration, the algorithm closes in the whole of optimal solution with the higher precision because of the gradual strengthening of local searching ability. This paper calculates typical test function and compares with several methods, such as monkey-king genetic algorithm, improved monkey-king genetic algorithm and common climbing operator genetic algorithm et al. The results show that the monkey-king immune evolutionary algorithm has the optimal searching ability and the better stability.

  14. A standard deviation selection in evolutionary algorithm for grouper fish feed formulation

    Science.gov (United States)

    Cai-Juan, Soong; Ramli, Razamin; Rahman, Rosshairy Abdul

    2016-10-01

    Malaysia is one of the major producer countries for fishery production due to its location in the equatorial environment. Grouper fish is one of the potential markets in contributing to the income of the country due to its desirable taste, high demand and high price. However, the demand of grouper fish is still insufficient from the wild catch. Therefore, there is a need to farm grouper fish to cater to the market demand. In order to farm grouper fish, there is a need to have prior knowledge of the proper nutrients needed because there is no exact data available. Therefore, in this study, primary data and secondary data are collected even though there is a limitation of related papers and 30 samples are investigated by using standard deviation selection in Evolutionary algorithm. Thus, this study would unlock frontiers for an extensive research in respect of grouper fish feed formulation. Results shown that the fitness of standard deviation selection in evolutionary algorithm is applicable. The feasible and low fitness, quick solution can be obtained. These fitness can be further predicted to minimize cost in farming grouper fish.

  15. AI-BL1.0: a program for automatic on-line beamline optimization using the evolutionary algorithm.

    Science.gov (United States)

    Xi, Shibo; Borgna, Lucas Santiago; Zheng, Lirong; Du, Yonghua; Hu, Tiandou

    2017-01-01

    In this report, AI-BL1.0, an open-source Labview-based program for automatic on-line beamline optimization, is presented. The optimization algorithms used in the program are Genetic Algorithm and Differential Evolution. Efficiency was improved by use of a strategy known as Observer Mode for Evolutionary Algorithm. The program was constructed and validated at the XAFCA beamline of the Singapore Synchrotron Light Source and 1W1B beamline of the Beijing Synchrotron Radiation Facility.

  16. Developing Multiple Diverse Potential Designs for Heat Transfer Utilizing Graph Based Evolutionary Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    David J. Muth Jr.

    2006-09-01

    This paper examines the use of graph based evolutionary algorithms (GBEAs) to find multiple acceptable solutions for heat transfer in engineering systems during the optimization process. GBEAs are a type of evolutionary algorithm (EA) in which a topology, or geography, is imposed on an evolving population of solutions. The rates at which solutions can spread within the population are controlled by the choice of topology. As in nature geography can be used to develop and sustain diversity within the solution population. Altering the choice of graph can create a more or less diverse population of potential solutions. The choice of graph can also affect the convergence rate for the EA and the number of mating events required for convergence. The engineering system examined in this paper is a biomass fueled cookstove used in developing nations for household cooking. In this cookstove wood is combusted in a small combustion chamber and the resulting hot gases are utilized to heat the stove’s cooking surface. The spatial temperature profile of the cooking surface is determined by a series of baffles that direct the flow of hot gases. The optimization goal is to find baffle configurations that provide an even temperature distribution on the cooking surface. Often in engineering, the goal of optimization is not to find the single optimum solution but rather to identify a number of good solutions that can be used as a starting point for detailed engineering design. Because of this a key aspect of evolutionary optimization is the diversity of the solutions found. The key conclusion in this paper is that GBEA’s can be used to create multiple good solutions needed to support engineering design.

  17. Multi-objective Optimisation Design of Water Distribution Systems:Comparison of Two Evolutionary Algorithms

    Institute of Scientific and Technical Information of China (English)

    Haixing Liu,Jing Lu,Ming Zhao∗; Yixing Yuan

    2016-01-01

    In order to compare two advanced multi⁃objective evolutionary algorithms, a multi⁃objective water distribution problem is formulated in this paper. The multi⁃objective optimization has received more attention in the water distribution system design. On the one hand the cost of water distribution system including capital, operational, and maintenance cost is mostly concerned issue by the utilities all the time; on the other hand improving the performance of water distribution systems is of equivalent importance, which is often conflicting with the previous goal. Many performance metrics of water networks are developed in recent years, including total or maximum pressure deficit, resilience, inequity, probabilistic robustness, and risk measure. In this paper, a new resilience metric based on the energy analysis of water distribution systems is proposed. Two optimization objectives are comprised of capital cost and the new resilience index. A heuristic algorithm, speed⁃constrained multi⁃objective particle swarm optimization ( SMPSO) extended on the basis of the multi⁃objective particle swarm algorithm, is introduced to compare with another state⁃of⁃the⁃art heuristic algorithm, NSGA⁃II. The solutions are evaluated by two metrics, namely spread and hypervolume. To illustrate the capability of SMPSO to efficiently identify good designs, two benchmark problems ( two⁃loop network and Hanoi network) are employed. From several aspects the results demonstrate that SMPSO is a competitive and potential tool to tackle with the optimization problem of complex systems.

  18. 一种求解约束优化问题的新算法%A New Evolutionary Algorithm for Constrained Optimization Problem

    Institute of Scientific and Technical Information of China (English)

    曾三友; 康立山; 丁立新

    2001-01-01

    A new evolutionary algorithm for constrained optimization problem is proposed in this study.In the algorithm,search space was gradually constracted to optimal solution while evolutionary algorithm was used repeatedly and incompletely,until the space constracted small enough. Then evolutionary algorithm ran fully. Real coding was used,and only crossover operators were adopted but two kinds of crossover operators were used in the new algorithm. The computation results dimonstrated that the new algorithm is superior to other methods in terms of solution quality, robustness and convergent speed.

  19. Comparison of evolutionary computation algorithms for solving bi-objective task scheduling problem on heterogeneous distributed computing systems

    Indian Academy of Sciences (India)

    P Chitra; P Venkatesh; R Rajaram

    2011-04-01

    The task scheduling problem in heterogeneous distributed computing systems is a multiobjective optimization problem (MOP). In heterogeneous distributed computing systems (HDCS), there is a possibility of processor and network failures and this affects the applications running on the HDCS. To reduce the impact of failures on an application running on HDCS, scheduling algorithms must be devised which minimize not only the schedule length (makespan) but also the failure probability of the application (reliability). These objectives are conflicting and it is not possible to minimize both objectives at the same time. Thus, it is needed to develop scheduling algorithms which account both for schedule length and the failure probability. Multiobjective Evolutionary Computation algorithms (MOEAs) are well-suited for Multiobjective task scheduling on heterogeneous environment. The two Multi-Objective Evolutionary Algorithms such as Multiobjective Genetic Algorithm (MOGA) and Multiobjective Evolutionary Programming (MOEP) with non-dominated sorting are developed and compared for the various random task graphs and also for a real-time numerical application graph. The metrics for evaluating the convergence and diversity of the obtained non-dominated solutions by the two algorithms are reported. The simulation results confirm that the proposed algorithms can be used for solving the task scheduling at reduced computational times compared to the weighted-sum based biobjective algorithm in the literature.

  20. SUPPRESSION OF THE SECONDARY FLOWS IN A BEND PIPE USING NAVIER-STOKES SOLVER AND EVOLUTIONARY ALGORITHMS

    Institute of Scientific and Technical Information of China (English)

    LI Jun; LIU Li-jun; FENG Zhen-ping

    2004-01-01

    Hydrodynamic optimization design of the bend pipe from pump using the Navier-Stokes solver and evolutionary algorithms was conducted. The minimization of the total pressure loss of the bend pipe was chosen as the design object in order to obtain the uniform exit flows through suppressing the secondary flows. The 3-D Navier-Stokes solver was applied to evaluate the hydrodynamic performance of the bend-pipe flows. A 7th-order Bezier curve was used to parameterize the meridional section and elliptic representation was adopted to represent the cross-section profiles of the bend pipe. Evolutionary algorithms were applied in optimization. The obtained results show that the designed bend pipe shape has much more uniform exit flows compared with the initial one and much weaker secondary flows, and that the evolutionary algorithms and CFD technique are the powerful optimization tools for the fluid machinery design.

  1. Optimization of regular offshore wind-power plants using a non-discrete evolutionary algorithm

    Directory of Open Access Journals (Sweden)

    Angel G. Gonzalez-Rodriguez

    2017-02-01

    Full Text Available Offshore wind farms (OWFs often present a regular configuration mainly due to aesthetical considerations. This paper presents a new evolutionary algorithm that optimizes the location, configuration and orientation of a rhomboid-shape OWF. Existing optimization algorithms were based on dividing the available space into a mess of cells and forcing the turbines to be located in the centre of a cell. However, the presented algorithm searches for the optimum within a continuous range of the eight parameters that define the OWF, which allows including a gradient-based local search operator to improve the optimization process. The study starts from a review of the economic data available in the bibliography relative to the most significant issues influencing the profitability of the investment in terms of the Internal Rate of Return (IRR. In order to address the distinctive characteristics of OWFs, specific issues arise which have been solved. The most important ones are: interpretation of nautical charts, utilization of the seabed map with different load-bearing capacities, and location of the shoreline transition.

  2. Geomagnetic Navigation of Autonomous Underwater Vehicle Based on Multi-objective Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Hong Li

    2017-07-01

    Full Text Available This paper presents a multi-objective evolutionary algorithm of bio-inspired geomagnetic navigation for Autonomous Underwater Vehicle (AUV. Inspired by the biological navigation behavior, the solution was proposed without using a priori information, simply by magnetotaxis searching. However, the existence of the geomagnetic anomalies has significant influence on the geomagnetic navigation system, which often disrupts the distribution of the geomagnetic field. An extreme value region may easily appear in abnormal regions, which makes AUV lost in the navigation phase. This paper proposes an improved bio-inspired algorithm with behavior constraints, for sake of making AUV escape from the abnormal region. First, the navigation problem is considered as the optimization problem. Second, the environmental monitoring operator is introduced, to determine whether the algorithm falls into the geomagnetic anomaly region. Then, the behavior constraint operator is employed to get out of the abnormal region. Finally, the termination condition is triggered. Compared to the state-of- the-art, the proposed approach effectively overcomes the disturbance of the geomagnetic abnormal. The simulation result demonstrates the reliability and feasibility of the proposed approach in complex environments.

  3. Non-Parametric Evolutionary Algorithm for Estimating Root Zone Soil Moisture

    Science.gov (United States)

    Mohanty, B.; Shin, Y.; Ines, A. M.

    2013-12-01

    Prediction of root zone soil moisture is critical for water resources management. In this study, we explored a non-parametric evolutionary algorithm for estimating root zone soil moisture from a time series of spatially-distributed rainfall across multiple weather locations under two different hydro-climatic regions. A new genetic algorithm-based hidden Markov model (HMMGA) was developed to estimate long-term root zone soil moisture dynamics at different soil depths. Also, we analyzed rainfall occurrence probabilities and dry/wet spell lengths reproduced by this approach. The HMMGA was used to estimate the optimal state sequences (weather states) based on the precipitation history. Historical root zone soil moisture statistics were then determined based on the weather state conditions. To test the new approach, we selected two different soil moisture fields, Oklahoma (130 km x 130 km) and Illinois (300 km x 500 km), during 1995 to 2009 and 1994 to 2010, respectively. We found that the newly developed framework performed well in predicting root zone soil moisture dynamics at both the spatial scales. Also, the reproduced rainfall occurrence probabilities and dry/wet spell lengths matched well with the observations at the spatio-temporal scales. Since the proposed algorithm requires only precipitation and historical soil moisture data from existing, established weather stations, it can serve an attractive alternative for predicting root zone soil moisture in the future using climate change scenarios and root zone soil moisture history.

  4. Human creativity, evolutionary algorithms, and predictive representations: The mechanics of thought trials.

    Science.gov (United States)

    Dietrich, Arne; Haider, Hilde

    2015-08-01

    Creative thinking is arguably the pinnacle of cerebral functionality. Like no other mental faculty, it has been omnipotent in transforming human civilizations. Probing the neural basis of this most extraordinary capacity, however, has been doggedly frustrated. Despite a flurry of activity in cognitive neuroscience, recent reviews have shown that there is no coherent picture emerging from the neuroimaging work. Based on this, we take a different route and apply two well established paradigms to the problem. First is the evolutionary framework that, despite being part and parcel of creativity research, has no informed experimental work in cognitive neuroscience. Second is the emerging prediction framework that recognizes predictive representations as an integrating principle of all cognition. We show here how the prediction imperative revealingly synthesizes a host of new insights into the way brains process variation-selection thought trials and present a new neural mechanism for the partial sightedness in human creativity. Our ability to run offline simulations of expected future environments and action outcomes can account for some of the characteristic properties of cultural evolutionary algorithms running in brains, such as degrees of sightedness, the formation of scaffolds to jump over unviable intermediate forms, or how fitness criteria are set for a selection process that is necessarily hypothetical. Prospective processing in the brain also sheds light on how human creating and designing - as opposed to biological creativity - can be accompanied by intentions and foresight. This paper raises questions about the nature of creative thought that, as far as we know, have never been asked before.

  5. A hybrid artificial bee colony optimization and quantum evolutionary algorithm for continuous optimization problems.

    Science.gov (United States)

    Duan, Hai-Bin; Xu, Chun-Fang; Xing, Zhi-Hui

    2010-02-01

    In this paper, a novel hybrid Artificial Bee Colony (ABC) and Quantum Evolutionary Algorithm (QEA) is proposed for solving continuous optimization problems. ABC is adopted to increase the local search capacity as well as the randomness of the populations. In this way, the improved QEA can jump out of the premature convergence and find the optimal value. To show the performance of our proposed hybrid QEA with ABC, a number of experiments are carried out on a set of well-known Benchmark continuous optimization problems and the related results are compared with two other QEAs: the QEA with classical crossover operation, and the QEA with 2-crossover strategy. The experimental comparison results demonstrate that the proposed hybrid ABC and QEA approach is feasible and effective in solving complex continuous optimization problems.

  6. Multiobjective optimization and multivariable control of the beer fermentation process with the use of evolutionary algorithms

    Institute of Scientific and Technical Information of China (English)

    ANDRES-TOROB.; GIRON-SIERRAJ.M.; FERNANDEZ-BLANCOP.; LOPEZ-OROZCOJ.A.; BESADA-PORTASE.

    2004-01-01

    This paper describes empirical research on the model, optimization and supervisory control of beer fermentation.Conditions in the laboratory were made as similar as possible to brewery industry conditions. Since mathematical models that consider realistic industrial conditions were not available, a new mathematical model design involving industrial conditions was first developed. Batch fermentations are multiobjective dynamic processes that must be guided along optimal paths to obtain good results.The paper describes a direct way to apply a Pareto set approach with multiobjective evolutionary algorithms (MOEAs).Successful finding of optimal ways to drive these processes were reported.Once obtained, the mathematical fermentation model was used to optimize the fermentation process by using an intelligent control based on certain rules.

  7. Solving the Bilevel Facility Location Problem under Preferences by a Stackelberg-Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    José-Fernando Camacho-Vallejo

    2014-01-01

    Full Text Available This research highlights the use of game theory to solve the classical problem of the uncapacitated facility location optimization model with customer order preferences through a bilevel approach. The bilevel model provided herein consists of the classical facility location problem and an optimization of the customer preferences, which are the upper and lower level problems, respectively. Also, two reformulations of the bilevel model are presented, reducing it into a mixed-integer single-level problem. An evolutionary algorithm based on the equilibrium in a Stackelberg’s game is proposed to solve the bilevel model. Numerical experimentation is performed in this study and the results are compared to benchmarks from the existing literature on the subject in order to emphasize the benefits of the proposed approach in terms of solution quality and estimation time.

  8. Identifying irregularly shaped crime hot-spots using a multiobjective evolutionary algorithm

    Science.gov (United States)

    Wu, Xiaolan; Grubesic, Tony H.

    2010-12-01

    Spatial cluster detection techniques are widely used in criminology, geography, epidemiology, and other fields. In particular, spatial scan statistics are popular and efficient techniques for detecting areas of elevated crime or disease events. The majority of spatial scan approaches attempt to delineate geographic zones by evaluating the significance of clusters using likelihood ratio statistics tested with the Poisson distribution. While this can be effective, many scan statistics give preference to circular clusters, diminishing their ability to identify elongated and/or irregular shaped clusters. Although adjusting the shape of the scan window can mitigate some of these problems, both the significance of irregular clusters and their spatial structure must be accounted for in a meaningful way. This paper utilizes a multiobjective evolutionary algorithm to find clusters with maximum significance while quantitatively tracking their geographic structure. Crime data for the city of Cincinnati are utilized to demonstrate the advantages of the new approach and highlight its benefits versus more traditional scan statistics.

  9. An Evolutionary Algorithm Approach to Link Prediction in Dynamic Social Networks

    CERN Document Server

    Bliss, Catherine A; Danforth, Christopher M; Dodds, Peter Sheridan

    2013-01-01

    Many real world, complex phenomena have underlying structures of evolving networks where nodes and links are added and removed over time. A central scientific challenge is the description and explanation of network dynamics, with a key test being the prediction of short and long term changes. For the problem of short-term link prediction, existing methods attempt to determine neighborhood metrics that correlate with the appearance of a link in the next observation period. Recent work has suggested that the incorporation of user-specific metadata and usage patterns can improve link prediction, however methodologies for doing so in a systematic way are largely unexplored in the literature. Here, we provide an approach to predicting future links by applying an evolutionary algorithm to weights which are used in a linear combination of sixteen neighborhood and node similarity indices. We examine Twitter reciprocal reply networks constructed at the time scale of weeks, both as a test of our general method and as a...

  10. New phases of osmium carbide from evolutionary algorithm and ab initio computations

    Science.gov (United States)

    Fadda, Alessandro; Fadda, Giuseppe

    2017-09-01

    New crystal phases of osmium carbide are presented in this work. These results were found with the CA code, an evolutionary algorithm (EA) presented in a previous paper which takes full advantage of crystal symmetry by using an ad hoc search space and genetic operators. The new OsC2 and Os2C structures have a lower enthalpy than any known so far. Moreover, the layered pattern of OsC2 serves as a blueprint for building new crystals by adding or removing layers of carbon and/or osmium and generating many other Os  +  C structures like Os2C, OsC, OsC2 and OsC4. These again have a lower enthalpy than all the investigated structures, including those of the present work. The mechanical, vibrational and electronic properties are discussed as well.

  11. Evolutionary algorithm for analyzing higher degree research student recruitment and completion

    Directory of Open Access Journals (Sweden)

    Ruhul Sarker

    2015-12-01

    Full Text Available In this paper, we consider a decision problem arising from higher degree research student recruitment process in a university environment. The problem is to recruit a number of research students by maximizing the sum of a performance index satisfying a number of constraints, such as supervision capacity and resource limitation. The problem is dynamic in nature as the number of eligible applicants, the supervision capacity, completion time, funding for scholarships, and other resources vary from period to period and they are difficult to predict in advance. In this research, we have developed a mathematical model to represent this dynamic decision problem and adopted an evolutionary algorithm-based approach to solve the problem. We have demonstrated how the recruitment decision can be made with a defined objective and how the model can be used for long-run planning for improvement of higher degree research program.

  12. Multiobjective optimization and multivariable control of the beer fermentation process with the use of evolutionary algorithms

    Institute of Scientific and Technical Information of China (English)

    ANDR(E)S-TORO B.; GIR(O)N-SIERRA J.M.; FERN(A)NDEZ-BLANCO P.; L(O)PEZ-OROZCO J.A.; BESADA-PORTAS E.

    2004-01-01

    This paper describes empirical research on the model, optimization and supervisory control of beer fermentation. Conditions in the laboratory were made as similar as possible to brewery industry conditions. Since mathematical models that consider realistic industrial conditions were not available, a new mathematical model design involving industrial conditions was first developed. Batch fermentations are multiobjective dynamic processes that must be guided along optimal paths to obtain good results. The paper describes a direct way to apply a Pareto set approach with multiobjective evolutionary algorithms (MOEAs). Successful finding of optimal ways to drive these processes were reported. Once obtained, the mathematical fermentation model was used to optimize the fermentation process by using an intelligent control based on certain rules.

  13. Optimization of constrained multiple-objective reliability problems using evolutionary algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Salazar, Daniel [Instituto de Sistemas Inteligentes y Aplicaciones Numericas en Ingenieria (IUSIANI), Division de Computacion Evolutiva y Aplicaciones (CEANI), Universidad de Las Palmas de Gran Canaria, Islas Canarias (Spain) and Facultad de Ingenieria, Universidad Central Venezuela, Caracas (Venezuela)]. E-mail: danielsalazaraponte@gmail.com; Rocco, Claudio M. [Facultad de Ingenieria, Universidad Central Venezuela, Caracas (Venezuela)]. E-mail: crocco@reacciun.ve; Galvan, Blas J. [Instituto de Sistemas Inteligentes y Aplicaciones Numericas en Ingenieria (IUSIANI), Division de Computacion Evolutiva y Aplicaciones (CEANI), Universidad de Las Palmas de Gran Canaria, Islas Canarias (Spain)]. E-mail: bgalvan@step.es

    2006-09-15

    This paper illustrates the use of multi-objective optimization to solve three types of reliability optimization problems: to find the optimal number of redundant components, find the reliability of components, and determine both their redundancy and reliability. In general, these problems have been formulated as single objective mixed-integer non-linear programming problems with one or several constraints and solved by using mathematical programming techniques or special heuristics. In this work, these problems are reformulated as multiple-objective problems (MOP) and then solved by using a second-generation Multiple-Objective Evolutionary Algorithm (MOEA) that allows handling constraints. The MOEA used in this paper (NSGA-II) demonstrates the ability to identify a set of optimal solutions (Pareto front), which provides the Decision Maker with a complete picture of the optimal solution space. Finally, the advantages of both MOP and MOEA approaches are illustrated by solving four redundancy problems taken from the literature.

  14. Cell Evolutionary Algorithm: a New Optimization Method on Ground-State Energy of the Atomic

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    The purpose of this paper is to present a new general approach to solve ground-state energies of the double-electron systems in a uniform magnetic field, in which the basic element of evolution is the set in the solution space, rather than the point. The paper defines the Cell Evolutionary Algorithm, which imple-ments such a view of the evolution mechanism. First, the optimal set in which the optimal solution may be ob-tained. Then this approach applies the embedded search method to get the optimal solution. We tested this approach on the atomic structure, and the results show that it can improve not only the efficiency but also the accuracy of the calculations as it relates to this specific problem.

  15. Transmission Expansion Planning – A Multiyear Dynamic Approach Using a Discrete Evolutionary Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Saraiva J. T.

    2012-10-01

    Full Text Available The basic objective of Transmission Expansion Planning (TEP is to schedule a number of transmission projects along an extended planning horizon minimizing the network construction and operational costs while satisfying the requirement of delivering power safely and reliably to load centres along the horizon. This principle is quite simple, but the complexity of the problem and the impact on society transforms TEP on a challenging issue. This paper describes a new approach to solve the dynamic TEP problem, based on an improved discrete integer version of the Evolutionary Particle Swarm Optimization (EPSO meta-heuristic algorithm. The paper includes sections describing in detail the EPSO enhanced approach, the mathematical formulation of the TEP problem, including the objective function and the constraints, and a section devoted to the application of the developed approach to this problem. Finally, the use of the developed approach is illustrated using a case study based on the IEEE 24 bus 38 branch test system.

  16. Robust motion control design for dual-axis motion platform using evolutionary algorithm

    Indian Academy of Sciences (India)

    Horn-Yong Jan; Chun-Liang Lin; Ching-Huei Huang; Thong-Shing Hwang

    2008-12-01

    This paper presents a new approach to deal with the dual-axis control design problem for a mechatronic platform. The cross-coupling effect leading to contour errors is effectively resolved by incorporating a neural net-based decoupling compensator. Conditions for robust stability are derived to ensure the closedloop system stability with the decoupling compensator. An evolutionary algorithm possessing the universal solution seeking capability is proposed for finding the optimal connecting weights of the neural compensator and PID control gains for the and axis control loops. Numerical studies and a real-world experiment for a watch cambered surface polishing platform have verified performance and applicability of our proposed design.

  17. A Grid Based Cooperative Co-evolutionary Multi-Objective Algorithm

    Science.gov (United States)

    Fard, Sepehr Meshkinfam; Hamzeh, Ali; Ziarati, Koorush

    In this paper, a well performing approach in the context of Multi-Objective Evolutionary Algorithm (MOEA) is investigated due to its complexity. This approach called NSCCGA is based on previously introduced approach called NSGA-II. NSCCGA performs better than NSGA-II but with a heavy load of computational complexity. Here, a novel approach called GBCCGA is introduced based on MOCCGA with some modifications. The main difference between GBCCGA and MOCCGA is in their niching technique which instead of the traditional sharing mechanism in MOCCGA, a novel grid-based technique is used in GBCCGA. The reported results show that GBCCGA performs roughly the same as NSCCGA but with very low computational complexity with respect to the original MOCCGA.

  18. Robustness analysis of EGFR signaling network with a multi-objective evolutionary algorithm.

    Science.gov (United States)

    Zou, Xiufen; Liu, Minzhong; Pan, Zishu

    2008-01-01

    Robustness, the ability to maintain performance in the face of perturbations and uncertainty, is believed to be a necessary property of biological systems. In this paper, we address the issue of robustness in an important signal transduction network--epidermal growth factor receptor (EGFR) network. First, we analyze the robustness in the EGFR signaling network using all rate constants against the Gauss variation which was described as "the reference parameter set" in the previous study [Kholodenko, B.N., Demin, O.V., Moehren, G., Hoek, J.B., 1999. Quantification of short term signaling by the epidermal growth factor receptor. J. Biol. Chem. 274, 30169-30181]. The simulation results show that signal time, signal duration and signal amplitude of the EGRR signaling network are relatively not robust against the simultaneous variation of the reference parameter set. Second, robustness is quantified using some statistical quantities. Finally, a multi-objective evolutionary algorithm (MOEA) is presented to search reaction rate constants which optimize the robustness of network and compared with the NSGA-II, which is a representation of a class of modern multi-objective evolutionary algorithms. Our simulation results demonstrate that signal time, signal duration and signal amplitude of the four key components--the most downstream variable in each of the pathways: R-Sh-G-S, R-PLP, R-G-S and the phosphorylated receptor RP in EGRR signaling network for the optimized parameter sets have better robustness than those for the reference parameter set and the NSGA-II. These results can provide valuable insight into experimental designs and the dynamics of the signal-response relationship between the dimerized and activated EGFR and the activation of downstream proteins.

  19. How Do Severe Constraints Affect the Search Ability of Multiobjective Evolutionary Algorithms in Water Resources?

    Science.gov (United States)

    Clarkin, T. J.; Kasprzyk, J. R.; Raseman, W. J.; Herman, J. D.

    2015-12-01

    This study contributes a diagnostic assessment of multiobjective evolutionary algorithm (MOEA) search on a set of water resources problem formulations with different configurations of constraints. Unlike constraints in classical optimization modeling, constraints within MOEA simulation-optimization represent limits on acceptable performance that delineate whether solutions within the search problem are feasible. Constraints are relevant because of the emergent pressures on water resources systems: increasing public awareness of their sustainability, coupled with regulatory pressures on water management agencies. In this study, we test several state-of-the-art MOEAs that utilize restricted tournament selection for constraint handling on varying configurations of water resources planning problems. For example, a problem that has no constraints on performance levels will be compared with a problem with several severe constraints, and a problem with constraints that have less severe values on the constraint thresholds. One such problem, Lower Rio Grande Valley (LRGV) portfolio planning, has been solved with a suite of constraints that ensure high reliability, low cost variability, and acceptable performance in a single year severe drought. But to date, it is unclear whether or not the constraints are negatively affecting MOEAs' ability to solve the problem effectively. Two categories of results are explored. The first category uses control maps of algorithm performance to determine if the algorithm's performance is sensitive to user-defined parameters. The second category uses run-time performance metrics to determine the time required for the algorithm to reach sufficient levels of convergence and diversity on the solution sets. Our work exploring the effect of constraints will better enable practitioners to define MOEA problem formulations for real-world systems, especially when stakeholders are concerned with achieving fixed levels of performance according to one or

  20. An effective co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem

    Directory of Open Access Journals (Sweden)

    Guanlong Deng

    2015-12-01

    Full Text Available This article proposes a competitive co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem with the criterion to minimize makespan, which is a renowned NP-hard combinatorial optimization problem. An innovative coding and decoding mechanism is proposed. The mechanism uses square matrix to represent the quantum individual and adapts the quantum rotation gate to update the quantum individual. In the algorithm framework, the store-with-diversity is proposed to maintain the diversity of the population. Moreover, a competitive co-evolution strategy is introduced to enhance the evolutionary pressure and accelerate the convergence. The store-with-diversity and competitive co-evolution are designed to keep a balance between exploration and exploitation. Simulations based on a benchmark set and comparisons with several existing algorithms demonstrate the effectiveness and robustness of the proposed algorithm.

  1. Comparing State-of-the-Art Evolutionary Multi-Objective Algorithms for Long-Term Groundwater Monitoring Design

    Science.gov (United States)

    Reed, P. M.; Kollat, J. B.

    2005-12-01

    This study demonstrates the effectiveness of a modified version of Deb's Non-Dominated Sorted Genetic Algorithm II (NSGAII), which the authors have named the Epsilon-Dominance Non-Dominated Sorted Genetic Algorithm II (Epsilon-NSGAII), at solving a four objective long-term groundwater monitoring (LTM) design test case. The Epsilon-NSGAII incorporates prior theoretical competent evolutionary algorithm (EA) design concepts and epsilon-dominance archiving to improve the original NSGAII's efficiency, reliability, and ease-of-use. This algorithm eliminates much of the traditional trial-and-error parameterization associated with evolutionary multi-objective optimization (EMO) through epsilon-dominance archiving, dynamic population sizing, and automatic termination. The effectiveness and reliability of the new algorithm is compared to the original NSGAII as well as two other benchmark multi-objective evolutionary algorithms (MOEAs), the Epsilon-Dominance Multi-Objective Evolutionary Algorithm (Epsilon-MOEA) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). These MOEAs have been selected because they have been demonstrated to be highly effective at solving numerous multi-objective problems. The results presented in this study indicate superior performance of the Epsilon-NSGAII in terms of the hypervolume indicator, unary Epsilon-indicator, and first-order empirical attainment function metrics. In addition, the runtime metric results indicate that the diversity and convergence dynamics of the Epsilon-NSGAII are competitive to superior relative to the SPEA2, with both algorithms greatly outperforming the NSGAII and Epsilon-MOEA in terms of these metrics. The improvements in performance of the Epsilon-NSGAII over its parent algorithm the NSGAII demonstrate that the application of Epsilon-dominance archiving, dynamic population sizing with archive injection, and automatic termination greatly improve algorithm efficiency and reliability. In addition, the usability of

  2. An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing

    OpenAIRE

    Puchinger, Jakob; Raidl, Günther,

    2004-01-01

    International audience; We consider the 3-stage two-dimensional bin packing problem , which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The higher computational effort of the EA pays off in terms of better final solu...

  3. Time Complexity of Evolutionary Algorithms for Combinatorial Optimization: A Decade of Results

    Institute of Scientific and Technical Information of China (English)

    Pietro S. Oliveto; Jun He; Xin Yao

    2007-01-01

    Computational time complexity analyzes of evolutionary algorithms (EAs) have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the (1+1)-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the (1+1)-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.

  4. Two-level, two-objective evolutionary algorithms for solving unit commitment problems

    Energy Technology Data Exchange (ETDEWEB)

    Georgopoulou, Chariklia A.; Giannakoglou, Kyriakos C. [National Technical University of Athens, School of Mechanical Engineering, Laboratory of Thermal Turbomachines, Parallel CFD and Optimization Unit, P.O. Box 64069, Athens 157 10 (Greece)

    2009-07-15

    A two-level, two-objective optimization scheme based on evolutionary algorithms (EAs) is proposed for solving power generating Unit Commitment (UC) problems by considering stochastic power demand variations. Apart from the total operating cost to cover a known power demand distribution over the scheduling horizon, which is the first objective, the risk of not fulfilling possible demand variations forms the second objective to be minimized. For this kind of problems with a high number of decision variables, conventional EAs become inefficient optimization tools, since they require a high number of evaluations before reaching the optimal solution(s). To considerably reduce the computational burden, a two-level algorithm is proposed. At the low level, a coarsened UC problem is defined and solved using EAs to locate promising solutions at low cost: a strategy for coarsening the UC problem is proposed. Promising solutions migrate upwards to be injected into the high level EA population for further refinement. In addition, at the high level, the scheduling horizon is partitioned in a small number of subperiods of time which are optimized iteratively using EAs, based on objective function(s) penalized to ensure smooth transition from/to the adjacent subperiods. Handling shorter chromosomes due to partitioning increases method's efficiency despite the need for iterating. The proposed two-level method and conventional EAs are compared on representative test problems. (author)

  5. HYBRID EVOLUTIONARY ALGORITHMS FOR FREQUENCY AND VOLTAGE CONTROL IN POWER GENERATING SYSTEM

    Directory of Open Access Journals (Sweden)

    A. Soundarrajan

    2010-10-01

    Full Text Available Power generating system has the responsibility to ensure that adequate power is delivered to the load, both reliably and economically. Any electrical system must be maintained at the desired operating level characterized by nominal frequency and voltage profile. But the ability of the power system to track the load is limited due to physical and technical consideration. Hence, a Power System Control is required to maintain a continuous balance between power generation and load demand. The quality of power supply is affected due to continuous and random changes in load during the operation of the power system. Load Frequency Controller (LFC and Automatic Voltage Regulator (AVR play an important role in maintaining constant frequency and voltage in order to ensure the reliability of electric power. The fixed gain PID controllers used for this application fail to perform under varying load conditions and hence provide poor dynamic characteristics with large settling time, overshoot and oscillations. In this paper, Evolutionary Algorithms (EA like, Enhanced Particle Swarm Optimization (EPSO, Multi Objective Particle Swarm Optimization (MOPSO, and Stochastic Particle Swarm Optimization (SPSO are proposed to overcome the premature convergence problem in a standard PSO. These algorithms reduce transient oscillations and also increase the computational efficiency. Simulation results demonstrate that the proposed controller adapt themselves appropriate to varying loads and hence provide better performance characteristics with respect to settling time, oscillations and overshoot.

  6. Design Optimization of an Axial Fan Blade Through Multi-Objective Evolutionary Algorithm

    Science.gov (United States)

    Kim, Jin-Hyuk; Choi, Jae-Ho; Husain, Afzal; Kim, Kwang-Yong

    2010-06-01

    This paper presents design optimization of an axial fan blade with hybrid multi-objective evolutionary algorithm (hybrid MOEA). Reynolds-averaged Navier-Stokes equations with shear stress transport turbulence model are discretized by the finite volume approximations and solved on hexahedral grids for the flow analyses. The validation of the numerical results was performed with the experimental data for the axial and tangential velocities. Six design variables related to the blade lean angle and blade profile are selected and the Latin hypercube sampling of design of experiments is used to generate design points within the selected design space. Two objective functions namely total efficiency and torque are employed and the multi-objective optimization is carried out to enhance total efficiency and to reduce the torque. The flow analyses are performed numerically at the designed points to obtain values of the objective functions. The Non-dominated Sorting of Genetic Algorithm (NSGA-II) with ɛ -constraint strategy for local search coupled with surrogate model is used for multi-objective optimization. The Pareto-optimal solutions are presented and trade-off analysis is performed between the two competing objectives in view of the design and flow constraints. It is observed that total efficiency is enhanced and torque is decreased as compared to the reference design by the process of multi-objective optimization. The Pareto-optimal solutions are analyzed to understand the mechanism of the improvement in the total efficiency and reduction in torque.

  7. An Evolutionary Algorithm of the Regional Collaborative Innovation Based on Complex Network

    Directory of Open Access Journals (Sweden)

    Kun Wang

    2016-01-01

    Full Text Available This paper proposed a new perspective to study the evolution of regional collaborative innovation based on complex network theory. The two main conceptions of evolution, “graph with dynamic features” and “network evolution,” have been provided in advance. Afterwards, we illustrate the overall architecture and capability model of the regional collaborative innovation system, which contains several elements and participants. Therefore, we can definitely assume that the regional collaborative innovation system could be regarded as a complex network model. In the proposed evolutionary algorithm, we consider that each node in the network could only connect to less than a certain amount of neighbors, and the extreme value is determined by its importance. Through the derivation, we have created a probability density function as the most important constraint and supporting condition of our simulation experiments. Then, a case study was performed to explore the network topology and validate the effectiveness of our algorithm. All the raw datasets were obtained from the official website of the National Bureau of Statistic of China and some other open sources. Finally, some meaningful recommendations were presented to policy makers, especially based on the experimental results and some common conclusions of complex networks.

  8. Application of a multi-objective evolutionary algorithm to the spacecraft stationkeeping problem

    Science.gov (United States)

    Myers, Philip L.; Spencer, David B.

    2016-10-01

    Satellite operations are becoming an increasingly private industry, requiring increased profitability. Efficient and safe operation of satellites in orbit will ensure longer lasting and more profitable satellite services. This paper focuses on the use of a multi-objective evolutionary algorithm to schedule the maneuvers of a hypothetical satellite operating at geosynchronous altitude, by seeking to minimize the propellant consumed through the execution of stationkeeping maneuvers and the time the satellite is displaced from its desired orbital plane. Minimization of the time out of place increases the operational availability and minimizing the propellant usage which allows the spacecraft to operate longer. North-South stationkeeping was studied in this paper, through the use of a set of orbit inclination change maneuvers each year. Two cases for the maximum number of maneuvers to be executed were considered, with four and five maneuvers per year. The results delivered by the algorithm provide maneuver schedules which require 40-100 m/s of total Δv for two years of operation, with the satellite maintaining the satellite's orbital plane to within 0.1° between 84% and 96% of the two years being modeled.

  9. Multi Objective Optimization of Yarn Quality and Fibre Quality Using Evolutionary Algorithm

    Science.gov (United States)

    Ghosh, Anindya; Das, Subhasis; Banerjee, Debamalya

    2013-03-01

    The quality and cost of resulting yarn play a significant role to determine its end application. The challenging task of any spinner lies in producing a good quality yarn with added cost benefit. The present work does a multi-objective optimization on two objectives, viz. maximization of cotton yarn strength and minimization of raw material quality. The first objective function has been formulated based on the artificial neural network input-output relation between cotton fibre properties and yarn strength. The second objective function is formulated with the well known regression equation of spinning consistency index. It is obvious that these two objectives are conflicting in nature i.e. not a single combination of cotton fibre parameters does exist which produce maximum yarn strength and minimum cotton fibre quality simultaneously. Therefore, it has several optimal solutions from which a trade-off is needed depending upon the requirement of user. In this work, the optimal solutions are obtained with an elitist multi-objective evolutionary algorithm based on Non-dominated Sorting Genetic Algorithm II (NSGA-II). These optimum solutions may lead to the efficient exploitation of raw materials to produce better quality yarns at low costs.

  10. A hybrid multi-objective evolutionary algorithm for wind-turbine blade optimization

    Science.gov (United States)

    Sessarego, M.; Dixon, K. R.; Rival, D. E.; Wood, D. H.

    2015-08-01

    A concurrent-hybrid non-dominated sorting genetic algorithm (hybrid NSGA-II) has been developed and applied to the simultaneous optimization of the annual energy production, flapwise root-bending moment and mass of the NREL 5 MW wind-turbine blade. By hybridizing a multi-objective evolutionary algorithm (MOEA) with gradient-based local search, it is believed that the optimal set of blade designs could be achieved in lower computational cost than for a conventional MOEA. To measure the convergence between the hybrid and non-hybrid NSGA-II on a wind-turbine blade optimization problem, a computationally intensive case was performed using the non-hybrid NSGA-II. From this particular case, a three-dimensional surface representing the optimal trade-off between the annual energy production, flapwise root-bending moment and blade mass was achieved. The inclusion of local gradients in the blade optimization, however, shows no improvement in the convergence for this three-objective problem.

  11. Analysis of Parametric Optimization of Field-Oriented Control of 3-Phase Induction Motor with Using Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Wiktor HUDY

    2013-12-01

    Full Text Available In this paper, the impact of regulators set and their types for the characteristic of rotational speed of induction motor was researched.. The evolutionary algorithm was used as optimization tool. Results were verified with using MATLAB/Simulink.

  12. The Roles of Local Search, Model Building and Optimal Mixing in Evolutionary Algorithms from a BBO Perspective

    NARCIS (Netherlands)

    P.A.N. Bosman (Peter); D. Thierens (Dirk); N. Krasnogor

    2011-01-01

    htmlabstractThe inclusion of local search (LS) techniques in evolutionary algorithms (EAs) is known to be very important in order to obtain competitive results on combinatorial and real-world optimization problems. Often however, an important source of the added value of LS is an understanding of

  13. Optimal boundary control of a tracking problem for a parabolic distributed system with open-loop control using evolutionary algorithms

    Directory of Open Access Journals (Sweden)

    Russel J Stonier

    2003-08-01

    Full Text Available In this paper we examine the application of evolutionary algorithms to find open-loop control solutions of the optimal control problem arising from the semidiscretisation of a linear parabolic tracking problem with boundary control. The solution is compared with the solutions obtained by methods based upon the variational equations of the Minimum Principle and the finite element method.

  14. Eye-Tracking Evolutionary Algorithm to minimize user's fatigue in IEC applied to Interactive One-Max problem

    CERN Document Server

    Pallez, Denis; Baccino, Thierry; Dumercy, Laurent

    2008-01-01

    In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary Computation. The approach is then applied to the Interactive One-Max optimization problem.

  15. A possibilistic approach to rotorcraft design through a multi-objective evolutionary algorithm

    Science.gov (United States)

    Chae, Han Gil

    Most of the engineering design processes in use today in the field may be considered as a series of successive decision making steps. The decision maker uses information at hand, determines the direction of the procedure, and generates information for the next step and/or other decision makers. However, the information is often incomplete, especially in the early stages of the design process of a complex system. As the complexity of the system increases, uncertainties eventually become unmanageable using traditional tools. In such a case, the tools and analysis values need to be "softened" to account for the designer's intuition. One of the methods that deals with issues of intuition and incompleteness is possibility theory. Through the use of possibility theory coupled with fuzzy inference, the uncertainties estimated by the intuition of the designer are quantified for design problems. By involving quantified uncertainties in the tools, the solutions can represent a possible set, instead of a crisp spot, for predefined levels of certainty. From a different point of view, it is a well known fact that engineering design is a multi-objective problem or a set of such problems. The decision maker aims to find satisfactory solutions, sometimes compromising the objectives that conflict with each other. Once the candidates of possible solutions are generated, a satisfactory solution can be found by various decision-making techniques. A number of multi-objective evolutionary algorithms (MOEAs) have been developed, and can be found in the literature, which are capable of generating alternative solutions and evaluating multiple sets of solutions in one single execution of an algorithm. One of the MOEA techniques that has been proven to be very successful for this class of problems is the strength Pareto evolutionary algorithm (SPEA) which falls under the dominance-based category of methods. The Pareto dominance that is used in SPEA, however, is not enough to account for the

  16. A SURVEY OF EVOLUTIONARY ALGORITHMS%进化算法研究进展

    Institute of Scientific and Technical Information of China (English)

    姚新; 陈国良; 徐惠敏; 刘勇

    1995-01-01

    进化算法是一类借鉴生物界自然选择和自然遗传机制的随机搜索算法,主要包括遗传算法(generic algorithms,简记为GAs)、进化规划(evolutionary programming,简记为EP)和进化策略(evolutionary strategies,简记为ESs),它们可以用来解决优化和机器学习等问题.进化算法的两个主要特点是群体搜索策略及群体中个体之间的信息交换.进化算法不依赖于梯度信息,因此它们的应用范围十分广泛,尤其适于处理传统搜索方法解决不了的复杂问题和非线性问题.本文首先介绍了进化算法的基本思想;然后对三种典型算法进行了比较.讨论了目前进化算法的研究内容和方向,并针对遗传算法给出了三种并行实现模式;最后,论述了进化算法中有争议的基本问题,并指出将来进一步研究的方向.

  17. Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks

    Directory of Open Access Journals (Sweden)

    Subbaraj Potti

    2011-01-01

    Full Text Available Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA, is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing and noncommensurable objectives. Results: SPEA combines several features of previous multi-objective evolutionary algorithms in a unique manner. SPEA stores nondominated solutions externally in another continuously-updated population and uses a hierarchical clustering algorithm to provide the decision maker with a manageable pareto-optimal set. SPEA is applied to a 20 node network as well as to large size networks ranging from 50-200 nodes. Conclusion: The results demonstrate the capabilities of the proposed approach to generate true and well distributed pareto-optimal nondominated solutions.

  18. A review and experimental study on application of classifiers and evolutionary algorithms in EEG based brain-machine interface systems.

    Science.gov (United States)

    Tahernezhad-Javazm, Farajollah; Azimirad, Vahid; Shoaran, Maryam

    2017-07-18

    Considering the importance and the near future development of noninvasive Brain-Machine Interface (BMI) systems, this paper presents a comprehensive theoretical-experimental survey on the classification and evolutionary methods for BMI-based systems in which EEG signals are used. The paper is divided into two main parts. In the first part a wide range of different types of the base and combinatorial classifiers including boosting and bagging classifiers and also evolutionary algorithms are reviewed and investigated. In the second part, these classifiers and evolutionary algorithms are assessed and compared based on two types of relatively widely used BMI systems, that is, Sensory Motor Rhythm-BMI (SMR-BMI) and Event Related Potentials-BMI (ERPs-BMI). Moreover, in the second part, some of the improved evolutionary algorithms as well as bi-objective algorithms are experimentally assessed and compared. In this study two databases are used, and cross-validation accuracy (CVA) and stability to data volume (SDV) are considered as the evaluation criteria for the classifiers. According to the experimental results on both databases, regarding the base classifiers, LDA (Linear Discriminant Analysis) and SVM (Support Vector Machines) with respect to CVA evaluation metric, and NB (Naive Bayes) with respect to SDV demonstrated the best performances. Among the combinatorial classifiers, four classifiers Bagg-DT (Bagging Decision Tree), LogitBoost, and GentleBoost with respect to CVA, and Bagging-LR (Bagging Logistic Regression) and AdaBoost (Adaptive Boosting) with respect to SDV had the best performances. Finally, regarding the evolutionary algorithms, single-objective IWO (Invasive Weed Optimization) and bi-objective NSIWO (Nondominated Sorting IWO) algorithms demonstrated the best performances. We present a general survey on the base and the combinatorial classification methods for EEG signals (sensory motor rhythm and event related potentials) as well as their optimization

  19. A Hybrid Evolutionary Algorithm to Quadratic Three-Dimensional Assignment Problem with Local Search for Many-Core Graphics Processors

    Science.gov (United States)

    Lipinski, Piotr

    This paper concerns the quadratic three-dimensional assignment problem (Q3AP), an extension of the quadratic assignment problem (QAP), and proposes an efficient hybrid evolutionary algorithm combining stochastic optimization and local search with a number of crossover operators, a number of mutation operators and an auto-adaptation mechanism. Auto-adaptation manages the pool of evolutionary operators applying different operators in different computation phases to better explore the search space and to avoid premature convergence. Local search additionally optimizes populations of candidate solutions and accelerates evolutionary search. It uses a many-core graphics processor to optimize a number of solutions in parallel, which enables its incorporation into the evolutionary algorithm without excessive increases in the computation time. Experiments performed on benchmark Q3AP instances derived from the classic QAP instances proposed by Nugent et al. confirmed that the proposed algorithm is able to find optimal solutions to Q3AP in a reasonable time and outperforms best known results found in the literature.

  20. Effect of Noisy Fitness in Real-Time Strategy Games Player Behaviour Optimisation Using Evolutionary Algorithms

    Institute of Scientific and Technical Information of China (English)

    Antonio M.Mora; Antonio Fernández-Ares; Juan J.Merelo; Pablo García-Sánchez; Carlos M.Fernandes

    2012-01-01

    This paper investigates the performance and the results of an evolutionary algorithm (EA) specifically designed for evolving the decision engine of a program (which,in this context,is called bot) that plays Planet Wars.This game,which was chosen for the Google Artificial Intelligence Challenge in 2010,requires the bot to deal with multiple target planets,while achieving a certain degree of adaptability in order to defeat different opponents in different scenarios.The decision engine of the bot is initially based on a set of rules that have been defined after an empirical study,and a genetic algorithm (GA) is used for tuning the set of constants,weights and probabilities that those rules include,and therefore,the general behaviour of the bot.Then,the bot is supplied with the evolved decision engine and the results obtained when competing with other bots (a bot offered by Google as a sparring partner,and a scripted bot with a pre-established behaviour) are thoroughly analysed.The evaluation of the candidate solutions is based on the result of non-deterministic battles (and environmental interactions) against other bots,whose outcome depends on random draws as well as on the opponents'actions.Therefore,the proposed GA is dealing with a noisy fitness function.After analysing the effects of the noisy fitness,we conclude that tackling randomness via repeated combats and reevaluations reduces this effect and makes the GA a highly valuable approach for solving this problem.

  1. Multi-criteria optimal pole assignment robust controller design for uncertainty systems using an evolutionary algorithm

    Science.gov (United States)

    Sarjaš, Andrej; Chowdhury, Amor; Svečko, Rajko

    2016-09-01

    This paper presents the synthesis of an optimal robust controller design using the polynomial pole placement technique and multi-criteria optimisation procedure via an evolutionary computation algorithm - differential evolution. The main idea of the design is to provide a reliable fixed-order robust controller structure and an efficient closed-loop performance with a preselected nominally characteristic polynomial. The multi-criteria objective functions have quasi-convex properties that significantly improve convergence and the regularity of the optimal/sub-optimal solution. The fundamental aim of the proposed design is to optimise those quasi-convex functions with fixed closed-loop characteristic polynomials, the properties of which are unrelated and hard to present within formal algebraic frameworks. The objective functions are derived from different closed-loop criteria, such as robustness with metric ?∞, time performance indexes, controller structures, stability properties, etc. Finally, the design results from the example verify the efficiency of the controller design and also indicate broader possibilities for different optimisation criteria and control structures.

  2. Combining Interactive Infrastructure Modeling and Evolutionary Algorithm Optimization for Sustainable Water Resources Design

    Science.gov (United States)

    Smith, R.; Kasprzyk, J. R.; Zagona, E. A.

    2013-12-01

    Population growth and climate change, combined with difficulties in building new infrastructure, motivate portfolio-based solutions to ensuring sufficient water supply. Powerful simulation models with graphical user interfaces (GUI) are often used to evaluate infrastructure portfolios; these GUI based models require manual modification of the system parameters, such as reservoir operation rules, water transfer schemes, or system capacities. Multiobjective evolutionary algorithm (MOEA) based optimization can be employed to balance multiple objectives and automatically suggest designs for infrastructure systems, but MOEA based decision support typically uses a fixed problem formulation (i.e., a single set of objectives, decisions, and constraints). This presentation suggests a dynamic framework for linking GUI-based infrastructure models with MOEA search. The framework begins with an initial formulation which is solved using a MOEA. Then, stakeholders can interact with candidate solutions, viewing their properties in the GUI model. This is followed by changes in the formulation which represent users' evolving understanding of exigent system properties. Our case study is built using RiverWare, an object-oriented, data-centered model that facilitates the representation of a diverse array of water resources systems. Results suggest that assumptions within the initial MOEA search are violated after investigating tradeoffs and reveal how formulations should be modified to better capture stakeholders' preferences.

  3. Multiobjective Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Customer Satisfaction

    Directory of Open Access Journals (Sweden)

    Jingling Zhang

    2012-01-01

    Full Text Available The multiobjective vehicle routing problem considering customer satisfaction (MVRPCS involves the distribution of orders from several depots to a set of customers over a time window. This paper presents a self-adaptive grid multi-objective quantum evolutionary algorithm (MOQEA for the MVRPCS, which takes into account customer satisfaction as well as travel costs. The degree of customer satisfaction is represented by proposing an improved fuzzy due-time window, and the optimization problem is modeled as a mixed integer linear program. In the MOQEA, nondominated solution set is constructed by the Challenge Cup rules. Moreover, an adaptive grid is designed to achieve the diversity of solution sets; that is, the number of grids in each generation is not fixed but is automatically adjusted based on the distribution of the current generation of nondominated solution set. In the study, the MOQEA is evaluated by applying it to classical benchmark problems. Results of numerical simulation and comparison show that the established model is valid and the MOQEA is effective for MVRPCS.

  4. Modeling an aquatic ecosystem: application of an evolutionary algorithm with genetic doping to reduce prediction uncertainty

    Science.gov (United States)

    Friedel, Michael; Buscema, Massimo

    2016-04-01

    Aquatic ecosystem models can potentially be used to understand the influence of stresses on catchment resource quality. Given that catchment responses are functions of natural and anthropogenic stresses reflected in sparse and spatiotemporal biological, physical, and chemical measurements, an ecosystem is difficult to model using statistical or numerical methods. We propose an artificial adaptive systems approach to model ecosystems. First, an unsupervised machine-learning (ML) network is trained using the set of available sparse and disparate data variables. Second, an evolutionary algorithm with genetic doping is applied to reduce the number of ecosystem variables to an optimal set. Third, the optimal set of ecosystem variables is used to retrain the ML network. Fourth, a stochastic cross-validation approach is applied to quantify and compare the nonlinear uncertainty in selected predictions of the original and reduced models. Results are presented for aquatic ecosystems (tens of thousands of square kilometers) undergoing landscape change in the USA: Upper Illinois River Basin and Central Colorado Assessment Project Area, and Southland region, NZ.

  5. Evolutionary Algorithm Based Feature Optimization for Multi-Channel EEG Classification

    Science.gov (United States)

    Wang, Yubo; Veluvolu, Kalyana C.

    2017-01-01

    The most BCI systems that rely on EEG signals employ Fourier based methods for time-frequency decomposition for feature extraction. The band-limited multiple Fourier linear combiner is well-suited for such band-limited signals due to its real-time applicability. Despite the improved performance of these techniques in two channel settings, its application in multiple-channel EEG is not straightforward and challenging. As more channels are available, a spatial filter will be required to eliminate the noise and preserve the required useful information. Moreover, multiple-channel EEG also adds the high dimensionality to the frequency feature space. Feature selection will be required to stabilize the performance of the classifier. In this paper, we develop a new method based on Evolutionary Algorithm (EA) to solve these two problems simultaneously. The real-valued EA encodes both the spatial filter estimates and the feature selection into its solution and optimizes it with respect to the classification error. Three Fourier based designs are tested in this paper. Our results show that the combination of Fourier based method with covariance matrix adaptation evolution strategy (CMA-ES) has the best overall performance. PMID:28203141

  6. Design of Heliostat Fields using a Multi-Objective Evolutionary Algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Pelet, X.; Favrat, D.; Sanchez, M.; Romero, M.

    2006-07-01

    The paper discusses the interest of a multi-objective optimization approach for the design of complex energy systems and illustrates its application for the design of the concentrator field of solar tower power plants. A new program is described which is coupled with an original multimodal evolutionary algorithm to optimize the whole design based on two objectives (specific energy cost versus investment cost). The main strategy proposed, to keep the number of variables within a reasonable domain, is to distribute identical reflectors along a set of concentric ellipses around the tower. The interest of the method is illustrated for one given period with the Pareto curve showing all the optimum solutions (lowest specific energy cost at any given investment). The investment cost includes, among others the cost of the heliostats themselves, the cost of land, the cost of the tower. Results not only show the full solutions fields and an increase of 22% of the energy produced compared to the WinDelsol solution for the same investment. (Author)

  7. Ship Hull Form Optimization by Evolutionary Algorithm in Order to Diminish the Drag

    Institute of Scientific and Technical Information of China (English)

    Hassan Zakerdoost; Hassan Ghassemi; Mahmoud Ghiasi

    2013-01-01

    This study presents a numerical method for optimizing hull form in calm water with respect to total drag which contains a viscous drag and a wave drag.The ITTC 1957 model-ship correlation line was used to predict frictional drag and the corrected linearized thin-ship theory was employed to estimate the wave drag.The evolution strategy (ES) which is a member of the evolutionary algorithms (EAs) family obtains an optimum hull form by considering some design constraints.Standard Wigley hull is considered as an initial hull in optimization procedures for two test cases and new hull forms were achieved at Froude numbers 0.24,0.316 and 0.408.In one case the ES technique was ran for the initial hull form,where the main dimensions were fixed and the only variables were the hull offsets.In the other case in addition to hull offsets,the main dimensions were considered as variables that are optimized simultaneously.The numerical results of optimization procedure demonstrate that the optimized hull forms yield a reduction in total drag.

  8. Complexity Reduction in the Use of Evolutionary Algorithms to Function Optimization: A Variable Reduction Strategy

    Directory of Open Access Journals (Sweden)

    Guohua Wu

    2013-01-01

    Full Text Available Discovering and utilizing problem domain knowledge is a promising direction towards improving the efficiency of evolutionary algorithms (EAs when solving optimization problems. We propose a knowledge-based variable reduction strategy (VRS that can be integrated into EAs to solve unconstrained and first-order derivative optimization functions more efficiently. VRS originates from the knowledge that, in an unconstrained and first-order derivative optimization function, the optimal solution locates in a local extreme point at which the partial derivative over each variable equals zero. Through this collective of partial derivative equations, some quantitative relations among different variables can be obtained. These variable relations have to be satisfied in the optimal solution. With the use of such relations, VRS could reduce the number of variables and shrink the solution space when using EAs to deal with the optimization function, thus improving the optimizing speed and quality. When we apply VRS to optimization problems, we just need to modify the calculation approach of the objective function. Therefore, practically, it can be integrated with any EA. In this study, VRS is combined with particle swarm optimization variants and tested on several benchmark optimization functions and a real-world optimization problem. Computational results and comparative study demonstrate the effectiveness of VRS.

  9. Multiobjective evolutionary algorithm for long-term planning of the national energy and transportation systems

    Energy Technology Data Exchange (ETDEWEB)

    Ibanez, Eduardo; McCalley, James D. [Iowa State University, Department of Electrical and Computer Engineering, Ames, IA (United States)

    2011-06-15

    The transportation and electric sectors are by far the largest producers of greenhouse emissions in the United States while they consume a significant amount of the national energy. The ever rising demand for these systems, the growing public concern on issues like global warming or national security, along with emerging technologies that promise great synergies between both (plug-in hybrid vehicles or electrified rail), creates the necessity for a new framework for long-term planning. This paper presents a comprehensive methodology to investigate long-term investment portfolios of these two infrastructures and their interdependencies. Its multiobjective nature, based on the NSGA-II evolutionary algorithm, assures the discovery of the Pareto front of solutions in terms of cost, sustainability and resiliency. The optimization is driven by a cost-minimization network flow program which is modified in order to explore the solution space. The modular design enables the use of metrics to evaluate sustainability and resiliency and better characterize the objectives that the systems must meet. An index is presented to robustly meet long-term emission reduction goals. An example of a high level representation of the continental United States through 2050 is presented and analyzed using the present methodology. (orig.)

  10. Generalizing and learning protein-DNA binding sequence representations by an evolutionary algorithm

    KAUST Repository

    Wong, Ka Chun

    2011-02-05

    Protein-DNA bindings are essential activities. Understanding them forms the basis for further deciphering of biological and genetic systems. In particular, the protein-DNA bindings between transcription factors (TFs) and transcription factor binding sites (TFBSs) play a central role in gene transcription. Comprehensive TF-TFBS binding sequence pairs have been found in a recent study. However, they are in one-to-one mappings which cannot fully reflect the many-to-many mappings within the bindings. An evolutionary algorithm is proposed to learn generalized representations (many-to-many mappings) from the TF-TFBS binding sequence pairs (one-to-one mappings). The generalized pairs are shown to be more meaningful than the original TF-TFBS binding sequence pairs. Some representative examples have been analyzed in this study. In particular, it shows that the TF-TFBS binding sequence pairs are not presumably in one-to-one mappings. They can also exhibit many-to-many mappings. The proposed method can help us extract such many-to-many information from the one-to-one TF-TFBS binding sequence pairs found in the previous study, providing further knowledge in understanding the bindings between TFs and TFBSs. © 2011 Springer-Verlag.

  11. 广义抽象进化算法的性质分析%The Properties Analysis for Generalized Abstract Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    薛明志; 马云苓

    2006-01-01

    There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model called the abstract evolutionary algorithm (AEA), which unifies most of the currently known evolutionary algorithms and describes the evolution as an abstract stochastic process composed of two fundamental abstract operators: abstract selection and evolution operators. In this paper, we first introduce the definitions of the generalized abstract selection and evolution operators. Then we discuss the characterization of some parameters related to generalized abstract selection and evolution operators. Based on these operators, we finally give the strong convergence of the generalized abstract evolutionary algorithm. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.

  12. Predicting peptides binding to MHC class II molecules using multi-objective evolutionary algorithms

    Directory of Open Access Journals (Sweden)

    Feng Lin

    2007-11-01

    Full Text Available Abstract Background Peptides binding to Major Histocompatibility Complex (MHC class II molecules are crucial for initiation and regulation of immune responses. Predicting peptides that bind to a specific MHC molecule plays an important role in determining potential candidates for vaccines. The binding groove in class II MHC is open at both ends, allowing peptides longer than 9-mer to bind. Finding the consensus motif facilitating the binding of peptides to a MHC class II molecule is difficult because of different lengths of binding peptides and varying location of 9-mer binding core. The level of difficulty increases when the molecule is promiscuous and binds to a large number of low affinity peptides. In this paper, we propose two approaches using multi-objective evolutionary algorithms (MOEA for predicting peptides binding to MHC class II molecules. One uses the information from both binders and non-binders for self-discovery of motifs. The other, in addition, uses information from experimentally determined motifs for guided-discovery of motifs. Results The proposed methods are intended for finding peptides binding to MHC class II I-Ag7 molecule – a promiscuous binder to a large number of low affinity peptides. Cross-validation results across experiments on two motifs derived for I-Ag7 datasets demonstrate better generalization abilities and accuracies of the present method over earlier approaches. Further, the proposed method was validated and compared on two publicly available benchmark datasets: (1 an ensemble of qualitative HLA-DRB1*0401 peptide data obtained from five different sources, and (2 quantitative peptide data obtained for sixteen different alleles comprising of three mouse alleles and thirteen HLA alleles. The proposed method outperformed earlier methods on most datasets, indicating that it is well suited for finding peptides binding to MHC class II molecules. Conclusion We present two MOEA-based algorithms for finding motifs

  13. Implementation and comparative analysis of the optimisations produced by evolutionary algorithms for the parameter extraction of PSP MOSFET model

    Science.gov (United States)

    Hadia, Sarman K.; Thakker, R. A.; Bhatt, Kirit R.

    2016-05-01

    The study proposes an application of evolutionary algorithms, specifically an artificial bee colony (ABC), variant ABC and particle swarm optimisation (PSO), to extract the parameters of metal oxide semiconductor field effect transistor (MOSFET) model. These algorithms are applied for the MOSFET parameter extraction problem using a Pennsylvania surface potential model. MOSFET parameter extraction procedures involve reducing the error between measured and modelled data. This study shows that ABC algorithm optimises the parameter values based on intelligent activities of honey bee swarms. Some modifications have also been applied to the basic ABC algorithm. Particle swarm optimisation is a population-based stochastic optimisation method that is based on bird flocking activities. The performances of these algorithms are compared with respect to the quality of the solutions. The simulation results of this study show that the PSO algorithm performs better than the variant ABC and basic ABC algorithm for the parameter extraction of the MOSFET model; also the implementation of the ABC algorithm is shown to be simpler than that of the PSO algorithm.

  14. The Conception of the New Agent-Based Platform for Modeling and Implementation of Parallel Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Sara Sabba

    2014-03-01

    Full Text Available Evolutionary algorithms (EAs are a range of problem-solving techniques based on mechanisms inspired by biological evolution. Nowadays, EAs have proven their ability and effectiveness to solve combinatorial problems. However, these methods require a considerable time of calculation. To overcome this problem, several parallelization strategies have been proposed in the literature. In this paper, we present a new parallel agent-based EC framework for solving numerical optimization problems in order to optimize computation time and solutions quality.

  15. Investigating preferences for colour-shape combinations with gaze driven optimization method based on evolutionary algorithms.

    Directory of Open Access Journals (Sweden)

    Tim eHolmes

    2013-12-01

    Full Text Available Studying aesthetic preference is notoriously difficult because it targets individual experience. Eye movements provide a rich source of behavioural measures that directly reflect subjective choice. To determine individual preferences for simple composition rules we here use fixation duration as the fitness measure in a Gaze Driven Evolutionary Algorithm (GDEA, which has been used as a tool to identify aesthetic preferences (Holmes & Zanker, 2012. In the present study, the GDEA was used to investigate the preferred combination of colour and shape which have been promoted in the Bauhaus arts school. We used the same 3 shapes (square, circle, triangle used by Kandinsky (1923, with the 3 colour palette from the original experiment (A, an extended 7 colour palette (B, and 8 different shape orientation (C. Participants were instructed to look for their preferred circle, triangle or square in displays with 8 stimuli of different shapes, colours and rotations, in an attempt to test for a strong preference for red squares, yellow triangles and blue circles in such an unbiased experimental design and with an extended set of possible combinations. We Tested 6 participants extensively on the different conditions and found consistent preferences for individuals, but little evidence at the group level for preference consistent with Kandinsky’s claims, apart from some weak link between yellow and triangles. Our findings suggest substantial inter-individual differences in the presence of stable individual associations of colour and shapes, but also that these associations are robust within a single individual. These individual differences go some way towards challenging the claims of the universal preference for colour/shape combinations proposed by Kandinsky, but also indicate that a much larger sample size would be needed to confidently reject that hypothesis. Moreover, these experiments highlight the vast potential of the GDEA in experimental aesthetics

  16. Metamodel-assisted evolutionary algorithms for the unit commitment problem with probabilistic outages

    Energy Technology Data Exchange (ETDEWEB)

    Georgopoulou, Chariklia A.; Giannakoglou, Kyriakos C. [National Technical University of Athens, School of Mechanical Engineering, Lab. of Thermal Turbomachines, Parallel CFD and Optimization Unit, P.O. Box 64069, Athens 157 10 (Greece)

    2010-05-15

    An efficient method for solving power generating unit commitment (UC) problems with probabilistic unit outages is proposed. It is based on a two-level evolutionary algorithm (EA) minimizing the expected total operating cost (TOC) of a system of power generating units over a scheduling period, with known failure and repair rates of each unit. To compute the cost function value of each EA population member, namely a candidate UC schedule, a Monte Carlo simulation must be carried out. Some thousands of replicates are generated according to the units' outage and repair rates and the corresponding probabilities. Each replicate is represented by a series of randomly generated availability and unavailability periods of time for each unit and the UC schedule under consideration accordingly. The expected TOC is the average of the TOCs of all Monte Carlo replicates. Therefore, the CPU cost per Monte Carlo evaluation increases noticeably and so does the CPU cost of running the EA. To reduce it, the use of a metamodel-assisted EA (MAEA) with on-line trained surrogate evaluation models or metamodels (namely, radial-basis function networks) is proposed. A novelty of this method is that the metamodels are trained on a few ''representative'' unit outage scenarios selected among the Monte Carlo replicates generated once during the optimization and, then, used to predict the expected TOC. Based on this low cost, approximate pre-evaluation, only a few top individuals within each generation undergo Monte Carlo simulations. The proposed MAEA is demonstrated on test problems and shown to drastically reduce the CPU cost, compared to EAs which are exclusively based on Monte Carlo simulations. (author)

  17. Investigating preferences for color-shape combinations with gaze driven optimization method based on evolutionary algorithms.

    Science.gov (United States)

    Holmes, Tim; Zanker, Johannes M

    2013-01-01

    Studying aesthetic preference is notoriously difficult because it targets individual experience. Eye movements provide a rich source of behavioral measures that directly reflect subjective choice. To determine individual preferences for simple composition rules we here use fixation duration as the fitness measure in a Gaze Driven Evolutionary Algorithm (GDEA), which has been demonstrated as a tool to identify aesthetic preferences (Holmes and Zanker, 2012). In the present study, the GDEA was used to investigate the preferred combination of color and shape which have been promoted in the Bauhaus arts school. We used the same three shapes (square, circle, triangle) used by Kandinsky (1923), with the three color palette from the original experiment (A), an extended seven color palette (B), and eight different shape orientation (C). Participants were instructed to look for their preferred circle, triangle or square in displays with eight stimuli of different shapes, colors and rotations, in an attempt to test for a strong preference for red squares, yellow triangles and blue circles in such an unbiased experimental design and with an extended set of possible combinations. We Tested six participants extensively on the different conditions and found consistent preferences for color-shape combinations for individuals, but little evidence at the group level for clear color/shape preference consistent with Kandinsky's claims, apart from some weak link between yellow and triangles. Our findings suggest substantial inter-individual differences in the presence of stable individual associations of color and shapes, but also that these associations are robust within a single individual. These individual differences go some way toward challenging the claims of the universal preference for color/shape combinations proposed by Kandinsky, but also indicate that a much larger sample size would be needed to confidently reject that hypothesis. Moreover, these experiments highlight the

  18. Enhancing multi-objective evolutionary algorithm performance with Markov Chain Monte Carlo

    Science.gov (United States)

    Shafii, M.; Vrugt, J. A.; Tolson, B.; Matott, L. S.

    2009-12-01

    Multi-Objective Evolutionary Algorithms (MOEAs) have emerged as successful optimization routines to solve complex and large-scale multi-objective model calibration problems. However, a common draw-back of these methods is that they require a relatively high number of function evaluations to produce an accurate approximation of Pareto front. This requirement can translate into incredibly large computational costs in hydrologic model calibration problems. Most research efforts to address this computational burden are focused on introducing or improving the operators applied in the MOEAs structure. However, population initialization, usually done through Random Sampling (RS) or Latin Hypercube Sampling (LHS), can also affect the searching efficiency and the quality of MOEA results. This study presents a novel approach to generate initial population of a MOEA (i.e. NSGA-II) by applying a Markov Chain Monte Carlo (MCMC) sampler. The basis of MCMC methods is a Markov chain generating a random walk through the search space, using a formal likelihood function to sample the high-probability-density regions of the parameter space. Therefore, these solutions, when used as initial population, are capable of carrying quite valuable information into MOEAs process. Instead of running the MCMC sampler (i.e. DREAM) to convergence, it is applied for a relatively small and fixed number of function evaluations. The MCMC samples are then processed to identify and archive the non-dominated solutions and this archive is used as NSGA-II’s initial population. In order to analyze the applicability of this approach, it is used for a number of benchmark mathematical problems, as well as multi-objective calibration of a rainfall-runoff model (HYMOD). Initial results show promising MOEA improvement when it is initialized with an MCMC based initial population. Results will be presented that comprehensively compares MOEA results with and without an MCMC based initial population in terms of the

  19. Reliable classification of two-class cancer data using evolutionary algorithms.

    Science.gov (United States)

    Deb, Kalyanmoy; Raji Reddy, A

    2003-11-01

    In the area of bioinformatics, the identification of gene subsets responsible for classifying available disease samples to two or more of its variants is an important task. Such problems have been solved in the past by means of unsupervised learning methods (hierarchical clustering, self-organizing maps, k-mean clustering, etc.) and supervised learning methods (weighted voting approach, k-nearest neighbor method, support vector machine method, etc.). Such problems can also be posed as optimization problems of minimizing gene subset size to achieve reliable and accurate classification. The main difficulties in solving the resulting optimization problem are the availability of only a few samples compared to the number of genes in the samples and the exorbitantly large search space of solutions. Although there exist a few applications of evolutionary algorithms (EAs) for this task, here we treat the problem as a multiobjective optimization problem of minimizing the gene subset size and minimizing the number of misclassified samples. Moreover, for a more reliable classification, we consider multiple training sets in evaluating a classifier. Contrary to the past studies, the use of a multiobjective EA (NSGA-II) has enabled us to discover a smaller gene subset size (such as four or five) to correctly classify 100% or near 100% samples for three cancer samples (Leukemia, Lymphoma, and Colon). We have also extended the NSGA-II to obtain multiple non-dominated solutions discovering as much as 352 different three-gene combinations providing a 100% correct classification to the Leukemia data. In order to have further confidence in the identification task, we have also introduced a prediction strength threshold for determining a sample's belonging to one class or the other. All simulation results show consistent gene subset identifications on three disease samples and exhibit the flexibilities and efficacies in using a multiobjective EA for the gene subset identification task.

  20. Evolutionary algorithms for the optimal management of coastal groundwater: A comparative study toward future challenges

    Science.gov (United States)

    Ketabchi, Hamed; Ataie-Ashtiani, Behzad

    2015-01-01

    This paper surveys the literature associated with the application of evolutionary algorithms (EAs) in coastal groundwater management problems (CGMPs). This review demonstrates that previous studies were mostly relied on the application of limited and particular EAs, mainly genetic algorithm (GA) and its variants, to a number of specific problems. The exclusive investigation of these problems is often not the representation of the variety of feasible processes may be occurred in coastal aquifers. In this study, eight EAs are evaluated for CGMPs. The considered EAs are: GA, continuous ant colony optimization (CACO), particle swarm optimization (PSO), differential evolution (DE), artificial bee colony optimization (ABC), harmony search (HS), shuffled complex evolution (SCE), and simplex simulated annealing (SIMPSA). The first application of PSO, ABC, HS, and SCE in CGMPs is reported here. Moreover, the four benchmark problems with different degree of difficulty and variety are considered to address the important issues of groundwater resources in coastal regions. Hence, the wide ranges of popular objective functions and constraints with the number of decision variables ranging from 4 to 15 are included. These benchmark problems are applied in the combined simulation-optimization model to examine the optimization scenarios. Some preliminary experiments are performed to select the most efficient parameters values for EAs to set a fair comparison. The specific capabilities of each EA toward CGMPs in terms of results quality and required computational time are compared. The evaluation of the results highlights EA's applicability in CGMPs, besides the remarkable strengths and weaknesses of them. The comparisons show that SCE, CACO, and PSO yield superior solutions among the EAs according to the quality of solutions whereas ABC presents the poor performance. CACO provides the better solutions (up to 17%) than the worst EA (ABC) for the problem with the highest decision

  1. Project scheduling: A multi-objective evolutionary algorithm that optimizes the effectiveness of human resources and the project makespan

    Science.gov (United States)

    Yannibelli, Virginia; Amandi, Analía

    2013-01-01

    In this article, the project scheduling problem is addressed in order to assist project managers at the early stage of scheduling. Thus, as part of the problem, two priority optimization objectives for managers at that stage are considered. One of these objectives is to assign the most effective set of human resources to each project activity. The effectiveness of a human resource is considered to depend on its work context. The other objective is to minimize the project makespan. To solve the problem, a multi-objective evolutionary algorithm is proposed. This algorithm designs feasible schedules for a given project and evaluates the designed schedules in relation to each objective. The algorithm generates an approximation to the Pareto set as a solution to the problem. The computational experiments carried out on nine different instance sets are reported.

  2. A Study on Many-Objective Optimization Using the Kriging-Surrogate-Based Evolutionary Algorithm Maximizing Expected Hypervolume Improvement

    Directory of Open Access Journals (Sweden)

    Chang Luo

    2015-01-01

    Full Text Available The many-objective optimization performance of the Kriging-surrogate-based evolutionary algorithm (EA, which maximizes expected hypervolume improvement (EHVI for updating the Kriging model, is investigated and compared with those using expected improvement (EI and estimation (EST updating criteria in this paper. Numerical experiments are conducted in 3- to 15-objective DTLZ1-7 problems. In the experiments, an exact hypervolume calculating algorithm is used for the problems with less than six objectives. On the other hand, an approximate hypervolume calculating algorithm based on Monte Carlo sampling is adopted for the problems with more objectives. The results indicate that, in the nonconstrained case, EHVI is a highly competitive updating criterion for the Kriging model and EA based many-objective optimization, especially when the test problem is complex and the number of objectives or design variables is large.

  3. Towards an Extended Evolutionary Game Theory with Survival Analysis and Agreement Algorithms for Modeling Uncertainty, Vulnerability, and Deception

    Science.gov (United States)

    Ma, Zhanshan (Sam)

    Competition, cooperation and communication are the three fundamental relationships upon which natural selection acts in the evolution of life. Evolutionary game theory (EGT) is a 'marriage' between game theory and Darwin's evolution theory; it gains additional modeling power and flexibility by adopting population dynamics theory. In EGT, natural selection acts as optimization agents and produces inherent strategies, which eliminates some essential assumptions in traditional game theory such as rationality and allows more realistic modeling of many problems. Prisoner's Dilemma (PD) and Sir Philip Sidney (SPS) games are two well-known examples of EGT, which are formulated to study cooperation and communication, respectively. Despite its huge success, EGT exposes a certain degree of weakness in dealing with time-, space- and covariate-dependent (i.e., dynamic) uncertainty, vulnerability and deception. In this paper, I propose to extend EGT in two ways to overcome the weakness. First, I introduce survival analysis modeling to describe the lifetime or fitness of game players. This extension allows more flexible and powerful modeling of the dynamic uncertainty and vulnerability (collectively equivalent to the dynamic frailty in survival analysis). Secondly, I introduce agreement algorithms, which can be the Agreement algorithms in distributed computing (e.g., Byzantine Generals Problem [6][8], Dynamic Hybrid Fault Models [12]) or any algorithms that set and enforce the rules for players to determine their consensus. The second extension is particularly useful for modeling dynamic deception (e.g., asymmetric faults in fault tolerance and deception in animal communication). From a computational perspective, the extended evolutionary game theory (EEGT) modeling, when implemented in simulation, is equivalent to an optimization methodology that is similar to evolutionary computing approaches such as Genetic algorithms with dynamic populations [15][17].

  4. An evolutionary computation based algorithm for calculating solar differential rotation by automatic tracking of coronal bright points

    Directory of Open Access Journals (Sweden)

    Shahamatnia Ehsan

    2016-01-01

    Full Text Available Developing specialized software tools is essential to support studies of solar activity evolution. With new space missions such as Solar Dynamics Observatory (SDO, solar images are being produced in unprecedented volumes. To capitalize on that huge data availability, the scientific community needs a new generation of software tools for automatic and efficient data processing. In this paper a prototype of a modular framework for solar feature detection, characterization, and tracking is presented. To develop an efficient system capable of automatic solar feature tracking and measuring, a hybrid approach combining specialized image processing, evolutionary optimization, and soft computing algorithms is being followed. The specialized hybrid algorithm for tracking solar features allows automatic feature tracking while gathering characterization details about the tracked features. The hybrid algorithm takes advantages of the snake model, a specialized image processing algorithm widely used in applications such as boundary delineation, image segmentation, and object tracking. Further, it exploits the flexibility and efficiency of Particle Swarm Optimization (PSO, a stochastic population based optimization algorithm. PSO has been used successfully in a wide range of applications including combinatorial optimization, control, clustering, robotics, scheduling, and image processing and video analysis applications. The proposed tool, denoted PSO-Snake model, was already successfully tested in other works for tracking sunspots and coronal bright points. In this work, we discuss the application of the PSO-Snake algorithm for calculating the sidereal rotational angular velocity of the solar corona. To validate the results we compare them with published manual results performed by an expert.

  5. Restart Operator Meta-heuristics for a Problem-Oriented Evolutionary Strategies Algorithm in Inverse Mathematical MISO Modelling Problem Solving

    Science.gov (United States)

    Ryzhikov, I. S.; Semenkin, E. S.

    2017-02-01

    This study is focused on solving an inverse mathematical modelling problem for dynamical systems based on observation data and control inputs. The mathematical model is being searched in the form of a linear differential equation, which determines the system with multiple inputs and a single output, and a vector of the initial point coordinates. The described problem is complex and multimodal and for this reason the proposed evolutionary-based optimization technique, which is oriented on a dynamical system identification problem, was applied. To improve its performance an algorithm restart operator was implemented.

  6. Capability of the Maximax&Maximin selection operator in the evolutionary algorithm for a nurse scheduling problem

    Science.gov (United States)

    Ramli, Razamin; Tein, Lim Huai

    2016-08-01

    A good work schedule can improve hospital operations by providing better coverage with appropriate staffing levels in managing nurse personnel. Hence, constructing the best nurse work schedule is the appropriate effort. In doing so, an improved selection operator in the Evolutionary Algorithm (EA) strategy for a nurse scheduling problem (NSP) is proposed. The smart and efficient scheduling procedures were considered. Computation of the performance of each potential solution or schedule was done through fitness evaluation. The best so far solution was obtained via special Maximax&Maximin (MM) parent selection operator embedded in the EA, which fulfilled all constraints considered in the NSP.

  7. Using Different Approaches to Approximate a Pareto Front for a Multiobjective Evolutionary Algorithm: Optimal Thinning Regimes for Eucalyptus fastigata

    Directory of Open Access Journals (Sweden)

    Oliver Chikumbo

    2012-01-01

    Full Text Available A stand-level, multiobjective evolutionary algorithm (MOEA for determining a set of efficient thinning regimes satisfying two objectives, that is, value production for sawlog harvesting and volume production for a pulpwood market, was successfully demonstrated for a Eucalyptus fastigata trial in Kaingaroa Forest, New Zealand. The MOEA approximated the set of efficient thinning regimes (with a discontinuous Pareto front by employing a ranking scheme developed by Fonseca and Fleming (1993, which was a Pareto-based ranking (a.k.a Multiobjective Genetic Algorithm—MOGA. In this paper we solve the same problem using an improved version of a fitness sharing Pareto ranking algorithm (a.k.a Nondominated Sorting Genetic Algorithm—NSGA II originally developed by Srinivas and Deb (1994 and examine the results. Our findings indicate that NSGA II approximates the entire Pareto front whereas MOGA only determines a subdomain of the Pareto points.

  8. Exploratory Analysis of an On-line Evolutionary Algorithm for in Simulated Robots

    NARCIS (Netherlands)

    Haasdijk, E.; Smit, S.K.; Eiben, A.E.

    2012-01-01

    In traditional evolutionary robotics, robot controllers are evolved in a separate design phase preceding actual deployment; we call this off-line evolution. Alternatively, robot controllers can evolve while the robots perform their proper tasks, during the actual operational phase; we call this on-l

  9. Multi-objective entropy evolutionary algorithm for marine oil spill detection using cosmo-skymed satellite data

    Directory of Open Access Journals (Sweden)

    M. Marghany

    2015-06-01

    Full Text Available Oil spill pollution has a substantial role in damaging the marine ecosystem. Oil spill that floats on top of water, as well as decreasing the fauna populations, affects the food chain in the ecosystem. In fact, oil spill is reducing the sunlight penetrates the water, limiting the photosynthesis of marine plants and phytoplankton. Moreover, marine mammals for instance, disclosed to oil spills their insulating capacities are reduced, and so making them more vulnerable to temperature variations and much less buoyant in the seawater. This study has demonstrated a design tool for oil spill detection in SAR satellite data using optimization of Entropy based Multi-Objective Evolutionary Algorithm (E-MMGA which based on Pareto optimal solutions. The study also shows that optimization entropy based Multi-Objective Evolutionary Algorithm provides an accurate pattern of oil slick in SAR data. This shown by 85 % for oil spill, 10 % look-alike and 5 % for sea roughness using the receiver-operational characteristics (ROC curve. The E-MMGA also shows excellent performance in SAR data. In conclusion, E-MMGA can be used as optimization for entropy to perform an automatic detection of oil spill in SAR satellite data.

  10. Analysis of Ant Colony Optimization and Population-Based Evolutionary Algorithms on Dynamic Problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei

    This thesis presents new running time analyses of nature-inspired algorithms on various dynamic problems. It aims to identify and analyse the features of algorithms and problem classes which allow efficient optimization to occur in the presence of dynamic behaviour. We consider the following...

  11. Multi-objective Evolutionary Algorithms for MILP and MINLP in Process Synthesis

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of σshare is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.

  12. MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS APPLIED TO MICROSTRIP ANTENNAS DESIGN ALGORITMOS EVOLUTIVOS MULTIOBJETIVO APLICADOS A LOS PROYECTOS DE ANTENAS MICROSTRIP

    Directory of Open Access Journals (Sweden)

    Juliano Rodrigues Brianeze

    2009-12-01

    Full Text Available This work presents three of the main evolutionary algorithms: Genetic Algorithm, Evolution Strategy and Evolutionary Programming, applied to microstrip antennas design. Efficiency tests were performed, considering the analysis of key physical and geometrical parameters, evolution type, numerical random generators effects, evolution operators and selection criteria. These algorithms were validated through design of microstrip antennas based on the Resonant Cavity Method, and allow multiobjective optimizations, considering bandwidth, standing wave ratio and relative material permittivity. The optimal results obtained with these optimization processes, were confirmed by CST Microwave Studio commercial package.Este trabajo presenta tres de los principales algoritmos evolutivos: Algoritmo Genético, Estrategia Evolutiva y Programación Evolutiva, aplicados al diseño de antenas de microlíneas (microstrip. Se realizaron pruebas de eficiencia de los algoritmos, considerando el análisis de los parámetros físicos y geométricos, tipo de evolución, efecto de generación de números aleatorios, operadores evolutivos y los criterios de selección. Estos algoritmos fueron validados a través del diseño de antenas de microlíneas basado en el Método de Cavidades Resonantes y permiten optimizaciones multiobjetivo, considerando ancho de banda, razón de onda estacionaria y permitividad relativa del dieléctrico. Los resultados óptimos obtenidos fueron confirmados a través del software comercial CST Microwave Studio.

  13. Comparison of Algorithms for Prediction of Protein Structural Features from Evolutionary Data.

    Science.gov (United States)

    Bywater, Robert P

    2016-01-01

    Proteins have many functions and predicting these is still one of the major challenges in theoretical biophysics and bioinformatics. Foremost amongst these functions is the need to fold correctly thereby allowing the other genetically dictated tasks that the protein has to carry out to proceed efficiently. In this work, some earlier algorithms for predicting protein domain folds are revisited and they are compared with more recently developed methods. In dealing with intractable problems such as fold prediction, when different algorithms show convergence onto the same result there is every reason to take all algorithms into account such that a consensus result can be arrived at. In this work it is shown that the application of different algorithms in protein structure prediction leads to results that do not converge as such but rather they collude in a striking and useful way that has never been considered before.

  14. A Novel Automatic Detection System for ECG Arrhythmias Using Maximum Margin Clustering with Immune Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Bohui Zhu

    2013-01-01

    Full Text Available This paper presents a novel maximum margin clustering method with immune evolution (IEMMC for automatic diagnosis of electrocardiogram (ECG arrhythmias. This diagnostic system consists of signal processing, feature extraction, and the IEMMC algorithm for clustering of ECG arrhythmias. First, raw ECG signal is processed by an adaptive ECG filter based on wavelet transforms, and waveform of the ECG signal is detected; then, features are extracted from ECG signal to cluster different types of arrhythmias by the IEMMC algorithm. Three types of performance evaluation indicators are used to assess the effect of the IEMMC method for ECG arrhythmias, such as sensitivity, specificity, and accuracy. Compared with K-means and iterSVR algorithms, the IEMMC algorithm reflects better performance not only in clustering result but also in terms of global search ability and convergence ability, which proves its effectiveness for the detection of ECG arrhythmias.

  15. An evolutionary algorithm for global optimization based on self-organizing maps

    Science.gov (United States)

    Barmada, Sami; Raugi, Marco; Tucci, Mauro

    2016-10-01

    In this article, a new population-based algorithm for real-parameter global optimization is presented, which is denoted as self-organizing centroids optimization (SOC-opt). The proposed method uses a stochastic approach which is based on the sequential learning paradigm for self-organizing maps (SOMs). A modified version of the SOM is proposed where each cell contains an individual, which performs a search for a locally optimal solution and it is affected by the search for a global optimum. The movement of the individuals in the search space is based on a discrete-time dynamic filter, and various choices of this filter are possible to obtain different dynamics of the centroids. In this way, a general framework is defined where well-known algorithms represent a particular case. The proposed algorithm is validated through a set of problems, which include non-separable problems, and compared with state-of-the-art algorithms for global optimization.

  16. Using Program Shaping and Algorithmic Skeletons to Parallelise an Evolutionary Multi-Agent System in Erlang

    OpenAIRE

    Adam D. Barwell; Christopher Brown; Kevin Hammond; Wojciech Turek; Aleksander Byrski

    2017-01-01

    This paper considers how to use program shaping and algorithmic skeletons to parallelise a multi-agent system that is written in Erlang. Program shaping is the process of transforming a program to better enable the introduction of parallelism. Whilst algorithmic skeletons abstract away the low-level aspects of parallel programming that often plague traditional techniques, it is not always easy to introduce them into an arbitrary program, especially one that has not been written with paralleli...

  17. Dynamic economic emission dispatch incorporating wind farms using modified co-evolutionary particle swarm optimization meta-heuristic algorithm

    Directory of Open Access Journals (Sweden)

    2015-03-01

    Full Text Available The dynamic economic load dispatch is one of the main problems of power systems generation and operation. The objective is to schedule power generation for units over a certain period of time, while satisfying operating constraints and load demand in each interval. Wind farms, as renewable energy resources are playing an increasing role in electricity generation. In this paper, a computational framework is presented to solve the dynamic economic emission dispatch problem with inclusion of wind farms considering their associated constraints. An optimization algorithm called modified co-evolutionary particle swarm optimization (MCPSO is proposed to solve the problem. In the proposed algorithm, two kinds of swarms evolve interactively where one of them is used to calculate the penalty factors (constraints handling and the other is used for searching good solutions (optimization process. In addition, some modifications such as using an inertia weight that decreases linearly during the simulation are made to improve the performance of the algorithm. Finally, the validity and superiority of the proposed method are demonstrated by simulation results on a modified IEEE benchmark system including six thermal units and two wind farms.

  18. A master-slave parallel hybrid multi-objective evolutionary algorithm for groundwater remediation design under general hydrogeological conditions

    Science.gov (United States)

    Wu, J.; Yang, Y.; Luo, Q.; Wu, J.

    2012-12-01

    This study presents a new hybrid multi-objective evolutionary algorithm, the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), whereby the global search ability of niched Pareto tabu search (NPTS) is improved by the diversification of candidate solutions arose from the evolving nondominated sorting genetic algorithm II (NSGA-II) population. Also, the NPTSGA coupled with the commonly used groundwater flow and transport codes, MODFLOW and MT3DMS, is developed for multi-objective optimal design of groundwater remediation systems. The proposed methodology is then applied to a large-scale field groundwater remediation system for cleanup of large trichloroethylene (TCE) plume at the Massachusetts Military Reservation (MMR) in Cape Cod, Massachusetts. Furthermore, a master-slave (MS) parallelization scheme based on the Message Passing Interface (MPI) is incorporated into the NPTSGA to implement objective function evaluations in distributed processor environment, which can greatly improve the efficiency of the NPTSGA in finding Pareto-optimal solutions to the real-world application. This study shows that the MS parallel NPTSGA in comparison with the original NPTS and NSGA-II can balance the tradeoff between diversity and optimality of solutions during the search process and is an efficient and effective tool for optimizing the multi-objective design of groundwater remediation systems under complicated hydrogeologic conditions.

  19. High Performance Scheduling in Parallel Heterogeneous Multiprocessor Systems Using Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Mohammad Sadeq Garshasbi

    2013-10-01

    Full Text Available Scheduling is the process of improving the performance of a parallel and distributed system. Parallel systems are part of distributed systems. Parallel systems refers to the concept of run parallel jobs that can be run simultaneously on several processors. Load balancing and scheduling are very important and complex problems in multiprocessor systems. So that problems are an NP-Complete problems. In this paper, we introduce a method based on genetic algorithms for scheduling and laod balancing in parallel heterogeneous multi-processor systems. The results of the simulations indicate Genetic algorithm for scheduling at in systems is better than LPT, SPT and FIFO. Simualation results indicate Genetic Algorithm reduce total response time and also it increase utilization.

  20. An Evolutionary Approach to Drug-Design Using a Novel Neighbourhood Based Genetic Algorithm

    CERN Document Server

    Ghosh, Arnab; Chowdhury, Arkabandhu; Konar, Amit

    2012-01-01

    The present work provides a new approach to evolve ligand structures which represent possible drug to be docked to the active site of the target protein. The structure is represented as a tree where each non-empty node represents a functional group. It is assumed that the active site configuration of the target protein is known with position of the essential residues. In this paper the interaction energy of the ligands with the protein target is minimized. Moreover, the size of the tree is difficult to obtain and it will be different for different active sites. To overcome the difficulty, a variable tree size configuration is used for designing ligands. The optimization is done using a novel Neighbourhood Based Genetic Algorithm (NBGA) which uses dynamic neighbourhood topology. To get variable tree size, a variable-length version of the above algorithm is devised. To judge the merit of the algorithm, it is initially applied on the well known Travelling Salesman Problem (TSP).

  1. Effectively Tackling Reinsurance Problems by Using Evolutionary and Swarm Intelligence Algorithms

    Directory of Open Access Journals (Sweden)

    Sancho Salcedo-Sanz

    2014-04-01

    Full Text Available This paper is focused on solving different hard optimization problems that arise in the field of insurance and, more specifically, in reinsurance problems. In this area, the complexity of the models and assumptions considered in the definition of the reinsurance rules and conditions produces hard black-box optimization problems (problems in which the objective function does not have an algebraic expression, but it is the output of a system (usually a computer program, which must be solved in order to obtain the optimal output of the reinsurance. The application of traditional optimization approaches is not possible in this kind of mathematical problem, so new computational paradigms must be applied to solve these problems. In this paper, we show the performance of two evolutionary and swarm intelligence techniques (evolutionary programming and particle swarm optimization. We provide an analysis in three black-box optimization problems in reinsurance, where the proposed approaches exhibit an excellent behavior, finding the optimal solution within a fraction of the computational cost used by inspection or enumeration methods.

  2. Multi-objective thermodynamic optimization of an irreversible regenerative Brayton cycle using evolutionary algorithm and decision making

    Directory of Open Access Journals (Sweden)

    Rajesh Kumar

    2016-06-01

    Full Text Available Brayton heat engine model is developed in MATLAB simulink environment and thermodynamic optimization based on finite time thermodynamic analysis along with multiple criteria is implemented. The proposed work investigates optimal values of various decision variables that simultaneously optimize power output, thermal efficiency and ecological function using evolutionary algorithm based on NSGA-II. Pareto optimal frontier between triple and dual objectives is obtained and best optimal value is selected using Fuzzy, TOPSIS, LINMAP and Shannon’s entropy decision making methods. Triple objective evolutionary approach applied to the proposed model gives power output, thermal efficiency, ecological function as (53.89 kW, 0.1611, −142 kW which are 29.78%, 25.86% and 21.13% lower in comparison with reversible system. Furthermore, the present study reflects the effect of various heat capacitance rates and component efficiencies on triple objectives in graphical custom. Finally, with the aim of error investigation, average and maximum errors of obtained results are computed.

  3. Synergetic Optimization of Missile Shapes for Aerodynamic and Radar Cross-Section Performance Based on Multi- objective Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    刘洪

    2004-01-01

    A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set using interactive preference articulation. There are two objective functions, to maximize ratio of lift to drag and to minimize radar cross-section (RCS) value. 3D computational electromagnetic solver was used to evaluate RCS, electromagnetic performance. 3D Navier-Stokes flow solver was adopted to evaluate aerodynamic performance. A flight mechanics solver was used to analyze the stability of the missile. Based on the MOEA, a synergetic optimization of missile shapes for aerodynamic and radar cross-section performance is completed. The results show that the proposed approach can be used in more complex optimization case of flight vehicles.

  4. Artificial Neural Networks, and Evolutionary Algorithms as a systems biology approach to a data-base on fetal growth restriction.

    Science.gov (United States)

    Street, Maria E; Buscema, Massimo; Smerieri, Arianna; Montanini, Luisa; Grossi, Enzo

    2013-12-01

    One of the specific aims of systems biology is to model and discover properties of cells, tissues and organisms functioning. A systems biology approach was undertaken to investigate possibly the entire system of intra-uterine growth we had available, to assess the variables of interest, discriminate those which were effectively related with appropriate or restricted intrauterine growth, and achieve an understanding of the systems in these two conditions. The Artificial Adaptive Systems, which include Artificial Neural Networks and Evolutionary Algorithms lead us to the first analyses. These analyses identified the importance of the biochemical variables IL-6, IGF-II and IGFBP-2 protein concentrations in placental lysates, and offered a new insight into placental markers of fetal growth within the IGF and cytokine systems, confirmed they had relationships and offered a critical assessment of studies previously performed.

  5. Evolving model-free scattering matrix via evolutionary algorithm: $^{16}$O-$^{16}$O elastic scattering at 350 MeV

    CERN Document Server

    Korda, V Y; Korda, L P

    2005-01-01

    We present a new procedure which enables to extract a scattering matrix $S(l)$ as a complex function of angular momentum directly from the scattering data, without any a priori model assumptions implied. The key ingredient of the procedure is the evolutionary algorithm with diffused mutation which evolves the population of the scattering matrices, via their smooth deformations, from the primary arbitrary analytical $S(l)$ shapes to the final ones giving high quality fits to the data. Due to the automatic monitoring of the scattering matrix derivatives, the final $S(l)$ shapes are monotonic and do not have any distortions. For the $^{16}$O-$^{16}$O elastic scattering data at 350 MeV, we show the independence of the final results of the primary $S(l)$ shapes. Contrary to the other approaches, our procedure provides an excellent fit by the $S(l)$ shapes which support the ``rainbow'' interpretation of the data under analysis.

  6. THE CONCEPT OF USING EVOLUTIONARY ALGORITHMS AS TOOLS FOR OPTIMAL PLANNING OF MULTIMODAL COMPOSITION IN THE DIDACTIC TEXTS

    Directory of Open Access Journals (Sweden)

    Marek A. Jakubowski

    2014-11-01

    Full Text Available At the beginning we would like to provide a short description of the new theory of learning in the digital age called connectivism. It is the integration of principles explored by the following theories: chaos, network, complexity and self-organization. Next, we describe in short new visual solutions for the teaching of writing so called multimodal literacy 5–11. We define and describe the following notions: multimodal text and original theory so called NOS (non-optimum systems methodology as a basis for new methods of visual solutions at the classes and audiovisual texts applications. Especially, we would like to emphasize the tremendous usefulness of evolutionary algorithms VEGA and NSGA as tools for optimal planning of multimodal composition in teaching texts. Finally, we give some examples of didactic texts for classrooms, which provide a deep insight into learning skills and tasks needed in the Internet age.

  7. Models for Evolutionary Algorithms and Their Applications in System Identification and Control Optimization

    DEFF Research Database (Denmark)

    Ursem, Rasmus Kjær

    optimization. In addition to general investigations in these areas, I introduce a number of algorithms and demonstrate their potential on real-world problems in system identification and control. Furthermore, I investigate dynamic optimization problems in the context of the three fundamental areas as well...

  8. On the Potential Use of Evolutionary Algorithms for Electro-Optic System Design

    Science.gov (United States)

    2011-03-25

    optima. This probability is decreased according to a “cooling schedule” over the course of the optimization, which allows the algorithm to eventually...Using Snell’s Law, the angle of the ray relative to the surface normal and ultimately the y-axis can be determined. Using basic trigonometry , we extract

  9. On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Lehre, Per Kristian; Yao, Xin

    2012-01-01

    selection mechanism. The analysis focuses on how the balance between parameter $\\eta$, controlling the selection pressure in linear ranking, and parameter $\\chi$ controlling the bit-wise mutation rate, impacts the runtime of the algorithm. The results point out situations where a correct balance between...

  10. Detection of cancerous masses in mammograms by template matching: optimization of template brightness distribution by means of evolutionary algorithm.

    Science.gov (United States)

    Bator, Marcin; Nieniewski, Mariusz

    2012-02-01

    Optimization of brightness distribution in the template used for detection of cancerous masses in mammograms by means of correlation coefficient is presented. This optimization is performed by the evolutionary algorithm using an auxiliary mass classifier. Brightness along the radius of the circularly symmetric template is coded indirectly by its second derivative. The fitness function is defined as the area under curve (AUC) of the receiver operating characteristic (ROC) for the mass classifier. The ROC and AUC are obtained for a teaching set of regions of interest (ROIs), for which it is known whether a ROI is true-positive (TP) or false-positive (F). The teaching set is obtained by running the mass detector using a template with a predetermined brightness. Subsequently, the evolutionary algorithm optimizes the template by classifying masses in the teaching set. The optimal template (OT) can be used for detection of masses in mammograms with unknown ROIs. The approach was tested on the training and testing sets of the Digital Database for Screening Mammography (DDSM). The free-response receiver operating characteristic (FROC) obtained with the new mass detector seems superior to the FROC for the hemispherical template (HT). Exemplary results are the following: in the case of the training set in the DDSM, the true-positive fraction (TPF) = 0.82 for the OT and 0.79 for the HT; in the case of the testing set, TPF = 0.79 for the OT and 0.72 for the HT. These values were obtained for disease cases, and the false-positive per image (FPI) = 2.

  11. Evaluating the epsilon-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions.

    Science.gov (United States)

    Deb, Kalyanmoy; Mohan, Manikanth; Mishra, Shikhar

    2005-01-01

    Since the suggestion of a computing procedure of multiple Pareto-optimal solutions in multi-objective optimization problems in the early Nineties, researchers have been on the look out for a procedure which is computationally fast and simultaneously capable of finding a well-converged and well-distributed set of solutions. Most multi-objective evolutionary algorithms (MOEAs) developed in the past decade are either good for achieving a well-distributed solutions at the expense of a large computational effort or computationally fast at the expense of achieving a not-so-good distribution of solutions. For example, although the Strength Pareto Evolutionary Algorithm or SPEA (Zitzler and Thiele, 1999) produces a much better distribution compared to the elitist non-dominated sorting GA or NSGA-II (Deb et al., 2002a), the computational time needed to run SPEA is much greater. In this paper, we evaluate a recently-proposed steady-state MOEA (Deb et al., 2003) which was developed based on the epsilon-dominance concept introduced earlier(Laumanns et al., 2002) and using efficient parent and archive update strategies for achieving a well-distributed and well-converged set of solutions quickly. Based on an extensive comparative study with four other state-of-the-art MOEAs on a number of two, three, and four objective test problems, it is observed that the steady-state MOEA is a good compromise in terms of convergence near to the Pareto-optimal front, diversity of solutions, and computational time. Moreover, the epsilon-MOEA is a step closer towards making MOEAs pragmatic, particularly allowing a decision-maker to control the achievable accuracy in the obtained Pareto-optimal solutions.

  12. A New Evolutionary Algorithm for Global Optimization Embedded in the Mind Evolutionary Computation%一种嵌入思维进化的新的进化算法

    Institute of Scientific and Technical Information of China (English)

    杜金玲; 刘大莲; 李奇会

    2012-01-01

    对于运筹学问题学中的函数优化问题,本文提出一种嵌入思维进化的新的进化算法,将思维进化计算(Mind Evolutionary Computation,MEC)的“趋同”和“异化”操作加入到进化算法中,充分利用其特有记忆机制、定向机制和探测与开采功能之间的协调机制的好性能,并加入K-meams聚类算法,保证群体多样性.最后,数值模拟验证了新算法的有效性.%A new evolutionary algorithm for global optimization embe dded in the mind evolutionary computation for optimal problem in operational reserch is offered in this paper. Operations of similartaxis and dissimilation of mind evolutionary computation join in with the EC to make the best of the good quality of the evolutionary directionality mechanism, memory mechanism and harmony mechanism between exploitation and exploration. Also, K-meams clustering algorithm is used to ensure the diversity of the population. At last, the numerical results also show that the new approach is efficient.

  13. An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

    Researchers have faced numerous challenges while designing WSNs and protocols in many applications such as object tracking in military, detection of disastrous events, environment and health monitoring etc. Amongst all sustaining connectivity and capitalizing on the network lifetime is a serious...... deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... change dynamically. In this paper, the authors put forward an Evolutionary Mobility aware multi-objective hybrid Routing Protocol for heterogeneous wireless sensor networks (EMRP). EMRP uses two-level hierarchical clustering. EMRP selects the optimal path from source to sink using multiple metrics...

  14. COMPARATIVE ANALYSIS OF EV-MOGA AND GODLIKE MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS FOR RISK BASED OPTIMAL POWER SCHEDULING OF A VIRTUAL POWER PLANT

    Directory of Open Access Journals (Sweden)

    Mahesh S. Narkhede

    2015-01-01

    Full Text Available An attempt has been made in this article to compare the performances of two multiobjective evolutionary algorithms namely ev-MOGA and GODLIKE. The performances of both are evaluated on risk based optimal power scheduling of virtual power plant. The risk based scheduling is proposed as a conflicting bi objective optimization problem with increased number of durations of day. Both the algorithms are elaborated in detail. Results based on the performance analysis are depicted at the end.

  15. Fractional order Darwinian particle swarm optimization applications and evaluation of an evolutionary algorithm

    CERN Document Server

    Couceiro, Micael

    2015-01-01

    This book examines the bottom-up applicability of swarm intelligence to solving multiple problems, such as curve fitting, image segmentation, and swarm robotics. It compares the capabilities of some of the better-known bio-inspired optimization approaches, especially Particle Swarm Optimization (PSO), Darwinian Particle Swarm Optimization (DPSO) and the recently proposed Fractional Order Darwinian Particle Swarm Optimization (FODPSO), and comprehensively discusses their advantages and disadvantages. Further, it demonstrates the superiority and key advantages of using the FODPSO algorithm, suc

  16. A FAST AND ELITIST BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR SCHEDULING INDEPENDENT TASKS ON HETEROGENEOUS SYSTEMS

    Directory of Open Access Journals (Sweden)

    G.Subashini

    2010-07-01

    Full Text Available To meet the increasing computational demands, geographically distributed resources need to be logically coupled to make them work as a unified resource. In analyzing the performance of such distributed heterogeneous computing systems scheduling a set of tasks to the available set of resources for execution is highly important. Task scheduling being an NP-complete problem, use of metaheuristics is more appropriate in obtaining optimal solutions. Schedules thus obtained can be evaluated using several criteria that may conflict with one another which require multi objective problem formulation. This paper investigates the application of an elitist Nondominated Sorting Genetic Algorithm (NSGA-II, to efficiently schedule a set of independent tasks in a heterogeneous distributed computing system. The objectives considered in this paper include minimizing makespan and average flowtime simultaneously. The implementation of NSGA-II algorithm and Weighted-Sum Genetic Algorithm (WSGA has been tested on benchmark instances for distributed heterogeneous systems. As NSGA-II generates a set of Pareto optimal solutions, to verify the effectiveness of NSGA-II over WSGA a fuzzy based membership value assignment method is employed to choose the best compromise solution from the obtained Pareto solution set.

  17. Performance Analysis of Transfer function Based Active Noise Cancellation Method Using Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Prof. Vikas Gupta

    2014-01-01

    Full Text Available Due to the exponential increase of noise pollution, the demand for noise controlling system is also increases. Basically two types of techniques are used for noise cancellation active and passive. But passive techniques are inactive for low frequency noise, hence there is an increasing demand of research and developmental work on active noise cancellation techniques. In this paper we introduce a new method in the active noise cancellation system. This new method is the transfer function based method which used Genetic and Particle swarm optimization (PSO algorithm for noise cancellation. This method is very simple and efficient for low frequency noise cancellation. Here we analysis the performance of this method in the presence of white Gaussian noise and compare the results of Particle swarm optimization (PSO and Genetic algorithm. Both algorithms are suitable for different environment, so we observe their performance in different fields. In this paper a comparative study of Genetic and Particle swarm optimization (PSO is described with proper results. It will go in depth what exactly transfer function method, how it work and advantages over neural network based method

  18. Classification of heavy metal ions present in multi-frequency multi-electrode potable water data using evolutionary algorithm

    Science.gov (United States)

    Karkra, Rashmi; Kumar, Prashant; Bansod, Baban K. S.; Bagchi, Sudeshna; Sharma, Pooja; Krishna, C. Rama

    2016-12-01

    Access to potable water for the common people is one of the most challenging tasks in the present era. Contamination of drinking water has become a serious problem due to various anthropogenic and geogenic events. The paper demonstrates the application of evolutionary algorithms, viz., particle swan optimization and genetic algorithm to 24 water samples containing eight different heavy metal ions (Cd, Cu, Co, Pb, Zn, Ar, Cr and Ni) for the optimal estimation of electrode and frequency to classify the heavy metal ions. The work has been carried out on multi-variate data, viz., single electrode multi-frequency, single frequency multi-electrode and multi-frequency multi-electrode water samples. The electrodes used are platinum, gold, silver nanoparticles and glassy carbon electrodes. Various hazardous metal ions present in the water samples have been optimally classified and validated by the application of Davis Bouldin index. Such studies are useful in the segregation of hazardous heavy metal ions found in water resources, thereby quantifying the degree of water quality.

  19. Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

    Directory of Open Access Journals (Sweden)

    E. Osaba

    2014-01-01

    Full Text Available Since their first formulation, genetic algorithms (GAs have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.

  20. Crossover versus mutation: a comparative analysis of the evolutionary strategy of genetic algorithms applied to combinatorial optimization problems.

    Science.gov (United States)

    Osaba, E; Carballedo, R; Diaz, F; Onieva, E; de la Iglesia, I; Perallos, A

    2014-01-01

    Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.

  1. Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

    Science.gov (United States)

    Osaba, E.; Carballedo, R.; Diaz, F.; Onieva, E.; de la Iglesia, I.; Perallos, A.

    2014-01-01

    Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test. PMID:25165731

  2. Electronic design automation of analog ICs combining gradient models with multi-objective evolutionary algorithms

    CERN Document Server

    Rocha, Frederico AE; Lourenço, Nuno CC; Horta, Nuno CG

    2013-01-01

    This book applies to the scientific area of electronic design automation (EDA) and addresses the automatic sizing of analog integrated circuits (ICs). Particularly, this book presents an approach to enhance a state-of-the-art layout-aware circuit-level optimizer (GENOM-POF), by embedding statistical knowledge from an automatically generated gradient model into the multi-objective multi-constraint optimization kernel based on the NSGA-II algorithm. The results showed allow the designer to explore the different trade-offs of the solution space, both through the achieved device sizes, or the resp

  3. Confronting Decision Cliffs: Diagnostic Assessment of Multi-Objective Evolutionary Algorithms' Performance for Addressing Uncertain Environmental Thresholds

    Science.gov (United States)

    Ward, V. L.; Singh, R.; Reed, P. M.; Keller, K.

    2014-12-01

    As water resources problems typically involve several stakeholders with conflicting objectives, multi-objective evolutionary algorithms (MOEAs) are now key tools for understanding management tradeoffs. Given the growing complexity of water planning problems, it is important to establish if an algorithm can consistently perform well on a given class of problems. This knowledge allows the decision analyst to focus on eliciting and evaluating appropriate problem formulations. This study proposes a multi-objective adaptation of the classic environmental economics "Lake Problem" as a computationally simple but mathematically challenging MOEA benchmarking problem. The lake problem abstracts a fictional town on a lake which hopes to maximize its economic benefit without degrading the lake's water quality to a eutrophic (polluted) state through excessive phosphorus loading. The problem poses the challenge of maintaining economic activity while confronting the uncertainty of potentially crossing a nonlinear and potentially irreversible pollution threshold beyond which the lake is eutrophic. Objectives for optimization are maximizing economic benefit from lake pollution, maximizing water quality, maximizing the reliability of remaining below the environmental threshold, and minimizing the probability that the town will have to drastically change pollution policies in any given year. The multi-objective formulation incorporates uncertainty with a stochastic phosphorus inflow abstracting non-point source pollution. We performed comprehensive diagnostics using 6 algorithms: Borg, MOEAD, eMOEA, eNSGAII, GDE3, and NSGAII to ascertain their controllability, reliability, efficiency, and effectiveness. The lake problem abstracts elements of many current water resources and climate related management applications where there is the potential for crossing irreversible, nonlinear thresholds. We show that many modern MOEAs can fail on this test problem, indicating its suitability as a

  4. Optimal Management Of Renewable-Based Mgs An Intelligent Approach Through The Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Mehdi Nafar

    2015-08-01

    Full Text Available Abstract- This article proposes a probabilistic frame built on Scenario fabrication to considerate the uncertainties in the finest action managing of Micro Grids MGs. The MG contains different recoverable energy resources such as Wind Turbine WT Micro Turbine MT Photovoltaic PV Fuel Cell FC and one battery as the storing device. The advised frame is based on scenario generation and Roulette wheel mechanism to produce different circumstances for handling the uncertainties of altered factors. It habits typical spreading role as a probability scattering function of random factors. The uncertainties which are measured in this paper are grid bid alterations cargo request calculating error and PV and WT yield power productions. It is well-intentioned to asset that solving the MG difficult for 24 hours of a day by considering diverse uncertainties and different constraints needs one powerful optimization method that can converge fast when it doesnt fall in local optimal topic. Simultaneously single Group Search Optimization GSO system is presented to vision the total search space globally. The GSO algorithm is instigated from group active of beasts. Also the GSO procedure one change is similarly planned for this algorithm. The planned context and way is applied o one test grid-connected MG as a typical grid.

  5. Optimized smart grid energy procurement for LTE networks using evolutionary algorithms

    KAUST Repository

    Ghazzai, Hakim

    2014-11-01

    Energy efficiency aspects in cellular networks can contribute significantly to reducing worldwide greenhouse gas emissions. The base station (BS) sleeping strategy has become a well-known technique to achieve energy savings by switching off redundant BSs mainly for lightly loaded networks. Moreover, introducing renewable energy as an alternative power source has become a real challenge among network operators. In this paper, we formulate an optimization problem that aims to maximize the profit of Long-Term Evolution (LTE) cellular operators and to simultaneously minimize the CO2 emissions in green wireless cellular networks without affecting the desired quality of service (QoS). The BS sleeping strategy lends itself to an interesting implementation using several heuristic approaches, such as the genetic (GA) and particle swarm optimization (PSO) algorithms. In this paper, we propose GA-based and PSO-based methods that reduce the energy consumption of BSs by not only shutting down underutilized BSs but by optimizing the amounts of energy procured from different retailers (renewable energy and electricity retailers), as well. A comparison with another previously proposed algorithm is also carried out to evaluate the performance and the computational complexity of the employed methods.

  6. P-RnaPredict--a parallel evolutionary algorithm for RNA folding: effects of pseudorandom number quality.

    Science.gov (United States)

    Wiese, Kay C; Hendriks, Andrew; Deschênes, Alain; Ben Youssef, Belgacem

    2005-09-01

    This paper presents a fully parallel version of RnaPredict, a genetic algorithm (GA) for RNA secondary structure prediction. The research presented here builds on previous work and examines the impact of three different pseudorandom number generators (PRNGs) on the GA's performance. The three generators tested are the C standard library PRNG RAND, a parallelized multiplicative congruential generator (MCG), and a parallelized Mersenne Twister (MT). A fully parallel version of RnaPredict using the Message Passing Interface (MPI) was implemented on a 128-node Beowulf cluster. The PRNG comparison tests were performed with known structures whose sequences are 118, 122, 468, 543, and 556 nucleotides in length. The effects of the PRNGs are investigated and the predicted structures are compared to known structures. Results indicate that P-RnaPredict demonstrated good prediction accuracy, particularly so for shorter sequences.

  7. Application of an iterative method and an evolutionary algorithm in fuzzy optimization

    Directory of Open Access Journals (Sweden)

    Ricardo Coelho Silva

    2012-08-01

    Full Text Available This work develops two approaches based on the fuzzy set theory to solve a class of fuzzy mathematical optimization problems with uncertainties in the objective function and in the set of constraints. The first approach is an adaptation of an iterative method that obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. The second one is a metaheuristic approach that adapts a standard genetic algorithm to use fuzzy numbers. Both approaches use a decision criterion called satisfaction level that reaches the best solution in the uncertain environment. Selected examples from the literature are presented to compare and to validate the efficiency of the methods addressed, emphasizing the fuzzy optimization problem in some import-export companies in the south of Spain.

  8. Application of Evolutionary Algorithms and Statistical Analysis in the Numerical Optimization of an Axial Compressor

    Directory of Open Access Journals (Sweden)

    Clarich Alberto

    2005-01-01

    Full Text Available The purpose of this work is to optimize the stator shape of an axial compressor, in order to maximize the global efficiency of the machine, fixing the rotor shape. We have used a 3D parametric mesh and the CFX-Tascflow code for the flow simulation. To find out the most important variables in this problem, we have run a preliminary series of designs, whose results have been analyzed by a statistic tool. This analysis has helped us to choose the most appropriate variables and their ranges in order to implement the optimization algorithm more efficiently and rapidly. For the simulation of the fluid flow through the machine, we have used a cluster of 12 processors.

  9. 基于进化算法的一类作业车间调度%A Class of Job Shop Scheduling Based on the Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    何霆; 刘文煌; 梁力平

    2001-01-01

    At first, a new Hybrid evolutionary algorithm has been proposed based on analyzing several typical search algorithms. Finally some practical examples of simulation results show that the algorithm has good validity and potential to practical application.%在分析比较几种典型搜索算法的基础上,提出了一种新的混合进化算法。最后, 通过具体的算例验证了该算法的有效性。

  10. Optimal Design of TS Fuzzy Control System Based on DNA Evolutionary Algorithm%采用DNA进化算法优化设计TS模糊控制器

    Institute of Scientific and Technical Information of China (English)

    翁妙凤

    2003-01-01

    The DNA evolutionary algorithm(DNA-EA)and the DNA genetic algorithm(DNA-GA)based on a new DNA encoding method are propsed based on the structure and the genetic mechanism of biological DNA. The DNA-EA and the DNA-GA are applied into the optimal design of TS fuzzy control system. The simulation results show the effectiveness of the two DNA algorithms, excellent self-learning capability. However, the DNA-EA is superior to the DNA-GA in the simulation performance.

  11. A Novel Quantum Evolutionary Algorithm and Its Application Research%一种新型量子演化算法及其应用研究

    Institute of Scientific and Technical Information of China (English)

    曹斯彤; 陈贤富

    2012-01-01

    针对传统演化算法难以模拟量子物理特性的难题,提出一种新型量子演化算法模型.采用将进化算法与量子计算相结合的方法,在常规染色体结构上附加随机干涉,从数理角度模拟量子计算的叠态、纠缠等特性.将其应用于解决多维背包问题,实验结果表明,该算法能增加种群的基因多样性,并提高全局优化能力.%Aiming at the problem that the quantum physical characteristics are hard to simulate for traditional evolutionary algorithm, a novel quantum evolutionary algorithm is proposed in this paper. Quantum computation is combined with evolutionary algorithm, and random interference is added to the routine chromosome. So the characteristics of the superposition, entanglement of quantum computation is simulated from mathematical aspect. The algorithm is applied to solve Multidimensional Knapsack Problem(MKP), and experimental results show that, the genetic diversity of the population is increased, the capability of global optimization is improved, and the effectiveness of the algorithm is Verified.

  12. Fruit image segmentation based on evolutionary algorithm%基于演化算法的水果图像分割

    Institute of Scientific and Technical Information of China (English)

    彭红星; 邹湘军; 陈琰; 杨磊; 熊俊涛; 陈燕

    2014-01-01

    An improved evolutionary algorithm based on queen mating combined with elite and truncated choices by stages was proposed for fruit image segmentation, which was appropriate for the demand of the picking robot for real-time image and adaptive processing algorithms. The 8 bit binary code was used to correspond with the gray value of the fruit image in the improved evolutionary algorithm. The number of the initial population was set to 12 in the phase of the population initialized and the corresponding individual values, which ranged between 0 and 255, were generated by the random function. The twelve random numbers were the initial values of the evolutionary algorithm. Then an improved Otsu algorithm formula was selected as the fitness function. In the selection phase, the iterative process was divided into before stage, middle stage, and after stage, which were respectively used by queen mating algorithm, elitist choices strategy, and truncated choices strategy to select the fitness value. In the first stage, the individuals were produced by a random function and then the best individual (queen) of the evolutionary algorithm was hybridized with the rest of the individuals (including the randomly generated individuals) to generate new individuals. Finally, the individuals with the smallest fitness values were replaced by the new individuals. In the second stage, the elitist choices strategy was used and the individual with the smallest fitness value in the current generation was replaced by the individual with the highest fitness value in the previous generation. In the third stage, the truncated choices strategy was used and the last half of the individuals with the smallest fitness value in the current generation was replaced by the same number of individuals with the highest fitness value in the previous generation. This not only ensures the diversity of the population, but also overcomes the disadvantage of local optimized and too fast a convergence of the

  13. Convergence analysis of evolutionary algorithms that are based on the paradigm of information geometry.

    Science.gov (United States)

    Beyer, Hans-Georg

    2014-01-01

    The convergence behaviors of so-called natural evolution strategies (NES) and of the information-geometric optimization (IGO) approach are considered. After a review of the NES/IGO ideas, which are based on information geometry, the implications of this philosophy w.r.t. optimization dynamics are investigated considering the optimization performance on the class of positive quadratic objective functions (the ellipsoid model). Exact differential equations describing the approach to the optimizer are derived and solved. It is rigorously shown that the original NES philosophy optimizing the expected value of the objective functions leads to very slow (i.e., sublinear) convergence toward the optimizer. This is the real reason why state of the art implementations of IGO algorithms optimize the expected value of transformed objective functions, for example, by utility functions based on ranking. It is shown that these utility functions are localized fitness functions that change during the IGO flow. The governing differential equations describing this flow are derived. In the case of convergence, the solutions to these equations exhibit an exponentially fast approach to the optimizer (i.e., linear convergence order). Furthermore, it is proven that the IGO philosophy leads to an adaptation of the covariance matrix that equals in the asymptotic limit-up to a scalar factor-the inverse of the Hessian of the objective function considered.

  14. The Evolutionary Algorithm to Find Robust Pareto-Optimal Solutions over Time

    Directory of Open Access Journals (Sweden)

    Meirong Chen

    2015-01-01

    Full Text Available In dynamic multiobjective optimization problems, the environmental parameters change over time, which makes the true pareto fronts shifted. So far, most works of research on dynamic multiobjective optimization methods have concentrated on detecting the changed environment and triggering the population based optimization methods so as to track the moving pareto fronts over time. Yet, in many real-world applications, it is not necessary to find the optimal nondominant solutions in each dynamic environment. To solve this weakness, a novel method called robust pareto-optimal solution over time is proposed. It is in fact to replace the optimal pareto front at each time-varying moment with the series of robust pareto-optimal solutions. This means that each robust solution can fit for more than one time-varying moment. Two metrics, including the average survival time and average robust generational distance, are present to measure the robustness of the robust pareto solution set. Another contribution is to construct the algorithm framework searching for robust pareto-optimal solutions over time based on the survival time. Experimental results indicate that this definition is a more practical and time-saving method of addressing dynamic multiobjective optimization problems changing over time.

  15. Application of an Evolutionary Algorithm for Parameter Optimization in a Gully Erosion Model

    Energy Technology Data Exchange (ETDEWEB)

    Rengers, Francis; Lunacek, Monte; Tucker, Gregory

    2016-06-01

    Herein we demonstrate how to use model optimization to determine a set of best-fit parameters for a landform model simulating gully incision and headcut retreat. To achieve this result we employed the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), an iterative process in which samples are created based on a distribution of parameter values that evolve over time to better fit an objective function. CMA-ES efficiently finds optimal parameters, even with high-dimensional objective functions that are non-convex, multimodal, and non-separable. We ran model instances in parallel on a high-performance cluster, and from hundreds of model runs we obtained the best parameter choices. This method is far superior to brute-force search algorithms, and has great potential for many applications in earth science modeling. We found that parameters representing boundary conditions tended to converge toward an optimal single value, whereas parameters controlling geomorphic processes are defined by a range of optimal values.

  16. Design Parameters Analysis of Point Absorber WEC via an evolutionary-algorithm-based Dimensioning Tool

    Directory of Open Access Journals (Sweden)

    Marcos Blanco

    2015-10-01

    Full Text Available Wave energy conversion has an essential difference from other renewable energies since the dependence between the devices design and the energy resource is stronger. Dimensioning is therefore considered a key stage when a design project of Wave Energy Converters (WEC is undertaken. Location, WEC concept, Power Take-Off (PTO type, control strategy and hydrodynamic resonance considerations are some of the critical aspects to take into account to achieve a good performance. The paper proposes an automatic dimensioning methodology to be accomplished at the initial design project stages and the following elements are described to carry out the study: an optimization design algorithm, its objective functions and restrictions, a PTO model, as well as a procedure to evaluate the WEC energy production. After that, a parametric analysis is included considering different combinations of the key parameters previously introduced. A variety of study cases are analysed from the point of view of energy production for different design-parameters and all of them are compared with a reference case. Finally, a discussion is presented based on the results obtained, and some recommendations to face the WEC design stage are given.

  17. Multi-objective optimization of a low specific speed centrifugal pump using an evolutionary algorithm

    Science.gov (United States)

    An, Zhao; Zhounian, Lai; Peng, Wu; Linlin, Cao; Dazhuan, Wu

    2016-07-01

    This paper describes the shape optimization of a low specific speed centrifugal pump at the design point. The target pump has already been manually modified on the basis of empirical knowledge. A genetic algorithm (NSGA-II) with certain enhancements is adopted to improve its performance further with respect to two goals. In order to limit the number of design variables without losing geometric information, the impeller is parametrized using the Bézier curve and a B-spline. Numerical simulation based on a Reynolds averaged Navier-Stokes (RANS) turbulent model is done in parallel to evaluate the flow field. A back-propagating neural network is constructed as a surrogate for performance prediction to save computing time, while initial samples are selected according to an orthogonal array. Then global Pareto-optimal solutions are obtained and analysed. The results manifest that unexpected flow structures, such as the secondary flow on the meridian plane, have diminished or vanished in the optimized pump.

  18. AN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS MOBILE NETWORKS

    Directory of Open Access Journals (Sweden)

    Yee Shin Chia

    2012-12-01

    Full Text Available The channel assignment problem in wireless mobile network is the assignment of appropriate frequency spectrum to incoming calls while maintaining a satisfactory level of electromagnetic compatibility (EMC constraints. An effective channel assignment strategy is important due to the limited capacity of frequency spectrum in wireless mobile network. Most of the existing channel assignment strategies are based on deterministic methods. In this paper, an adaptive genetic algorithm (GA based channel assignment strategy is introduced for resource management and to reduce the effect of EMC interferences. The most significant advantage of the proposed optimization method is its capability to handle both the reassignment of channels for existing calls as well as the allocation of channel to a new incoming call in an adaptive process to maximize the utility of the limited resources. It is capable to adapt the population size to the number of eligible channels for a particular cell upon new call arrivals to achieve reasonable convergence speed. The MATLAB simulation on a 49-cells network model for both uniform and nonuniform call traffic distributions showed that the proposed channel optimization method can always achieve a lower average new incoming call blocking probability compared to the deterministic based channel assignment strategy.

  19. Evolutionary Information Theory

    Directory of Open Access Journals (Sweden)

    Mark Burgin

    2013-04-01

    Full Text Available Evolutionary information theory is a constructive approach that studies information in the context of evolutionary processes, which are ubiquitous in nature and society. In this paper, we develop foundations of evolutionary information theory, building several measures of evolutionary information and obtaining their properties. These measures are based on mathematical models of evolutionary computations, machines and automata. To measure evolutionary information in an invariant form, we construct and study universal evolutionary machines and automata, which form the base for evolutionary information theory. The first class of measures introduced and studied in this paper is evolutionary information size of symbolic objects relative to classes of automata or machines. In particular, it is proved that there is an invariant and optimal evolutionary information size relative to different classes of evolutionary machines. As a rule, different classes of algorithms or automata determine different information size for the same object. The more powerful classes of algorithms or automata decrease the information size of an object in comparison with the information size of an object relative to weaker4 classes of algorithms or machines. The second class of measures for evolutionary information in symbolic objects is studied by introduction of the quantity of evolutionary information about symbolic objects relative to a class of automata or machines. To give an example of applications, we briefly describe a possibility of modeling physical evolution with evolutionary machines to demonstrate applicability of evolutionary information theory to all material processes. At the end of the paper, directions for future research are suggested.

  20. Inclusion of the fitness sharing technique in an evolutionary algorithm to analyze the fitness landscape of the genetic code adaptability.

    Science.gov (United States)

    Santos, José; Monteagudo, Ángel

    2017-03-27

    The canonical code, although prevailing in complex genomes, is not universal. It was shown the canonical genetic code superior robustness compared to random codes, but it is not clearly determined how it evolved towards its current form. The error minimization theory considers the minimization of point mutation adverse effect as the main selection factor in the evolution of the code. We have used simulated evolution in a computer to search for optimized codes, which helps to obtain information about the optimization level of the canonical code in its evolution. A genetic algorithm searches for efficient codes in a fitness landscape that corresponds with the adaptability of possible hypothetical genetic codes. The lower the effects of errors or mutations in the codon bases of a hypothetical code, the more efficient or optimal is that code. The inclusion of the fitness sharing technique in the evolutionary algorithm allows the extent to which the canonical genetic code is in an area corresponding to a deep local minimum to be easily determined, even in the high dimensional spaces considered. The analyses show that the canonical code is not in a deep local minimum and that the fitness landscape is not a multimodal fitness landscape with deep and separated peaks. Moreover, the canonical code is clearly far away from the areas of higher fitness in the landscape. Given the non-presence of deep local minima in the landscape, although the code could evolve and different forces could shape its structure, the fitness landscape nature considered in the error minimization theory does not explain why the canonical code ended its evolution in a location which is not an area of a localized deep minimum of the huge fitness landscape.

  1. 基于进化MCMC的DBN学习算法%DBN Learning Algorithm Based on Evolutionary MCMC

    Institute of Scientific and Technical Information of China (English)

    郭鹏; 李乃祥; 刘同海

    2011-01-01

    Dynamic Bayesian Network(DBN) learning with evolutionary MCMC algorithm is presented.Parameter learning with absent data is done with EM algorithm.In structure learning, multiple Bayesian network chromosomes are generated as candidates and are processed with mutation and crossover.The structures are learned with MCMC function which is obtained with temperatures and Bayesian Information Criterion(BIC) scores of corresponding Bayesian networks.In each generation, the Bayesian network with the maximal BIC score is selected as the result of the stracture learning.Experimental results proves the stability of the method's performance.%提出利用进化MCMC算法进行动态贝叶斯网络(DBN)学习的方法.在数据缺省情况下利用EM算法进行贝叶斯网络参数学习,结构学习部分生成多条备选的贝叶斯网络染色体,对染色体进行变异操作和交叉操作,在遗传操作中根据温度参数和贝叶斯网络及贝叶斯信息准则来构造MCMC函数,并利用MCMC函数进行贝叶斯网络学习.每一代进化后,将贝叶斯信息评分最大的贝叶斯网络作为结构学习的结果.实验结果验证了该方法性能的稳定性.

  2. A Two-Phase Multiobjective Evolutionary Algorithm for Enhancing the Robustness of Scale-Free Networks Against Multiple Malicious Attacks.

    Science.gov (United States)

    Zhou, Mingxing; Liu, Jing

    2017-02-01

    Designing robust networks has attracted increasing attentions in recent years. Most existing work focuses on improving the robustness of networks against a specific type of attacks. However, networks which are robust against one type of attacks may not be robust against another type of attacks. In the real-world situations, different types of attacks may happen simultaneously. Therefore, we use the Pearson's correlation coefficient to analyze the correlation between different types of attacks, model the robustness measures against different types of attacks which are negatively correlated as objectives, and model the problem of optimizing the robustness of networks against multiple malicious attacks as a multiobjective optimization problem. Furthermore, to effectively solve this problem, we propose a two-phase multiobjective evolutionary algorithm, labeled as MOEA-RSFMMA. In MOEA-RSFMMA, a single-objective sampling phase is first used to generate a good initial population for the later two-objective optimization phase. Such a two-phase optimizing pattern well balances the computational cost of the two objectives and improves the search efficiency. In the experiments, both synthetic scale-free networks and real-world networks are used to validate the performance of MOEA-RSFMMA. Moreover, both local and global characteristics of networks in different parts of the obtained Pareto fronts are studied. The results show that the networks in different parts of Pareto fronts reflect different properties, and provide various choices for decision makers.

  3. Annual Energy Production (AEP) optimization for tidal power plants based on Evolutionary Algorithms - Swansea Bay Tidal Power Plant AEP optimization

    Science.gov (United States)

    Kontoleontos, E.; Weissenberger, S.

    2016-11-01

    In order to be able to predict the maximum Annual Energy Production (AEP) for tidal power plants, an advanced AEP optimization procedure is required for solving the optimization problem which consists of a high number of design variables and constraints. This efficient AEP optimization procedure requires an advanced optimization tool (EASY software) and an AEP calculation tool that can simulate all different operating modes of the units (bidirectional turbine, pump and sluicing mode). The EASY optimization software is a metamodel-assisted Evolutionary Algorithm (MAEA) that can be used in both single- and multi-objective optimization problems. The AEP calculation tool, developed by ANDRITZ HYDRO, in combination with EASY is used to maximize the tidal annual energy produced by optimizing the plant operation throughout the year. For the Swansea Bay Tidal Power Plant project, the AEP optimization along with the hydraulic design optimization and the model testing was used to evaluate all different hydraulic and operating concepts and define the optimal concept that led to a significant increase of the AEP value. This new concept of a triple regulated “bi-directional bulb pump turbine” for Swansea Bay Tidal Power Plant (16 units, nominal power above 320 MW) along with its AEP optimization scheme will be presented in detail in the paper. Furthermore, the use of an online AEP optimization during operation of the power plant, that will provide the optimal operating points to the control system, will be also presented.

  4. A simple methodology for characterization of germanium coaxial detectors by using Monte Carlo simulation and evolutionary algorithms.

    Science.gov (United States)

    Guerra, J G; Rubiano, J G; Winter, G; Guerra, A G; Alonso, H; Arnedo, M A; Tejera, A; Gil, J M; Rodríguez, R; Martel, P; Bolivar, J P

    2015-11-01

    The determination in a sample of the activity concentration of a specific radionuclide by gamma spectrometry needs to know the full energy peak efficiency (FEPE) for the energy of interest. The difficulties related to the experimental calibration make it advisable to have alternative methods for FEPE determination, such as the simulation of the transport of photons in the crystal by the Monte Carlo method, which requires an accurate knowledge of the characteristics and geometry of the detector. The characterization process is mainly carried out by Canberra Industries Inc. using proprietary techniques and methodologies developed by that company. It is a costly procedure (due to shipping and to the cost of the process itself) and for some research laboratories an alternative in situ procedure can be very useful. The main goal of this paper is to find an alternative to this costly characterization process, by establishing a method for optimizing the parameters of characterizing the detector, through a computational procedure which could be reproduced at a standard research lab. This method consists in the determination of the detector geometric parameters by using Monte Carlo simulation in parallel with an optimization process, based on evolutionary algorithms, starting from a set of reference FEPEs determined experimentally or computationally. The proposed method has proven to be effective and simple to implement. It provides a set of characterization parameters which it has been successfully validated for different source-detector geometries, and also for a wide range of environmental samples and certified materials.

  5. A Study of Evolutionary Algorithm Selection Hyper-Heuristics for the One-Dimensional Bin-Packing Problem

    Directory of Open Access Journals (Sweden)

    Nelishia Pillay

    2012-06-01

    Full Text Available Hyper-heuristics are aimed at providing a generalized solution to optimization problems rather than producing the best result for one or more problem instances. This paper examines the use of evolutionary algorithm (EA selection hyper-heuristics to solve the offline one-dimensional bin-packing problem. Two EA hyper-heuristics are evaluated. The first (EA-HH1 searches a heuristic space of combinations of low-level construction heuristics for bin selection. The second (EA-HH2 explores a space of combinations of both item selection and bin selection heuristic combinations. These EA hyper-heuristics use tournament selection to choose parents, and mutation and crossover with hill-climbing to create the offspring of each generation. The performance of the hyper-heuristics is compared to that of each of the low-level heuristics applied independently to solve this problem. Furthermore, the performance of both hyper-heuristics is also compared. The comparisons revealed that hyper-heuristics in general perform better than any single low-level construction heuristic in solving the problem. In addition to this it was found that the hyper-heuristic exploring a space of both item selection and bin selection heuristic combinations is more effective than the hyper-heuristic searching a space of just bin selection heuristic combinations. The performance of this hyper-heuristic was found to be comparable to other methods applied to the same benchmark sets of problems.

  6. Optimizing the Structure of Distribution Smart Grids with Renewable Generation against Abnormal Conditions: A Complex Networks Approach with Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Lucas Cuadra

    2017-07-01

    Full Text Available In this work, we describe an approach that allows for optimizing the structure of a smart grid (SG with renewable energy (RE generation against abnormal conditions (imbalances between generation and consumption, overloads or failures arising from the inherent SG complexity by combining the complex network (CN and evolutionary algorithm (EA concepts. We propose a novel objective function (to be minimized that combines cost elements, related to the number of electric cables, and several metrics that quantify properties that are beneficial for SGs (energy exchange at the local scale and high robustness and resilience. The optimized SG structure is obtained by applying an EA in which the chromosome that encodes each potential network (or individual is the upper triangular matrix of its adjacency matrix. This allows for fully tailoring the crossover and mutation operators. We also propose a domain-specific initial population that includes both small-world and random networks, helping the EA converge quickly. The experimental work points out that the proposed method works well and generates the optimum, synthetic, small-world structure that leads to beneficial properties such as improving both the local energy exchange and the robustness. The optimum structure fulfills a balance between moderate cost and robustness against abnormal conditions. Our approach should be considered as an analysis, planning and decision-making tool to gain insight into smart grid structures so that the low level detailed design is carried out by using electrical engineering techniques.

  7. Application of Multi-Objective Evolutionary Algorithm for Optimal Reactive Power Dispatch with Flexible AC Transmission System Devices

    Directory of Open Access Journals (Sweden)

    Abdarrazak OUALI

    2011-12-01

    Full Text Available Because their capability to change the network parameters with a rapid response and enhanced flexibility, flexible AC transmission system (FACTS devices have taken more attention in power systems operations as improvement of voltage profile and minimizing system losses. In this way, this paper presents a multi-objective evolutionary algorithm (MOEA to solve optimal reactive power dispatch (ORPD problem with FACTS devices. This nonlinear multi-objective problem (MOP consists to minimize simultaneously real power loss in transmission lines and voltage deviation at load buses, by tuning parameters and searching the location of FACTS devices. The constraints of this MOP are divided to equality constraints represented by load flow equations and inequality constraints such as, generation reactive power sources and security limits at load buses. Two types of FACTS devices, static synchronous series compensator (SSSC and unified power flow controller (UPFC are considered. A comparative study regarding the effects of an SSSC and an UPFC on voltage deviation and total transmission real losses is carried out. The design problem is tested on a 6-bus system.

  8. Application of On-Board Evolutionary Algorithms to Underwater Robots to Optimally Replan Missions with Energy Constraints

    Directory of Open Access Journals (Sweden)

    M. L. Seto

    2012-01-01

    Full Text Available The objective is to show that on-board mission replanning for an AUV sensor coverage mission, based on available energy, enhances mission success. Autonomous underwater vehicles (AUVs are tasked to increasingly long deployments, consequently energy management issues are timely and relevant. Energy shortages can occur if the AUV unexpectedly travels against stronger currents, is not trimmed for the local water salinity has to get back on course, and so forth. An on-board knowledge-based agent, based on a genetic algorithm, was designed and validated to replan a near-optimal AUV survey mission. It considers the measured AUV energy consumption, attitudes, speed over ground, and known response to proposed missions through on-line dynamics and control predictions. For the case studied, the replanned mission improves the survey area coverage by a factor of 2 for an energy budget, that is, a factor of 2 less than planned. The contribution is a novel on-board cognitive capability in the form of an agent that monitors the energy and intelligently replans missions based on energy considerations with evolutionary methods.

  9. Do Search and Selection Operators Play Important Roles in Multi-Objective Evolutionary Algorithms:A Case Study

    Institute of Scientific and Technical Information of China (English)

    Yan Zhen-yu; Kang Li-shan; Lin Guang-ming; He Mei

    2003-01-01

    Multi objective Evolutionary Algorithm (MOEA) is be coming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probabili ty 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.

  10. Implementation of strength pareto evolutionary algorithm II in the multiobjective burnable poison placement optimization of KWU pressurized water reactor

    Energy Technology Data Exchange (ETDEWEB)

    Gharari, Rahman [Nuclear Science and Technology Research Institute (NSTRI), Tehran (Iran, Islamic Republic of); Poursalehi, Navid; Abbasi, Mohmmadreza; Aghale, Mahdi [Nuclear Engineering Dept, Shahid Beheshti University, Tehran (Iran, Islamic Republic of)

    2016-10-15

    In this research, for the first time, a new optimization method, i.e., strength Pareto evolutionary algorithm II (SPEA-II), is developed for the burnable poison placement (BPP) optimization of a nuclear reactor core. In the BPP problem, an optimized placement map of fuel assemblies with burnable poison is searched for a given core loading pattern according to defined objectives. In this work, SPEA-II coupled with a nodal expansion code is used for solving the BPP problem of Kraftwerk Union AG (KWU) pressurized water reactor. Our optimization goal for the BPP is to achieve a greater multiplication factor (K-e-f-f) for gaining possible longer operation cycles along with more flattening of fuel assembly relative power distribution, considering a safety constraint on the radial power peaking factor. For appraising the proposed methodology, the basic approach, i.e., SPEA, is also developed in order to compare obtained results. In general, results reveal the acceptance performance and high strength of SPEA, particularly its new version, i.e., SPEA-II, in achieving a semioptimized loading pattern for the BPP optimization of KWU pressurized water reactor.

  11. From prompt gamma distribution to dose: a novel approach combining an evolutionary algorithm and filtering based on Gaussian-powerlaw convolutions

    Science.gov (United States)

    Schumann, A.; Priegnitz, M.; Schoene, S.; Enghardt, W.; Rohling, H.; Fiedler, F.

    2016-10-01

    Range verification and dose monitoring in proton therapy is considered as highly desirable. Different methods have been developed worldwide, like particle therapy positron emission tomography (PT-PET) and prompt gamma imaging (PGI). In general, these methods allow for a verification of the proton range. However, quantification of the dose from these measurements remains challenging. For the first time, we present an approach for estimating the dose from prompt γ-ray emission profiles. It combines a filtering procedure based on Gaussian-powerlaw convolution with an evolutionary algorithm. By means of convolving depth dose profiles with an appropriate filter kernel, prompt γ-ray depth profiles are obtained. In order to reverse this step, the evolutionary algorithm is applied. The feasibility of this approach is demonstrated for a spread-out Bragg-peak in a water target.

  12. 基于混合杂交与间歇变异的约束优化演化算法%A Constrained Evolutionary Algorithm Based on Hybrid Crossovers and Intermittent Mutation

    Institute of Scientific and Technical Information of China (English)

    周永华; 毛宗源

    2003-01-01

    In solving constrained optimization problems with genetic algorithms, more emphases are laid on handling constraints than increasing the search capability of algorithms, which often leed to unsatisfied results as reported inmost literatures. This paper proposes a new evolutionary algorithm for constrained optimization, emphasizing moreon increasing the search capability of the algorithm by means of hybrid crossovers and intermittent mutation while adopting a simple constraint handling technique called direct comparison. Numerical experiments and comparisons show the ettectiveness of the proposed algorithm.

  13. 基于进化计算的产品推荐算法%Product recommendation algorithm based on evolutionary computation

    Institute of Scientific and Technical Information of China (English)

    魏臻; 韦振

    2015-01-01

    To reduce the consumer choice cost in the online shopping and improve sales of businesses ,a product recommendation algorithm based on evolutionary computation was designed .First ,the algo-rithm built a user interests model on the basis of user operation logs and user data analysis .Then an evolutionary model was built based on the user interests model .The evolutionary model not only re-tained the product property that the user was interested in ,but also detected the user interests in the potential .Finally ,related products could be recommended to users by recommendations set generated from evolutionary model .Theoretical analysis and experimental data show that compared with exist-ing recommendation algorithm ,the proposed algorithm recommends products with higher reliability to users .%为降低消费者在网络购物过程中的选择代价、提高商家的销售业绩 ,文章设计了一种基于进化计算的产品推荐算法.该算法在对用户操作日志和用户资料分析的基础上构建用户兴趣模型 ,并在该模型基础上构建了进化模型 ,进化模型既可以对用户感兴趣的产品属性进行保留 ,又可以对用户潜在的兴趣进行探测 ,通过进化模型产生的推荐集对用户进行相关产品的推荐.分析结果表明 ,与已有的推荐算法相比 ,该算法向用户推荐的产品具有较高的可靠性.

  14. Wind Farm Layout Optimization through a Crossover-Elitist Evolutionary Algorithm performed over a High Performing Analytical Wake Model

    Science.gov (United States)

    Kirchner-Bossi, Nicolas; Porté-Agel, Fernando

    2017-04-01

    Wind turbine wakes can significantly disrupt the performance of further downstream turbines in a wind farm, thus seriously limiting the overall wind farm power output. Such effect makes the layout design of a wind farm to play a crucial role on the whole performance of the project. An accurate definition of the wake interactions added to a computationally compromised layout optimization strategy can result in an efficient resource when addressing the problem. This work presents a novel soft-computing approach to optimize the wind farm layout by minimizing the overall wake effects that the installed turbines exert on one another. An evolutionary algorithm with an elitist sub-optimization crossover routine and an unconstrained (continuous) turbine positioning set up is developed and tested over an 80-turbine offshore wind farm over the North Sea off Denmark (Horns Rev I). Within every generation of the evolution, the wind power output (cost function) is computed through a recently developed and validated analytical wake model with a Gaussian profile velocity deficit [1], which has shown to outperform the traditionally employed wake models through different LES simulations and wind tunnel experiments. Two schemes with slightly different perimeter constraint conditions (full or partial) are tested. Results show, compared to the baseline, gridded layout, a wind power output increase between 5.5% and 7.7%. In addition, it is observed that the electric cable length at the facilities is reduced by up to 21%. [1] Bastankhah, Majid, and Fernando Porté-Agel. "A new analytical model for wind-turbine wakes." Renewable Energy 70 (2014): 116-123.

  15. Optimization of binary sequences based on evolutionary algorithm%基于进化计算的二元序列优化算法研究

    Institute of Scientific and Technical Information of China (English)

    李鹤; 李琦; 高军萍; 雷明然

    2014-01-01

    具有良好非周期自相关特性二元序列在通信同步、雷达等领域具有广泛的应用。通过对遗传算法、粒子群算法与量子粒子群算法三种进化算法进行对比分析,设计了具有良好非周期自相关特性的二元序列的搜索算法。研究结果表明,粒子群算法的搜索能力优于遗传算法,而量子粒子群算法具有参数少,易于控制的优点,取得了较好的优化结果。%Binary sequences with good aperiodic autocorrelation features are widely used in the field of radar, communication synchronization. Genetic algorithm, particle swarm optimization and quantum particle swarm optimization algorithm are compared and analyzed in this paper. The new search algorithm of binary sequences with good aperiodic autocorrelation properties are designed based on three evolutionary algorithms. Research results show that the search ability of particle swarm algorithm is better than genetic algorithm. Quantum particle swarm optimization algorithm has less parameters, easy to control, and the better good optimization results were obtained.

  16. Part E: Evolutionary Computation

    DEFF Research Database (Denmark)

    2015-01-01

    of Computational Intelligence. First, comprehensive surveys of genetic algorithms, genetic programming, evolution strategies, parallel evolutionary algorithms are presented, which are readable and constructive so that a large audience might find them useful and – to some extent – ready to use. Some more general...... topics like the estimation of distribution algorithms, indicator-based selection, etc., are also discussed. An important problem, from a theoretical and practical point of view, of learning classifier systems is presented in depth. Multiobjective evolutionary algorithms, which constitute one of the most...... evolutionary algorithms, such as memetic algorithms, which have emerged as a very promising tool for solving many real-world problems in a multitude of areas of science and technology. Moreover, parallel evolutionary combinatorial optimization has been presented. Search operators, which are crucial in all...

  17. A novel model-based evolutionary algorithm for multi-objective deformable image registration with content mismatch and large deformations: benchmarking efficiency and quality

    Science.gov (United States)

    Bouter, Anton; Alderliesten, Tanja; Bosman, Peter A. N.

    2017-02-01

    Taking a multi-objective optimization approach to deformable image registration has recently gained attention, because such an approach removes the requirement of manually tuning the weights of all the involved objectives. Especially for problems that require large complex deformations, this is a non-trivial task. From the resulting Pareto set of solutions one can then much more insightfully select a registration outcome that is most suitable for the problem at hand. To serve as an internal optimization engine, currently used multi-objective algorithms are competent, but rather inefficient. In this paper we largely improve upon this by introducing a multi-objective real-valued adaptation of the recently introduced Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) for discrete optimization. In this work, GOMEA is tailored specifically to the problem of deformable image registration to obtain substantially improved efficiency. This improvement is achieved by exploiting a key strength of GOMEA: iteratively improving small parts of solutions, allowing to faster exploit the impact of such updates on the objectives at hand through partial evaluations. We performed experiments on three registration problems. In particular, an artificial problem containing a disappearing structure, a pair of pre- and post-operative breast CT scans, and a pair of breast MRI scans acquired in prone and supine position were considered. Results show that compared to the previously used evolutionary algorithm, GOMEA obtains a speed-up of up to a factor of 1600 on the tested registration problems while achieving registration outcomes of similar quality.

  18. Knowledge Evolutionary Algorithm Based on Paradigm Shift%基于范式转换的知识进化算法

    Institute of Scientific and Technical Information of China (English)

    李雪; 崔颖安; 崔杜武; 陶永芹

    2012-01-01

    Based on Kuhn's evolutionary epistemology idea, this paper proposes a knowledge evolutionary algorithm based on paradigm shift. The paradigm is according to the solution, and an initial knowledge base is formed. The next work is to inherit excellent knowledge individuals by inheritance operator, produce novel knowledge individuals by innovation operator, eliminate the crisis of paradigm by update operator, and accordingly realize knowledge evolution. The optimal solution of issues can be gained from the optimal knowledge individual. Experiments are taken on optimization of functions. Compared with genetic algorithm, the proposed algorithm can search the global optimal solution with less population and faster speed.%根据库恩的知识进化观,提出一种基于范式转换的知识进化算法.每个范式对应一个问题的可行解,以范式为单位建立初始知识库.利用传承算子实现对优秀范式的传承,采用修补算子实现范式危机的消除,以创新算子产生新范式,从知识库的最优范式中获取问题的最优解.将该算法应用于求解函数极小值,其结果与遗传算法相比具有更好的寻优性能.

  19. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.

    Science.gov (United States)

    Guturu, Parthasarathy; Dantu, Ram

    2008-06-01

    Many graph- and set-theoretic problems, because of their tremendous application potential and theoretical appeal, have been well investigated by the researchers in complexity theory and were found to be NP-hard. Since the combinatorial complexity of these problems does not permit exhaustive searches for optimal solutions, only near-optimal solutions can be explored using either various problem-specific heuristic strategies or metaheuristic global-optimization methods, such as simulated annealing, genetic algorithms, etc. In this paper, we propose a unified evolutionary algorithm (EA) to the problems of maximum clique finding, maximum independent set, minimum vertex cover, subgraph and double subgraph isomorphism, set packing, set partitioning, and set cover. In the proposed approach, we first map these problems onto the maximum clique-finding problem (MCP), which is later solved using an evolutionary strategy. The proposed impatient EA with probabilistic tabu search (IEA-PTS) for the MCP integrates the best features of earlier successful approaches with a number of new heuristics that we developed to yield a performance that advances the state of the art in EAs for the exploration of the maximum cliques in a graph. Results of experimentation with the 37 DIMACS benchmark graphs and comparative analyses with six state-of-the-art algorithms, including two from the smaller EA community and four from the larger metaheuristics community, indicate that the IEA-PTS outperforms the EAs with respect to a Pareto-lexicographic ranking criterion and offers competitive performance on some graph instances when individually compared to the other heuristic algorithms. It has also successfully set a new benchmark on one graph instance. On another benchmark suite called Benchmarks with Hidden Optimal Solutions, IEA-PTS ranks second, after a very recent algorithm called COVER, among its peers that have experimented with this suite.

  20. Evolutionary K-means algorithm based on global splitting operator%基于全局性分裂算子的进化K-means算法

    Institute of Scientific and Technical Information of China (English)

    王留正; 何振峰

    2012-01-01

    进化算法可以有效地克服K-means对初始聚类中心敏感的缺陷,提高了聚类性能.在进化K-means聚类算法(F-EAC)的基础上,针对其变异操作——簇分裂算子的随机性与局部性,提出了两个全局性分裂算子.结合最大最小距离的思想,利用待分裂簇的周边簇信息来指导簇分裂初始点的选择,使簇的分裂更有利于全局划分,以进一步提高进化聚类的有效性.实验结果表明,基于全局性分裂算子的算法在类数发现及聚类精度方面均优于F-EAC.%Evolutionary Algorithm (EA) can effectively overcome the drawback that K-means is sensitive to the initial clustering centers, thus enhancing the clustering performance. On the basis of evolutionary K-means clustering algorithm ( F-EAC), considering the randomness and locality in the splitting operator as a mutation operation, two improved splitting operators with global information ( global splitting operator) were proposed. The idea of max-min distance and the information of peripheral clusters were used to guide the selection of the initial splitting centers, in order to make splitting process more beneficial to global partition, furthermore, to improve the efficiency of the evolutionary clustering. The experimental results show that the improved algorithms based on global splitting operator outperform F-EAC in terms of cluster's number discovering and clustering accuracy.

  1. The Design of Recommender Systems Algorithm Based on Evolutionary Computation%基于进化计算理论的推荐系统算法设计

    Institute of Scientific and Technical Information of China (English)

    樊鸿

    2014-01-01

    Based on the theoretical analysis and recommendation system evolution, this paper has proposed a multi-objective op-timization idea and an evolutionary multi-objective optimization based recommendation algorithm is proposed. This algorithm si-multaneously considers the recommendation precision and novelty, it not only preserves precision but also recommend new items to user, it makes effort to obtain the tradeoff between these two objectives. This paper presents the design of algorithms and algo-rithmic thinking processes, and tests the algorithm with simulation data.%该文在分析推荐系统和进化计算理论的基础上,提出一种多目标优化思路,给出一种基于进化多目标优化的推荐系统算法。该算法同时考虑推荐的精确度和推荐的新颖度,既要保证精确率又要尽可能地推荐新的物品给用户,算法力求在两者之间得到一种平衡。该文给出算法的设计思想和算法流程,并对算法进行了模拟数据的测试。

  2. CCS Site Optimization by Applying a Multi-objective Evolutionary Algorithm to Semi-Analytical Leakage Models

    Science.gov (United States)

    Cody, B. M.; Gonzalez-Nicolas, A.; Bau, D. A.

    2011-12-01

    Carbon capture and storage (CCS) has been proposed as a method of reducing global carbon dioxide (CO2) emissions. Although CCS has the potential to greatly retard greenhouse gas loading to the atmosphere while cleaner, more sustainable energy solutions are developed, there is a possibility that sequestered CO2 may leak and intrude into and adversely affect groundwater resources. It has been reported [1] that, while CO2 intrusion typically does not directly threaten underground drinking water resources, it may cause secondary effects, such as the mobilization of hazardous inorganic constituents present in aquifer minerals and changes in pH values. These risks must be fully understood and minimized before CCS project implementation. Combined management of project resources and leakage risk is crucial for the implementation of CCS. In this work, we present a method of: (a) minimizing the total CCS cost, the summation of major project costs with the cost associated with CO2 leakage; and (b) maximizing the mass of injected CO2, for a given proposed sequestration site. Optimization decision variables include the number of CO2 injection wells, injection rates, and injection well locations. The capital and operational costs of injection wells are directly related to injection well depth, location, injection flow rate, and injection duration. The cost of leakage is directly related to the mass of CO2 leaked through weak areas, such as abandoned oil wells, in the cap rock layers overlying the injected formation. Additional constraints on fluid overpressure caused by CO2 injection are imposed to maintain predefined effective stress levels that prevent cap rock fracturing. Here, both mass leakage and fluid overpressure are estimated using two semi-analytical models based upon work by [2,3]. A multi-objective evolutionary algorithm coupled with these semi-analytical leakage flow models is used to determine Pareto-optimal trade-off sets giving minimum total cost vs. maximum mass

  3. Solving advanced multi-objective robust designs by means of multiple objective evolutionary algorithms (MOEA): A reliability application

    Energy Technology Data Exchange (ETDEWEB)

    Salazar A, Daniel E. [Division de Computacion Evolutiva (CEANI), Instituto de Sistemas Inteligentes y Aplicaciones Numericas en Ingenieria (IUSIANI), Universidad de Las Palmas de Gran Canaria. Canary Islands (Spain)]. E-mail: danielsalazaraponte@gmail.com; Rocco S, Claudio M. [Universidad Central de Venezuela, Facultad de Ingenieria, Caracas (Venezuela)]. E-mail: crocco@reacciun.ve

    2007-06-15

    This paper extends the approach proposed by the second author in [Rocco et al. Robust design using a hybrid-cellular-evolutionary and interval-arithmetic approach: a reliability application. In: Tarantola S, Saltelli A, editors. SAMO 2001: Methodological advances and useful applications of sensitivity analysis. Reliab Eng Syst Saf 2003;79(2):149-59 [special issue

  4. A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem

    Indian Academy of Sciences (India)

    V K MANUPATI; G RAJYALAKSHMI; FELIX T S CHAN; J J THAKKAR

    2017-03-01

    This paper addresses a fuzzy mixed-integer non-linear programming (FMINLP) model by considering machine-dependent and job-sequence-dependent set-up times that minimize the total completion time,the number of tardy jobs, the total flow time and the machine load variation in the context of unrelated parallel machine scheduling (UPMS) problem. The above-mentioned multi-objectives were considered based on nonzero ready times, machine- and sequence-dependent set-up times and secondary resource constraints for jobs.The proposed approach considers unrelated parallel machines with inherent uncertainty in processing times and due dates. Since the problem is shown to be NP-hard in nature, it is a challenging task to find the optimal/nearoptimal solutions for conflicting objectives simultaneously in a reasonable time. Therefore, we introduced a new multi-objective-based evolutionary artificial immune non-dominated sorting genetic algorithm (AI-NSGA-II) to resolve the above-mentioned complex problem. The performance of the proposed multi-objective AI-NSGA-II algorithm has been compared to that of multi-objective particle swarm optimization (MOPSO) and conventionalnon-dominated sorting genetic algorithm (CNSGA-II), and it is found that the proposed multi-objective-based hybrid meta-heuristic produces high-quality solutions. Finally, the results obtained from benchmark instances and randomly generated instances as test problems evince the robust performance of the proposed multiobjective algorithm.

  5. A new evolutionary algorithm with LQV learning for combinatorial problems optimization; Um novo algoritmo evolucionario com aprendizado LVQ na otimizacao de problemas combinatorios

    Energy Technology Data Exchange (ETDEWEB)

    Machado, Marcelo Dornellas; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear

    2000-07-01

    Genetic algorithms are biologically motivated adaptive systems which have been used, with good results, for combinatorial problems optimization. In this work, a new learning mode, to be used by the population-based incremental learning algorithm, has the aim to build a new evolutionary algorithm to be used in optimization of numerical problems and combinatorial problems. This new learning mode uses a variable learning rate during the optimization process, constituting a process known as proportional reward. The development of this new algorithm aims its application in the optimization of reload problem of PWR nuclear reactors, in order to increase the useful life of the nuclear fuel. For the test, two classes of problems are used: numerical problems and combinatorial problems. Due to the fact that the reload problem is a combinatorial problem, the major interest relies on the last class. The results achieved with the tests indicate the applicability of the new learning mode, showing its potential as a developing tool in the solution of reload problem. (author)

  6. 重用抗体优良片断的免疫进化算法%Immune Evolutionary Algorithm Reusing Excellent Genes of Antibody

    Institute of Scientific and Technical Information of China (English)

    杨观赐; 马鑫; 李少波; 钟勇; 于丽娅

    2012-01-01

    By expounding the ideological origin of improving the clonal selection algorithm through the analysis of the specific phenomenon,the method to extract excellent gene schema to fill a memory pool from antibody set,to package excellent gene segment,and to replace low affinity antibody with high affinity antibody with probability from mutation antibody population during updating memory antibody population was designed based on clonal selection principle and algorithm,and then an improved clonal selection algorithm reusing excellent gene segment was put forward.Refering to the framework of strength Pareto evolutionary algorithm,the immune evolutionary algorithm reusing excellent genes of antibody(RG-IEM) was proposed,which implements the genetic operation such as selection,crossover and recombinant by applying the improved clonal selection algorithm.Taking a series of multi-objective 0/1 knapsack problems to check RG-IEA's performance,the results show that RG-IEA is capable of maintaining the diversity of population and obtaining solutions approximating to Pareto front.%基于克隆选择原理与算法,通过分析具体现象阐述了改进克隆选择算法的思想来源,设计了挖掘抗体中优秀决定基因并生成记忆集、封装优秀决定基片段、用变异抗体群中亲和度高的抗体按概率替换记忆抗体群中低亲和度抗体的方法,获得了重用抗体优良片断的克隆选择算法.借鉴强度Pareto进化算法的进化框架,提出了重用抗体优良片断的免疫进化算法.该算法通过克隆选择替代选择、交叉、重组等遗传操作.在一组0/1背包问题上的测试结果表明,所提出的算法可以有效保持种群多样性,获得较高质量的Pareto非劣解集.

  7. Optimization of IC Separation Based on Isocratic-to-Gradient Retention Modeling in Combination with Sequential Searching or Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Šime Ukić

    2013-01-01

    Full Text Available Gradient ion chromatography was used for the separation of eight sugars: arabitol, cellobiose, fructose, fucose, lactulose, melibiose, N-acetyl-D-glucosamine, and raffinose. The separation method was optimized using a combination of simplex or genetic algorithm with the isocratic-to-gradient retention modeling. Both the simplex and genetic algorithms provided well separated chromatograms in a similar analysis time. However, the simplex methodology showed severe drawbacks when dealing with local minima. Thus the genetic algorithm methodology proved as a method of choice for gradient optimization in this case. All the calculated/predicted chromatograms were compared with the real sample data, showing more than a satisfactory agreement.

  8. A hybrid evolutionary algorithm for multi-objective anatomy-based dose optimization in high-dose-rate brachytherapy.

    Science.gov (United States)

    Lahanas, M; Baltas, D; Zamboglou, N

    2003-02-07

    Multiple objectives must be considered in anatomy-based dose optimization for high-dose-rate brachytherapy and a large number of parameters must be optimized to satisfy often competing objectives. For objectives expressed solely in terms of dose variances, deterministic gradient-based algorithms can be applied and a weighted sum approach is able to produce a representative set of non-dominated solutions. As the number of objectives increases, or non-convex objectives are used, local minima can be present and deterministic or stochastic algorithms such as simulated annealing either cannot be used or are not efficient. In this case we employ a modified hybrid version of the multi-objective optimization algorithm NSGA-II. This, in combination with the deterministic optimization algorithm, produces a representative sample of the Pareto set. This algorithm can be used with any kind of objectives, including non-convex, and does not require artificial importance factors. A representation of the trade-off surface can be obtained with more than 1000 non-dominated solutions in 2-5 min. An analysis of the solutions provides information on the possibilities available using these objectives. Simple decision making tools allow the selection of a solution that provides a best fit for the clinical goals. We show an example with a prostate implant and compare results obtained by variance and dose-volume histogram (DVH) based objectives.

  9. A hybrid evolutionary algorithm for multi-objective anatomy-based dose optimization in high-dose-rate brachytherapy

    Energy Technology Data Exchange (ETDEWEB)

    Lahanas, M [Department of Medical Physics and Engineering, Strahlenklinik, Klinikum Offenbach, 63069 Offenbach (Germany); Baltas, D [Department of Medical Physics and Engineering, Strahlenklinik, Klinikum Offenbach, 63069 Offenbach (Germany); Zamboglou, N [Department of Medical Physics and Engineering, Strahlenklinik, Klinikum Offenbach, 63069 Offenbach (Germany)

    2003-02-07

    Multiple objectives must be considered in anatomy-based dose optimization for high-dose-rate brachytherapy and a large number of parameters must be optimized to satisfy often competing objectives. For objectives expressed solely in terms of dose variances, deterministic gradient-based algorithms can be applied and a weighted sum approach is able to produce a representative set of non-dominated solutions. As the number of objectives increases, or non-convex objectives are used, local minima can be present and deterministic or stochastic algorithms such as simulated annealing either cannot be used or are not efficient. In this case we employ a modified hybrid version of the multi-objective optimization algorithm NSGA-II. This, in combination with the deterministic optimization algorithm, produces a representative sample of the Pareto set. This algorithm can be used with any kind of objectives, including non-convex, and does not require artificial importance factors. A representation of the trade-off surface can be obtained with more than 1000 non-dominated solutions in 2-5 min. An analysis of the solutions provides information on the possibilities available using these objectives. Simple decision making tools allow the selection of a solution that provides a best fit for the clinical goals. We show an example with a prostate implant and compare results obtained by variance and dose-volume histogram (DVH) based objectives.

  10. Handling packet dropouts and random delays for unstable delayed processes in NCS by optimal tuning of PIλDμ controllers with evolutionary algorithms.

    Science.gov (United States)

    Pan, Indranil; Das, Saptarshi; Gupta, Amitava

    2011-10-01

    The issues of stochastically varying network delays and packet dropouts in Networked Control System (NCS) applications have been simultaneously addressed by time domain optimal tuning of fractional order (FO) PID controllers. Different variants of evolutionary algorithms are used for the tuning process and their performances are compared. Also the effectiveness of the fractional order PI(λ)D(μ) controllers over their integer order counterparts is looked into. Two standard test bench plants with time delay and unstable poles which are encountered in process control applications are tuned with the proposed method to establish the validity of the tuning methodology. The proposed tuning methodology is independent of the specific choice of plant and is also applicable for less complicated systems. Thus it is useful in a wide variety of scenarios. The paper also shows the superiority of FOPID controllers over their conventional PID counterparts for NCS applications.

  11. GUESS-ing Polygenic Associations with Multiple Phenotypes Using a GPU-Based Evolutionary Stochastic Search Algorithm

    DEFF Research Database (Denmark)

    Bottolo, Leonardo; Chadeau-Hyam, Marc; Hastie, David I

    2013-01-01

    and maximize genetic variant detection. We integrated our algorithm with a new Bayesian strategy for multi-phenotype analysis to identify the specific contribution of each SNP to different trait combinations and study genetic regulation of lipid metabolism in the Gutenberg Health Study (GHS). Despite...

  12. Recent Advances in Evolutionary Computation

    Institute of Scientific and Technical Information of China (English)

    Xin Yao; Yong Xu

    2006-01-01

    Evolutionary computation has experienced a tremendous growth in the last decade in both theoretical analyses and industrial applications. Its scope has evolved beyond its original meaning of "biological evolution" toward a wide variety of nature inspired computational algorithms and techniques, including evolutionary, neural, ecological, social and economical computation, etc., in a unified framework. Many research topics in evolutionary computation nowadays are not necessarily "evolutionary". This paper provides an overview of some recent advances in evolutionary computation that have been made in CERCIA at the University of Birmingham, UK. It covers a wide range of topics in optimization, learning and design using evolutionary approaches and techniques, and theoretical results in the computational time complexity of evolutionary algorithms. Some issues related to future development of evolutionary computation are also discussed.

  13. LEED I/V determination of the structure of a MoO3 monolayer on Au(111): Testing the performance of the CMA-ES evolutionary strategy algorithm, differential evolution, a genetic algorithm and tensor LEED based structural optimization

    Science.gov (United States)

    Primorac, E.; Kuhlenbeck, H.; Freund, H.-J.

    2016-07-01

    The structure of a thin MoO3 layer on Au(111) with a c(4 × 2) superstructure was studied with LEED I/V analysis. As proposed previously (Quek et al., Surf. Sci. 577 (2005) L71), the atomic structure of the layer is similar to that of a MoO3 single layer as found in regular α-MoO3. The layer on Au(111) has a glide plane parallel to the short unit vector of the c(4 × 2) unit cell and the molybdenum atoms are bridge-bonded to two surface gold atoms with the structure of the gold surface being slightly distorted. The structural refinement of the structure was performed with the CMA-ES evolutionary strategy algorithm which could reach a Pendry R-factor of ∼ 0.044. In the second part the performance of CMA-ES is compared with that of the differential evolution method, a genetic algorithm and the Powell optimization algorithm employing I/V curves calculated with tensor LEED.

  14. Greedy quantum-inspired evolutionary algorithm for quadratic knapsack problem%二次背包问题的贪婪量子进化算法求解

    Institute of Scientific and Technical Information of China (English)

    钱洁; 郑建国

    2012-01-01

    The quadratic knapsack problem is a kind of NP-Hard problem. It is difficult to solve this problem with the exact algorithms. To solve the problem, a new quantum-inspired evolutionary algorithm was proposed. The algorithm had a dynamic repair operator which considered two types of value: the value of an object and the value of associated with an object in the knapsack problem. At the same time, an improved quantum updating mode using three kinds of knowledge based on particle swarm optimization algorithm was presented. In this updating mode, the quantum could get more comprehensive knowledge during evolution. Performance of the algorithm on 100 standard quadratic knapsack problem instances was compared with other heuristic techniques. Results showed that the proposed algorithm was superior to these techniques in many aspects.%二次背包问题是一种NP难组合优化问题,其精确算法求解难度大,针对该问题提出了一种量子进化算法求解方法。该算法采用一种相对贪婪修补算子,该修补算子不但考虑了二次背包问题的每一物品项价值,而且考虑了物品的协作价值,是一种动态修补算子。同时算法借鉴粒子群算法中粒子的运动方程,提出了一种具有三类知识学习能力的量子更新模式,使得量子进化中获得的知识更全面。通过对100个国际上大规模二次背包问题进行测试实验,验证了提出的求解算法比相应的其他启发式算法性能有较大提升。

  15. A novel JEAnS analysis of the Fornax dwarf using evolutionary algorithms: mass follows light with signs of an off-centre merger

    Science.gov (United States)

    Diakogiannis, Foivos I.; Lewis, Geraint F.; Ibata, Rodrigo A.; Guglielmo, Magda; Kafle, Prajwal R.; Wilkinson, Mark I.; Power, Chris

    2017-09-01

    Dwarf galaxies, among the most dark matter dominated structures of our universe, are excellent test-beds for dark matter theories. Unfortunately, mass modelling of these systems suffers from the well documented mass-velocity anisotropy degeneracy. For the case of spherically symmetric systems, we describe a method for non-parametric modelling of the radial and tangential velocity moments. The method is a numerical velocity anisotropy "inversion", with parametric mass models, where the radial velocity dispersion profile, $\\sigma_{\\mathrm{rr}}^2$ is modeled as a B-spline, and the optimization is a three step process that consists of: (i) an Evolutionary modelling to determine the mass model form and the best B-spline basis to represent $\\sigma_{\\mathrm{rr}}^2$; (ii) an optimization of the smoothing parameters; (iii) a Markov chain Monte Carlo analysis to determine the physical parameters. The mass-anisotropy degeneracy is reduced into mass model inference, irrespective of kinematics. We test our method using synthetic data. Our algorithm constructs the best kinematic profile and discriminates between competing dark matter models. We apply our method to the Fornax dwarf spheroidal galaxy. Using a King brightness profile and testing various dark matter mass models, our model inference favours a simple mass-follows-light system. We find that the anisotropy profile of Fornax is tangential ($\\beta(r) algorithm we present is a robust and computationally inexpensive method for non-parametric modelling of spherical clusters independent of the mass-anisotropy degeneracy.

  16. Mono and multi-objective optimization techniques applied to a large range of industrial test cases using Metamodel assisted Evolutionary Algorithms

    Science.gov (United States)

    Fourment, Lionel; Ducloux, Richard; Marie, Stéphane; Ejday, Mohsen; Monnereau, Dominique; Massé, Thomas; Montmitonnet, Pierre

    2010-06-01

    The use of material processing numerical simulation allows a strategy of trial and error to improve virtual processes without incurring material costs or interrupting production and therefore save a lot of money, but it requires user time to analyze the results, adjust the operating conditions and restart the simulation. Automatic optimization is the perfect complement to simulation. Evolutionary Algorithm coupled with metamodelling makes it possible to obtain industrially relevant results on a very large range of applications within a few tens of simulations and without any specific automatic optimization technique knowledge. Ten industrial partners have been selected to cover the different area of the mechanical forging industry and provide different examples of the forming simulation tools. It aims to demonstrate that it is possible to obtain industrially relevant results on a very large range of applications within a few tens of simulations and without any specific automatic optimization technique knowledge. The large computational time is handled by a metamodel approach. It allows interpolating the objective function on the entire parameter space by only knowing the exact function values at a reduced number of "master points". Two algorithms are used: an evolution strategy combined with a Kriging metamodel and a genetic algorithm combined with a Meshless Finite Difference Method. The later approach is extended to multi-objective optimization. The set of solutions, which corresponds to the best possible compromises between the different objectives, is then computed in the same way. The population based approach allows using the parallel capabilities of the utilized computer with a high efficiency. An optimization module, fully embedded within the Forge2009 IHM, makes possible to cover all the defined examples, and the use of new multi-core hardware to compute several simulations at the same time reduces the needed time dramatically. The presented examples

  17. Modelling formation of disinfection by-products in water distribution: Optimisation using a multi-objective evolutionary algorithm

    KAUST Repository

    Radhakrishnan, Mohanasundar

    2012-05-01

    Concerns have been raised regarding disinfection by-products (DBPs) formed as a result of the reaction of halogen-based disinfectants with DBP precursors. In order to appreciate the chemical and biological tradeoffs, it is imperative to understand the formation trends of DBPs and their spread in the distribution network. However, the water at a point in a complex distribution system is a mixture from various sources, whose proportions are complex to estimate and requires advanced hydraulic analysis. To understand the risks of DBPs and to develop mitigation strategies, it is important to understand the distribution of DBPs in a water network, which requires modelling. The goal of this research was to integrate a steady-state water network model with a particle backtracking algorithm and chlorination as well as DBPs models in order to assess the tradeoffs between biological and chemical risks in the distribution network. A multi-objective optimisation algorithm was used to identify the optimal proportion of water from various sources, dosages of alum, and dosages of chlorine in the treatment plant and in booster locations to control the formation of chlorination DBPs and to achieve a balance between microbial and chemical risks. © IWA Publishing 2012.

  18. Evolutionary Computation:ao Overview

    Institute of Scientific and Technical Information of China (English)

    HeZhenya; WeiChengjian

    1997-01-01

    Evolutionary computation is a field of simulating evolution on a computer.Both aspects of it ,the problem solving aspect and the aspect of modeling natural evolution,are important.Simulating evolution on a computer results in stochastic optimization techniques that can outperform classical methods of optimization when applied to difficult real-world problems.There are currently four main avenues of research in simulated evolution:genetic algorithms,evolutionary programming,evolution strategies,and genetic programming.This paper presents a brief overview of thd field on evolutionary computation,including some theoretical issues,adaptive mechanisms,improvements,constrained optimizqtion,constrained satisfaction,evolutionary neural networks,evolutionary fuzzy systems,hardware evolution,evolutionary robotics,parallel evolutionary computation,and co-evolutionary models.The applications of evolutionary computation for optimizing system and intelligent information processing in telecommunications are also introduced.

  19. A mission-oriented orbit design method of remote sensing satellite for region monitoring mission based on evolutionary algorithm

    Science.gov (United States)

    Shen, Xin; Zhang, Jing; Yao, Huang

    2015-12-01

    Remote sensing satellites play an increasingly prominent role in environmental monitoring and disaster rescue. Taking advantage of almost the same sunshine condition to same place and global coverage, most of these satellites are operated on the sun-synchronous orbit. However, it brings some problems inevitably, the most significant one is that the temporal resolution of sun-synchronous orbit satellite can't satisfy the demand of specific region monitoring mission. To overcome the disadvantages, two methods are exploited: the first one is to build satellite constellation which contains multiple sunsynchronous satellites, just like the CHARTER mechanism has done; the second is to design non-predetermined orbit based on the concrete mission demand. An effective method for remote sensing satellite orbit design based on multiobjective evolution algorithm is presented in this paper. Orbit design problem is converted into a multi-objective optimization problem, and a fast and elitist multi-objective genetic algorithm is utilized to solve this problem. Firstly, the demand of the mission is transformed into multiple objective functions, and the six orbit elements of the satellite are taken as genes in design space, then a simulate evolution process is performed. An optimal resolution can be obtained after specified generation via evolution operation (selection, crossover, and mutation). To examine validity of the proposed method, a case study is introduced: Orbit design of an optical satellite for regional disaster monitoring, the mission demand include both minimizing the average revisit time internal of two objectives. The simulation result shows that the solution for this mission obtained by our method meet the demand the users' demand. We can draw a conclusion that the method presented in this paper is efficient for remote sensing orbit design.

  20. 一种基于云模型的多目标进化算法%A Multi-Objective Evolutionary Algorithm Based on Cloud Model

    Institute of Scientific and Technical Information of China (English)

    许波; 彭志平; 陈晓龙; 柯文德; 余建平

    2012-01-01

    A cloud model-based multi-objective evolutionary algorithm (CMOEA) is proposed based on the multi-objective evolutionary algorithm. In CMOEA, a new mutation operator that adaptively adjusts the mutation probability is designed to guarantee the good local searching ability. To maintain the diversity of solutions, the niche technology is exploited, where the niche radius is dynamically adjusted according to the X conditions cloud generator. Meanwhile, the dynamic calculation of crowding distance for individuals and the estimation of the individual congestion intensity by the cloud model are conducted at the same time, which is then followed by the eliminating process that removes the excess population one by one to keep non-inferior solutions for distribution. Finally, the multi-objective 0/1 knapsack problem is employed to test the performance of CMOEA. Experimental results indicate that compared with the currently most effective multi-objective evolutionary algorithms (NSGA-Ⅱ and SPEA2), CMOEA has a better performance in searching and population diversity. In addition, fast convergence to the Pareto front is also achieved and the resulting set of Pareto optimal solutions has superior convergence and distribution.%在多目标进化算法的基础上,提出了一种基于云模型的多目标进化算法(CMOEA).算法设计了一种新的变异算子来自适应地调整变异概率,使得算法具有良好的局部搜索能力.算法采用小生境技术,其半径按X条件云发生器非线性动态地调整以便于保持解的多样性,同时动态计算个体的拥挤距离并采用云模型参数来估计个体的拥挤度,逐个删除种群中超出的非劣解以保持解的分布性.将该算法用于多目标0/1背包问题来测试CMOEA的性能,并与目前最流行且有效的多目标进化算法NSGA-Ⅱ及SPEA2进行了比较.结果表明,CMOEA具有良好的搜索性能,并能很好地维持种群的多样性,快速收敛到Pareto前沿,所获得

  1. 进化算法与确定性算法在优化控制问题中的收敛性对比%Comparison of convergence between evolutionary algorithms and deterministic algorithms for optimal control problem

    Institute of Scientific and Technical Information of China (English)

    王江峰; 伍贻兆; Périaux J

    2004-01-01

    对比了进化算法(基因算法)与确定性算法(共轭梯度法)在优化控制问题中的优化效率.两种方法都与分散式优化策略-Nash对策进行了结合,并成功地应用于优化控制问题.计算模型采用绕NACA0012翼型的位流流场.区域分裂技术的引用使得全局流场被分裂为多个带有重叠区的子流场,使用4种不同的方法进行当地流场解的耦合,这些算法可以通过当地的流场解求得全局流场解.数值计算结果的对比表明,进化算法可以得到与共轭梯度法相同的计算结果,并且进化算法的不依赖梯度信息的特性使其在复杂问题及非线性问题中具有广泛的应用前景.%The comparison for optimization efficiency between evolutionary algorithms (Genetic Algorithms, GAs) and deterministic algorithms (Conjugate Gradient, CG) is presented. Both two different methods are combined with Nash strategy-decentralized optimization strategy in Game Theory-and implemented into an optimal control problem using a technique DDM (Domain Decomposition Method). The problem consists in simulating the perfect potential flow field around a NACA0012 airfoil with the technique DDM, the global calculation domain is then split into sub-domains with overlaps, the accord of local solutions on interfaces is obtained using four different algorithms which permit the resolution of global problem via local sub-problems on sub-domains and their interfaces. Comparable numerical results are obtained by different algorithms and show that the property of independence of gradient makes GAs based algorithms serious and robust research tools for great dimension problems or non-linear problems.

  2. Assessing the performance of linear and non-linear soil carbon dynamics models using the Multi-Objective Evolutionary Algorithm Borg-MOEA

    Science.gov (United States)

    Ramcharan, A. M.; Kemanian, A.; Richard, T.

    2013-12-01

    The largest terrestrial carbon pool is soil, storing more carbon than present in above ground biomass (Jobbagy and Jackson, 2000). In this context, soil organic carbon has gained attention as a managed sink for atmospheric CO2 emissions. The variety of models that describe soil carbon cycling reflects the relentless effort to characterize the complex nature of soil and the carbon within it. Previous works have laid out the range of mathematical approaches to soil carbon cycling but few have compared model structure performance in diverse agricultural scenarios. As interest in increasing the temporal and spatial scale of models grows, assessing the performance of different model structures is essential to drawing reasonable conclusions from model outputs. This research will address this challenge using the Evolutionary Algorithm Borg-MOEA to optimize the functionality of carbon models in a multi-objective approach to parameter estimation. Model structure performance will be assessed through analysis of multi-objective trade-offs using experimental data from twenty long-term carbon experiments across the globe. Preliminary results show a successful test of this proof of concept using a non-linear soil carbon model structure. Soil carbon dynamics were based on the amount of carbon inputs to the soil and the degree of organic matter saturation of the soil. The degree of organic matter saturation of the soil was correlated with the soil clay content. Six parameters of the non-linear soil organic carbon model were successfully optimized to steady-state conditions using Borg-MOEA and datasets from five agricultural locations in the United States. Given that more than 50% of models rely on linear soil carbon decomposition dynamics, a linear model structure was also optimized and compared to the non-linear case. Results indicate linear dynamics had a significantly lower optimization performance. Results show promise in using the Evolutionary Algorithm Borg-MOEA to assess

  3. Optimizing the distribution of resources between enzymes of carbon metabolism can dramatically increase photosynthetic rate: a numerical simulation using an evolutionary algorithm.

    Science.gov (United States)

    Zhu, Xin-Guang; de Sturler, Eric; Long, Stephen P

    2007-10-01

    The distribution of resources between enzymes of photosynthetic carbon metabolism might be assumed to have been optimized by natural selection. However, natural selection for survival and fecundity does not necessarily select for maximal photosynthetic productivity. Further, the concentration of a key substrate, atmospheric CO(2), has changed more over the past 100 years than the past 25 million years, with the likelihood that natural selection has had inadequate time to reoptimize resource partitioning for this change. Could photosynthetic rate be increased by altered partitioning of resources among the enzymes of carbon metabolism? This question is addressed using an "evolutionary" algorithm to progressively search for multiple alterations in partitioning that increase photosynthetic rate. To do this, we extended existing metabolic models of C(3) photosynthesis by including the photorespiratory pathway (PCOP) and metabolism to starch and sucrose to develop a complete dynamic model of photosynthetic carbon metabolism. The model consists of linked differential equations, each representing the change of concentration of one metabolite. Initial concentrations of metabolites and maximal activities of enzymes were extracted from the literature. The dynamics of CO(2) fixation and metabolite concentrations were realistically simulated by numerical integration, such that the model could mimic well-established physiological phenomena. For example, a realistic steady-state rate of CO(2) uptake was attained and then reattained after perturbing O(2) concentration. Using an evolutionary algorithm, partitioning of a fixed total amount of protein-nitrogen between enzymes was allowed to vary. The individual with the higher light-saturated photosynthetic rate was selected and used to seed the next generation. After 1,500 generations, photosynthesis was increased substantially. This suggests that the "typical" partitioning in C(3) leaves might be suboptimal for maximizing the light

  4. Using a Novel Evolutionary Algorithm to More Effectively Apply Community-Driven EcoHealth Interventions in Big Data with Application to Chagas Disease

    Science.gov (United States)

    Rizzo, D. M.; Hanley, J.; Monroy, C.; Rodas, A.; Stevens, L.; Dorn, P.

    2016-12-01

    Chagas disease is a deadly, neglected tropical disease that is endemic to every country in Central and South America. The principal insect vector of Chagas disease in Central America is Triatoma dimidiata. EcoHealth interventions are an environmentally friendly alternative that use local materials to lower household infestation, reduce the risk of infestation, and improve the quality of life. Our collaborators from La Universidad de San Carlos de Guatemala along with Ministry of Health Officials reach out to communities with high infestation and teach the community EcoHealth interventions. The process of identifying which interventions have the potential to be most effective as well as the houses that are most at risk is both expensive and time consuming. In order to better identify the risk factors associated with household infestation of T. dimidiata, a number of studies have conducted socioeconomic and entomologic surveys that contain numerous potential risk factors consisting of both nominal and ordinal data. Univariate logistic regression is one of the more popular methods for determining which risk factors are most closely associated with infestation. However, this tool has limitations, especially with the large amount and type of "Big Data" associated with our study sites (e.g., 5 villages comprise of socioeconomic, demographic, and entomologic data). The infestation of a household with T. dimidiata is a complex problem that is most likely not univariate in nature and is likely to contain higher order epistatic relationships that cannot be discovered using univariate logistic regression. Add to this, the problems raised with using p-values in traditional statistics. Also, our T. dimidiata infestation dataset is too large to exhaustively search. Therefore, we use a novel evolutionary algorithm to efficiently search for higher order interactions in surveys associated with households infested with T. dimidiata. In this study, we use our novel evolutionary

  5. GUESS-ing polygenic associations with multiple phenotypes using a GPU-based evolutionary stochastic search algorithm.

    Directory of Open Access Journals (Sweden)

    Leonardo Bottolo

    Full Text Available Genome-wide association studies (GWAS yielded significant advances in defining the genetic architecture of complex traits and disease. Still, a major hurdle of GWAS is narrowing down multiple genetic associations to a few causal variants for functional studies. This becomes critical in multi-phenotype GWAS where detection and interpretability of complex SNP(s-trait(s associations are complicated by complex Linkage Disequilibrium patterns between SNPs and correlation between traits. Here we propose a computationally efficient algorithm (GUESS to explore complex genetic-association models and maximize genetic variant detection. We integrated our algorithm with a new Bayesian strategy for multi-phenotype analysis to identify the specific contribution of each SNP to different trait combinations and study genetic regulation of lipid metabolism in the Gutenberg Health Study (GHS. Despite the relatively small size of GHS (n  =  3,175, when compared with the largest published meta-GWAS (n > 100,000, GUESS recovered most of the major associations and was better at refining multi-trait associations than alternative methods. Amongst the new findings provided by GUESS, we revealed a strong association of SORT1 with TG-APOB and LIPC with TG-HDL phenotypic groups, which were overlooked in the larger meta-GWAS and not revealed by competing approaches, associations that we replicated in two independent cohorts. Moreover, we demonstrated the increased power of GUESS over alternative multi-phenotype approaches, both Bayesian and non-Bayesian, in a simulation study that mimics real-case scenarios. We showed that our parallel implementation based on Graphics Processing Units outperforms alternative multi-phenotype methods. Beyond multivariate modelling of multi-phenotypes, our Bayesian model employs a flexible hierarchical prior structure for genetic effects that adapts to any correlation structure of the predictors and increases the power to identify

  6. On the Use of Evolutionary Algorithms to Improve the Robustness of Continuous Speech Recognition Systems in Adverse Conditions

    Directory of Open Access Journals (Sweden)

    Sid-Ahmed Selouani

    2003-07-01

    Full Text Available Limiting the decrease in performance due to acoustic environment changes remains a major challenge for continuous speech recognition (CSR systems. We propose a novel approach which combines the Karhunen-Loève transform (KLT in the mel-frequency domain with a genetic algorithm (GA to enhance the data representing corrupted speech. The idea consists of projecting noisy speech parameters onto the space generated by the genetically optimized principal axis issued from the KLT. The enhanced parameters increase the recognition rate for highly interfering noise environments. The proposed hybrid technique, when included in the front-end of an HTK-based CSR system, outperforms that of the conventional recognition process in severe interfering car noise environments for a wide range of signal-to-noise ratios (SNRs varying from 16 dB to −4 dB. We also showed the effectiveness of the KLT-GA method in recognizing speech subject to telephone channel degradations.

  7. a Gis-Based Model for Post-Earthquake Personalized Route Planning Using the Integration of Evolutionary Algorithm and Owa

    Science.gov (United States)

    Moradi, M.; Delavar, M. R.; Moradi, A.

    2015-12-01

    Being one of the natural disasters, earthquake can seriously damage buildings, urban facilities and cause road blockage. Post-earthquake route planning is problem that has been addressed in frequent researches. The main aim of this research is to present a route planning model for after earthquake. It is assumed in this research that no damage data is available. The presented model tries to find the optimum route based on a number of contributing factors which mainly indicate the length, width and safety of the road. The safety of the road is represented by a number of criteria such as distance to faults, percentage of non-standard buildings and percentage of high buildings around the route. An integration of genetic algorithm and ordered weighted averaging operator is employed in the model. The former searches the problem space among all alternatives, while the latter aggregates the scores of road segments to compute an overall score for each alternative. Ordered weighted averaging operator enables the users of the system to evaluate the alternative routes based on their decision strategy. Based on the proposed model, an optimistic user tries to find the shortest path between the two points, whereas a pessimistic user tends to pay more attention to safety parameters even if it enforces a longer route. The results depicts that decision strategy can considerably alter the optimum route. Moreover, post-earthquake route planning is a function of not only the length of the route but also the probability of the road blockage.

  8. On the Use of Evolutionary Algorithms to Improve the Robustness of Continuous Speech Recognition Systems in Adverse Conditions

    Science.gov (United States)

    Selouani, Sid-Ahmed; O'Shaughnessy, Douglas

    2003-12-01

    Limiting the decrease in performance due to acoustic environment changes remains a major challenge for continuous speech recognition (CSR) systems. We propose a novel approach which combines the Karhunen-Loève transform (KLT) in the mel-frequency domain with a genetic algorithm (GA) to enhance the data representing corrupted speech. The idea consists of projecting noisy speech parameters onto the space generated by the genetically optimized principal axis issued from the KLT. The enhanced parameters increase the recognition rate for highly interfering noise environments. The proposed hybrid technique, when included in the front-end of an HTK-based CSR system, outperforms that of the conventional recognition process in severe interfering car noise environments for a wide range of signal-to-noise ratios (SNRs) varying from 16 dB to[InlineEquation not available: see fulltext.] dB. We also showed the effectiveness of the KLT-GA method in recognizing speech subject to telephone channel degradations.

  9. Modelling and multi-objective optimization of a variable valve-timing spark-ignition engine using polynomial neural networks and evolutionary algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Atashkari, K. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of); Nariman-Zadeh, N. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of)]. E-mail: nnzadeh@guilan.ac.ir; Goelcue, M. [Department of Mechanical Education, Technical Education faculty, Pamukkale University, 20017 Kinikli, Denizli (Turkey); Khalkhali, A. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of); Jamali, A. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of)

    2007-03-15

    The main reason for the efficiency decrease at part load conditions for four-stroke spark-ignition (SI) engines is the flow restriction at the cross-sectional area of the intake system. Traditionally, valve-timing has been designed to optimize operation at high engine-speed and wide open throttle conditions. Several investigations have demonstrated that improvements at part load conditions in engine performance can be accomplished if the valve-timing is variable. Controlling valve-timing can be used to improve the torque and power curve as well as to reduce fuel consumption and emissions. In this paper, a group method of data handling (GMDH) type neural network and evolutionary algorithms (EAs) are firstly used for modelling the effects of intake valve-timing (V {sub t}) and engine speed (N) of a spark-ignition engine on both developed engine torque (T) and fuel consumption (Fc) using some experimentally obtained training and test data. Using such obtained polynomial neural network models, a multi-objective EA (non-dominated sorting genetic algorithm, NSGA-II) with a new diversity preserving mechanism are secondly used for Pareto based optimization of the variable valve-timing engine considering two conflicting objectives such as torque (T) and fuel consumption (Fc). The comparison results demonstrate the superiority of the GMDH type models over feedforward neural network models in terms of the statistical measures in the training data, testing data and the number of hidden neurons. Further, it is shown that some interesting and important relationships, as useful optimal design principles, involved in the performance of the variable valve-timing four-stroke spark-ignition engine can be discovered by the Pareto based multi-objective optimization of the polynomial models. Such important optimal principles would not have been obtained without the use of both the GMDH type neural network modelling and the multi-objective Pareto optimization approach.

  10. Optimization of bioenergy crop selection and placement based on a stream health indicator using an evolutionary algorithm.

    Science.gov (United States)

    Herman, Matthew R; Nejadhashemi, A Pouyan; Daneshvar, Fariborz; Abouali, Mohammad; Ross, Dennis M; Woznicki, Sean A; Zhang, Zhen

    2016-10-01

    The emission of greenhouse gases continues to amplify the impacts of global climate change. This has led to the increased focus on using renewable energy sources, such as biofuels, due to their lower impact on the environment. However, the production of biofuels can still have negative impacts on water resources. This study introduces a new strategy to optimize bioenergy landscapes while improving stream health for the region. To accomplish this, several hydrological models including the Soil and Water Assessment Tool, Hydrologic Integrity Tool, and Adaptive Neruro Fuzzy Inference System, were linked to develop stream health predictor models. These models are capable of estimating stream health scores based on the Index of Biological Integrity. The coupling of the aforementioned models was used to guide a genetic algorithm to design watershed-scale bioenergy landscapes. Thirteen bioenergy managements were considered based on the high probability of adaptation by farmers in the study area. Results from two thousand runs identified an optimum bioenergy crops placement that maximized the stream health for the Flint River Watershed in Michigan. The final overall stream health score was 50.93, which was improved from the current stream health score of 48.19. This was shown to be a significant improvement at the 1% significant level. For this final bioenergy landscape the most often used management was miscanthus (27.07%), followed by corn-soybean-rye (19.00%), corn stover-soybean (18.09%), and corn-soybean (16.43%). The technique introduced in this study can be successfully modified for use in different regions and can be used by stakeholders and decision makers to develop bioenergy landscapes that maximize stream health in the area of interest.

  11. 基于进化算法的多无人机协同航路规划%Cooperative Path Planning of Multi-UAV Based on Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    李子杰; 刘湘伟

    2015-01-01

    以突防航路时域协同指数、空域协同指数、突防时长指数和受威胁指数为规划目标,以最小直线航路段长度、可飞空域、续航能力和进入任务航路方向为约束,构建了多无人机协同突防航路规划模型。结合模型特点,利用合作型协同进化遗传算法对该模型进行求解。%Aiming at maximizing penetration path time synergy index and penetration path airspace synergy index, minimizing penetration time length index and intimidate index, restricted by the minimum length of straight path, flyable space, endurance and intro-mission route direction, the penetration path planning model of Multiple Unmanned Serial Vehicle (Multi-UAV)is constructed. Combining its characteristic, the model is solved by use of Cooperative Co-evolutionary Genetic Algorithms(CCGA).

  12. Evaluation of water resources system vulnerability based on co-operative co-evolutionary genetic algorithm and projection pursuit model under the DPSIR framework

    Science.gov (United States)

    Zhao, Y.; Su, X. H.; Wang, M. H.; Li, Z. Y.; Li, E. K.; Xu, X.

    2017-08-01

    Water resources vulnerability control management is essential because it is related to the benign evolution of socio-economic, environmental and water resources system. Research on water resources system vulnerability is helpful to realization of water resources sustainable utilization. In this study, the DPSIR framework of driving forces-pressure–state–impact-response was adopted to construct the evaluation index system of water resources system vulnerability. Then the co-evolutionary genetic algorithm and projection pursuit were used to establish evaluation model of water resources system vulnerability. Tengzhou City in Shandong Province was selected as a study area. The system vulnerability was analyzed in terms of driving forces, pressure, state, impact and response on the basis of the projection value calculated by the model. The results show that the five components all belong to vulnerability Grade II, the vulnerability degree of impact and state were higher than other components due to the fierce imbalance in supply-demand and the unsatisfied condition of water resources utilization. It is indicated that the influence of high speed socio-economic development and the overuse of the pesticides have already disturbed the benign development of water environment to some extents. While the indexes in response represented lower vulnerability degree than the other components. The results of the evaluation model are coincident with the status of water resources system in the study area, which indicates that the model is feasible and effective.

  13. Evolutionary algorithm based optimization of hydraulic machines utilizing a state-of-the-art block coupled CFD solver and parametric geometry and mesh generation tools

    Science.gov (United States)

    S, Kyriacou; E, Kontoleontos; S, Weissenberger; L, Mangani; E, Casartelli; I, Skouteropoulou; M, Gattringer; A, Gehrer; M, Buchmayr

    2014-03-01

    An efficient hydraulic optimization procedure, suitable for industrial use, requires an advanced optimization tool (EASY software), a fast solver (block coupled CFD) and a flexible geometry generation tool. EASY optimization software is a PCA-driven metamodel-assisted Evolutionary Algorithm (MAEA (PCA)) that can be used in both single- (SOO) and multiobjective optimization (MOO) problems. In MAEAs, low cost surrogate evaluation models are used to screen out non-promising individuals during the evolution and exclude them from the expensive, problem specific evaluation, here the solution of Navier-Stokes equations. For additional reduction of the optimization CPU cost, the PCA technique is used to identify dependences among the design variables and to exploit them in order to efficiently drive the application of the evolution operators. To further enhance the hydraulic optimization procedure, a very robust and fast Navier-Stokes solver has been developed. This incompressible CFD solver employs a pressure-based block-coupled approach, solving the governing equations simultaneously. This method, apart from being robust and fast, also provides a big gain in terms of computational cost. In order to optimize the geometry of hydraulic machines, an automatic geometry and mesh generation tool is necessary. The geometry generation tool used in this work is entirely based on b-spline curves and surfaces. In what follows, the components of the tool chain are outlined in some detail and the optimization results of hydraulic machine components are shown in order to demonstrate the performance of the presented optimization procedure.

  14. An effective and optimal quality control approach for green energy manufacturing using design of experiments framework and evolutionary algorithm

    Science.gov (United States)

    Saavedra, Juan Alejandro

    Quality Control (QC) and Quality Assurance (QA) strategies vary significantly across industries in the manufacturing sector depending on the product being built. Such strategies range from simple statistical analysis and process controls, decision-making process of reworking, repairing, or scraping defective product. This study proposes an optimal QC methodology in order to include rework stations during the manufacturing process by identifying the amount and location of these workstations. The factors that are considered to optimize these stations are cost, cycle time, reworkability and rework benefit. The goal is to minimize the cost and cycle time of the process, but increase the reworkability and rework benefit. The specific objectives of this study are: (1) to propose a cost estimation model that includes energy consumption, and (2) to propose an optimal QC methodology to identify quantity and location of rework workstations. The cost estimation model includes energy consumption as part of the product direct cost. The cost estimation model developed allows the user to calculate product direct cost as the quality sigma level of the process changes. This provides a benefit because a complete cost estimation calculation does not need to be performed every time the processes yield changes. This cost estimation model is then used for the QC strategy optimization process. In order to propose a methodology that provides an optimal QC strategy, the possible factors that affect QC were evaluated. A screening Design of Experiments (DOE) was performed on seven initial factors and identified 3 significant factors. It reflected that one response variable was not required for the optimization process. A full factorial DOE was estimated in order to verify the significant factors obtained previously. The QC strategy optimization is performed through a Genetic Algorithm (GA) which allows the evaluation of several solutions in order to obtain feasible optimal solutions. The GA

  15. 基于多重分形主曲线模型多目标演化算法研究%Multi-Objective Evolutionary Algorithm for Principal Curve Model Based on Multifractal

    Institute of Scientific and Technical Information of China (English)

    张冬梅; 龚小胜; 戴光明

    2011-01-01

    Current model-based multi-objective evolutionary algorithms use linear modeling approach such as PCA and local PCA, which has deficiencies that the model fitting result is not satisfactory and is sensitive to modeling parameters. In this paper, a multi-objective evolutionary optimization algorithm based on multifractal principal curve (MFPC-MOEA) is proposed. The algorithm uses principal curve to build nonlinear modeling on the distribution of the solution set and to establish the probability model on the individual distribution of population, which can generate the individuals distributed evenly in the objective space and ensure the diversity of optimization results. The start and stop criteria for the algorithm modeling are two important aspects of modeling multi-objective algorithm. In this paper, we analyze the distribution of individuals in the solution space with multifractal spectrum, and design the start criteria of the modeling for the model of multi-objective evolutionary algorithm, which is used as initial conditions of model. Furthermore, multifractal approach is used for assessing the convergence degree of algorithm, in order to design a stop criteria of the multi-objective evolutionary optimization algorithm. Moreover, we adopt internationally recognized testing functions such as ZDT, DTLZ, etc, to conduct the comparison experiment with NSGA-II, MOEA/D, PAES, SPEA2, MFPC-MOEA and other classical multi-objective evolutionary optimization algorithms. The simulation results show that the proposed algorithm performs better on the performance indicators of HV, SPREAD, IGD and EPS1LON, which indicates that through the introduction of multifractal modeling strategy and principal curve method, the quality of solution is improved in a certain extent. A new idea to solve multi-objective optimization problems (MOPs) is provided.%为了克服目前模型多目标演化算法多采用PCA,local PCA等线性建模方法,存在模型拟合效果不理想、对建模

  16. High resolution study of the ν2 and ν5 rovibrational fundamental bands of thionyl chloride: Interplay of an evolutionary algorithm and a line-by-line analysis

    Science.gov (United States)

    Roucou, Anthony; Dhont, Guillaume; Cuisset, Arnaud; Martin-Drumel, Marie-Aline; Thorwirth, Sven; Fontanari, Daniele; Meerts, W. Leo

    2017-08-01

    The ν2 and ν5 fundamental bands of thionyl chloride (SOCl2) were measured in the 420 cm-1-550 cm-1 region using the FT-far-IR spectrometer exploiting synchrotron radiation on the AILES beamline at SOLEIL. A straightforward line-by-line analysis is complicated by the high congestion of the spectrum due to both the high density of SOCl2 rovibrational bands and the presence of the ν2 fundamental band of sulfur dioxide produced by hydrolysis of SOCl2 with residual water. To overcome this difficulty, our assignment procedure for the main isotopologues 32S16O35Cl2 and 32S16O35Cl37Cl alternates between a direct fit of the spectrum, via a global optimization technique, and a traditional line-by-line analysis. The global optimization, based on an evolutionary algorithm, produces rotational constants and band centers that serve as useful starting values for the subsequent spectroscopic analysis. This work helped to identify the pure rotational submillimeter spectrum of 32S16O35Cl2 in the v2=1 and v5=1 vibrational states of Martin-Drumel et al. [J. Chem. Phys. 144, 084305 (2016)]. As a by-product, the rotational transitions of the v4=1 far-IR inactive state were identified in the submillimeter spectrum. A global fit gathering all the microwave, submillimeter, and far-IR data of thionyl chloride has been performed, showing that no major perturbation of rovibrational energy levels occurs for the main isotopologue of the molecule.

  17. Evolutionary computation for reinforcement learning

    NARCIS (Netherlands)

    S. Whiteson

    2012-01-01

    Algorithms for evolutionary computation, which simulate the process of natural selection to solve optimization problems, are an effective tool for discovering high-performing reinforcement-learning policies. Because they can automatically find good representations, handle continuous action spaces, a

  18. Reliability optimization in compound electric power systems with the aid of evolutionary algorithms; Optimizacion de la confiabilidad en sistemas electricos de potencia compuestos utilizando algoritmos evolucionarios

    Energy Technology Data Exchange (ETDEWEB)

    Gomez Hernandez, Jose Alberto

    2001-11-15

    The purpose of evaluating the reliability of Electric Power Systems is to estimate the ability of the system to carry out their function of taking the energy from the generating stations to the load points. This involves the reliability of generation sources and transmission that affect in the transfer of power through the transmission system that bears load loss and voltage sags between the generation and the consumption centers. In this thesis a hybrid methodology that optimize the reliability in systems generation -transmission using evolutionary algorithms is developed. This technique of optimization determines the optimum number of components (parallel redundancy in lines) and shunt compensation in load nodes necessary to maximize reliability, subject to cost restrictions, and considering security conditions in steady state, using the smallest singular value technique. The objective function will be defined as stochastic function, where the measure of interests is the smallest singular value of the Jacobian matrix of power flows solution of the most severe event according to the evaluation of reliability of the generation transmission system, this formulation is a combination of integer and continuous non linear programming, where the conventional mathematical programming algorithms present difficulties in robustness and global optimal search. The fault in generation units is determined by using the state sampling together with the transmission system by Monte Carlo simulation for a desired load level. For events where violations in security exist (lines loading, violation in voltage in load nodes and violation in reactive power of generation nodes) a model of active and reactive power dispatch is used in order to correct these violations by means of the exact penalty function linear programming technique to proceeded to determine the stability of voltage in steady state by means of the smallest singular value technique and the participation factors of nodes

  19. 基于双极偏好占优的高维目标进化算法∗%Many-Objective Evolutionary Algorithm Based on Bipolar Preferences Dominance

    Institute of Scientific and Technical Information of China (English)

    邱飞岳; 吴裕市; 邱启仓; 王丽萍

    2013-01-01

    Many-Objective optimization is a difficulty for classical multi-objective evolutionary algorithm and has gained great attention during the past few years. In this paper, a dominance relation named bipolar preferences dominance is proposed for addressing many-objective problem. The proposed dominance relation considers the decision maker’s positive preference and negative preference simultaneously and creates a strict dominance relation among the non-dominated solutions, which has ability to reduce the proportion of non-dominated solutions in population and lead the race to the Pareto optimal area, which is close to the positive preference and far away from negative preference. To demonstrate its effectiveness, the proposed approach was integrated into NSGA-II to be a new algorithm denoted by 2p-NSGA-II and tested on a benchmark of two to fifteen-objective test problems. Good results were obtained. The proposed dominance relation was also compared to g-dominance and r-dominance which was the most recently proposed dominance relation, the results of comparative experiment showed 2p-NSGA-II was superior to g-NSGA-II and r-NSGA-II on a whole, no matter the accuracy of obtained solutions or the efficiency of algorithm.%  高维目标优化是目前多目标优化领域的研究热点和难点.提出一种占优机制,即双极偏好占优用于处理高维目标优化问题.该占优机制同时考虑决策者的正偏好和负偏好信息,在非支配解之间建立了更加严格的占优关系,能够有效减少种群中非支配解的比例,引导算法向靠近正偏好同时远离负偏好的Pareto最优区域收敛.为检验该方法的有效性,将双极偏好占优融入NSGA-II中,形成算法2p-NSGA-II,并在2到15目标标准测试函数上进行测试,得到了良好的实验结果.同时,将所提出的占优机制与目前该领域的两种占优机制g占优和r占优进行性能对比,实验结果表明,2p-NSGA-II算法无论是在求解精度还

  20. Investigation on evolutionary optimization of chaos control

    Energy Technology Data Exchange (ETDEWEB)

    Zelinka, Ivan [Faculty of Applied Informatics, Tomas Bata University in Zli' n, Nad Stranemi 4511, 762 72 Zli' n (Czech Republic)], E-mail: zelinka@fai.utb.cz; Senkerik, Roman [Faculty of Applied Informatics, Tomas Bata University in Zli' n, Nad Stranemi 4511, 762 72 Zli' n (Czech Republic)], E-mail: senkerik@fai.utb.cz; Navratil, Eduard [Faculty of Applied Informatics, Tomas Bata University in Zli' n, Nad Stranemi 4511, 762 72 Zli' n (Czech Republic)], E-mail: enavratil@fai.utb.cz

    2009-04-15

    This work deals with an investigation on optimization of the feedback control of chaos based on the use of evolutionary algorithms. The main objective is to show that evolutionary algorithms are capable of optimization of chaos control. As models of deterministic chaotic systems, one-dimensional Logistic equation and two-dimensional Henon map were used. The optimizations were realized in several ways, each one for another set of parameters of evolution algorithms or separate cost functions. The evolutionary algorithm SOMA (self-organizing migrating algorithm) was used in four versions. For each version simulations were repeated several times to show and check for robustness of the applied method.

  1. Optimización multiobjetivo para enrutamiento multicast en overlay networks utilizando algoritmos evolutivos Multiobjective Optimization for Multicast Routing in Overlay Networks using Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Juan Carlos Montoya M.

    2008-06-01

    Full Text Available Multicast juega un papel muy importante para soportar una nueva generación de aplicaciones. En la actualidad y por diferentes razones, técnicas y no técnicas, multicast IP no ha sido totalmente adoptado en Internet. Durante los últimos a˜nos, un área de investigación activa es la de implementar este tipo de tráfico desde la perspectiva del nivel de aplicación, donde la funcionalidad de multicast no es responsabilidad de los enrutadores sino de los hosts, a lo que se le conoce como Multicast Overlay Network (MON. En este artículo se plantea el enrutamiento en MON como un problema de Optimización Multiobjetivo (MOP donde se optimizan dos funciones: 1 el retardo total extremo a extremo del árbol multicast, y 2 la máxima utilización de los enlaces. La optimización simultánea de estas dos funciones es un problema NP completo y para resolverlo se propone utilizar Algoritmos Evolutivos Multiobjetivos (MOEA, específicamente NSGAIMulticast plays an important role in supporting a new generation of applications. At present and for different reasons, technical and non–technical, multicast IP hasn’t yet been totally adopted for Internet. During recent years, an active area of research is that of implementing this kind of traffic in the application layer where the multicast functionality isn´t a responsibility of the routers but that of the hosts, which we know as Multicast Overlay Networks (MON. In this article, routing in an MON is put forward as a multiobjective optimization problem (MOP where two functions are optimized: 1 the total end to end delay of the multicast tree and 2 the maximum link utilization. The simultaneous optimization of these two functions is an NP–Complete problem and to solve this we suggest using Multiobjective Evolutionary Algorithms (MOEA, specifically NSGA–II.

  2. Evolutionary Expectations

    DEFF Research Database (Denmark)

    Nash, Ulrik William

    2014-01-01

    The concept of evolutionary expectations descends from cue learning psychology, synthesizing ideas on rational expectations with ideas on bounded rationality, to provide support for these ideas simultaneously. Evolutionary expectations are rational, but within cognitive bounds. Moreover...... cognitive bounds will perceive business opportunities identically. In addition, because cues provide information about latent causal structures of the environment, changes in causality must be accompanied by changes in cognitive representations if adaptation is to be maintained. The concept of evolutionary...

  3. Evolutionary Statistical Procedures

    CERN Document Server

    Baragona, Roberto; Poli, Irene

    2011-01-01

    This proposed text appears to be a good introduction to evolutionary computation for use in applied statistics research. The authors draw from a vast base of knowledge about the current literature in both the design of evolutionary algorithms and statistical techniques. Modern statistical research is on the threshold of solving increasingly complex problems in high dimensions, and the generalization of its methodology to parameters whose estimators do not follow mathematically simple distributions is underway. Many of these challenges involve optimizing functions for which analytic solutions a

  4. Novel quantum genetic evolutionary algorithm based on university curriculum arrangement problems%一种基于高校排课问题的新型量子遗传进化算法

    Institute of Scientific and Technical Information of China (English)

    沈微微; 华明正; 史洪玮

    2013-01-01

    量子遗传进化算法是量子计算和遗传算法相结合的产物,量子比特是两个量子态的叠加态,在此,详细介绍了量子遗传进化算法。尝试使用量子遗传进化算法来解决高校排课问题,并进行了实验。实验结果表明,该算法获得了比较好的结果。%University timetabling problem is a concern of many people. The essence of course arrangement is to allocate cur-riculum,teachers and students to the appropriate classrooms in the appropriate period. The course arrangement involves many factors,and is a multi-objective scheduling problem,which is called as timetable in operational research. Quantum genetic evo-lutionary algorithm is the combination of quantum computation and genetic algorithm. Quantum bit is a superposition of two quan-tum states. The quantum genetic evolutionary algorithm was used to solve the university course timetabling problem. A good re-sult was achieved in a relevant experiment.

  5. Evolutionary Demography

    DEFF Research Database (Denmark)

    Levitis, Daniel

    2015-01-01

    of biological and cultural evolution. Demographic variation within and among human populations is influenced by our biology, and therefore by natural selection and our evolutionary background. Demographic methods are necessary for studying populations of other species, and for quantifying evolutionary fitness...

  6. 基于泛函分析的思维进化算法收敛性研究%A Study on Convergence of Mind Evolutionary Algorithm Based on Functional Analysis

    Institute of Scientific and Technical Information of China (English)

    邱玉霞; 谢克明

    2006-01-01

    思维进化算法(Mind Evolutionary Algorithm)是一种新型进化计算方法,主要通过"趋同"和"异化"算子进行进化操作.论文从泛函分析角度研究了种群在进化过程中的变化情况,用区间套定理证明了思维进化算法的全局收敛性.数值实验结果与所得结论相一致,验证了结论的正确性.

  7. Incorporation of an evolutionary algorithm to estimate transfer-functions for a parameter regionalization scheme of a rainfall-runoff model

    Science.gov (United States)

    Klotz, Daniel; Herrnegger, Mathew; Schulz, Karsten

    2016-04-01

    This contribution presents a framework, which enables the use of an Evolutionary Algorithm (EA) for the calibration and regionalization of the hydrological model COSEROreg. COSEROreg uses an updated version of the HBV-type model COSERO (Kling et al. 2014) for the modelling of hydrological processes and is embedded in a parameter regionalization scheme based on Samaniego et al. (2010). The latter uses subscale-information to estimate model via a-priori chosen transfer functions (often derived from pedotransfer functions). However, the transferability of the regionalization scheme to different model-concepts and the integration of new forms of subscale information is not straightforward. (i) The usefulness of (new) single sub-scale information layers is unknown beforehand. (ii) Additionally, the establishment of functional relationships between these (possibly meaningless) sub-scale information layers and the distributed model parameters remain a central challenge in the implementation of a regionalization procedure. The proposed method theoretically provides a framework to overcome this challenge. The implementation of the EA encompasses the following procedure: First, a formal grammar is specified (Ryan et al., 1998). The construction of the grammar thereby defines the set of possible transfer functions and also allows to incorporate hydrological domain knowledge into the search itself. The EA iterates over the given space by combining parameterized basic functions (e.g. linear- or exponential functions) and sub-scale information layers into transfer functions, which are then used in COSEROreg. However, a pre-selection model is applied beforehand to sort out unfeasible proposals by the EA and to reduce the necessary model runs. A second optimization routine is used to optimize the parameters of the transfer functions proposed by the EA. This concept, namely using two nested optimization loops, is inspired by the idea of Lamarckian Evolution and Baldwin Effect

  8. 一种混合高维目标进化算法及其收敛性分析%A hybrid many-objective evolutionary algorithm and analysis of its convergence properties

    Institute of Scientific and Technical Information of China (English)

    谢承旺

    2012-01-01

    There exsits a performance crisis for modern multi-objective evolutionary algorithms in high-dimensional objective space.In this paper,a hybird many-objective evolutionary algorithm(HMOEA) is proposed to improve MOEA's performance in solving many-objective optimization problems.In the HMOEA,w-dominance relation based on revaluation function is used to replace the Pareto-dominance relation,secondly,to balance the convergence and diversity in evolutionary population,the composition of the next population is varying with the current generation.Finally,an improved crowding distance assignment is used in HMOEA to evaluate individual's density to preserve diversity.HMOEA is examined on DTLZ2 to observe its performance in many-objective optimization problems.Experimental results illustrate that HMOEA exhibits a good performance in sense of convergence and diversity.At last,it is proven that the new algorithm can guarantee the convergence towards the global optimum under some conditions.%现代多目标进化算法在高维目标空间中遭遇性能危机,提出一种混合高维目标进化算法(Hybrid Many-Ob-jective Evolutionary Algorithm,HMOEA)以改善算法的解题性能.新的算法使用了新定义的w-支配关系替代Pa-reto支配关系;其次,为使算法在收敛性与多样性之间保持适当均衡,下一代种群个体的构成随当前进化世代动态调整;最后,算法使用了改进的拥挤距离赋值机制评估解个体密度以实施多样性保持操作.新算法在DTLZ2问题上进行测试,结果表明该算法可以获得很好的性能,而且新算法在收敛性和多样性之间也取得了较好的均衡.最后,从一般意义上分析了HMOEA算法的收敛性,分析结果表明HMOEA算法能够以概率1收敛.

  9. Toward an evolutionary-predictive foundation for creativity : Commentary on "Human creativity, evolutionary algorithms, and predictive representations: The mechanics of thought trials" by Arne Dietrich and Hilde Haider, 2014 (Accepted pending minor revisions for publication in Psychonomic Bulletin & Review).

    Science.gov (United States)

    Gabora, Liane; Kauffman, Stuart

    2016-04-01

    Dietrich and Haider (Psychonomic Bulletin & Review, 21 (5), 897-915, 2014) justify their integrative framework for creativity founded on evolutionary theory and prediction research on the grounds that "theories and approaches guiding empirical research on creativity have not been supported by the neuroimaging evidence." Although this justification is controversial, the general direction holds promise. This commentary clarifies points of disagreement and unresolved issues, and addresses mis-applications of evolutionary theory that lead the authors to adopt a Darwinian (versus Lamarckian) approach. To say that creativity is Darwinian is not to say that it consists of variation plus selection - in the everyday sense of the term - as the authors imply; it is to say that evolution is occurring because selection is affecting the distribution of randomly generated heritable variation across generations. In creative thought the distribution of variants is not key, i.e., one is not inclined toward idea A because 60 % of one's candidate ideas are variants of A while only 40 % are variants of B; one is inclined toward whichever seems best. The authors concede that creative variation is partly directed; however, the greater the extent to which variants are generated non-randomly, the greater the extent to which the distribution of variants can reflect not selection but the initial generation bias. Since each thought in a creative process can alter the selective criteria against which the next is evaluated, there is no demarcation into generations as assumed in a Darwinian model. We address the authors' claim that reduced variability and individuality are more characteristic of Lamarckism than Darwinian evolution, and note that a Lamarckian approach to creativity has addressed the challenge of modeling the emergent features associated with insight.

  10. 正交演化算法在继电器体积优化设计中的应用%Orthogonal evolutionary algorithm and its application in relay volume optimization design

    Institute of Scientific and Technical Information of China (English)

    颜雪松; 曾文聪; 王汉宁; 夏文; 李晖

    2011-01-01

    继电器产品的优化设计是在给定的负载条件或环境条件下,在对继电器产品的性态、几何尺寸关系或其他因素限制约束范围内,确定设计参数、目标函数、约束条件以形成优化设计模型,并选择恰当的优化方法以获得最佳设计方案的一系列工作.继电器的体积数学模型涉及到机、电、磁、热等方面,其目标函数和约束函数均是高度非线性的.传统演化算法求解问题时容易陷入局部极小值.在简单演化算法的基础上,结合正交实验法的基本思想,将其应用于演化算法的种群初始化、交叉算子,并引入自适应正交局部搜索来防止局部收敛,得到了一种新型的正交演化算法.通过一系列数值实验验证了该算法的高效性.%Optimal design of relay products determine the design parameters in the given load conditions or environmental conditions,the state of relay products,geometry or other factors within the scope of restrictions,and makes sure of the design parameters,object function,constraints in order to form an optimized design model,and selects the appropriate optimization method to obtain the best design of a series of works.Mathematical model of the relay volume involves in mechanical,electricai, magnetic, thermal, etc.,the objective function and constraints are highly nonlinear function.Traditional evolutionary algorithm is trapped into the local minimum easily.Therefore,based on a simple evolutionary algorithm and combining the base ideology of orthogonal test,applied it to the population initialization,crossover operator, as well as the introduction of adaptive orthogonal local search to prevent local convergence,a new orthogonal evolutionary algorithm is proposed.The series of numerical experiments have proved the efficiency of this algorithm.

  11. Evolutionary Awareness

    Directory of Open Access Journals (Sweden)

    Gregory Gorelik

    2014-10-01

    Full Text Available In this article, we advance the concept of “evolutionary awareness,” a metacognitive framework that examines human thought and emotion from a naturalistic, evolutionary perspective. We begin by discussing the evolution and current functioning of the moral foundations on which our framework rests. Next, we discuss the possible applications of such an evolutionarily-informed ethical framework to several domains of human behavior, namely: sexual maturation, mate attraction, intrasexual competition, culture, and the separation between various academic disciplines. Finally, we discuss ways in which an evolutionary awareness can inform our cross-generational activities—which we refer to as “intergenerational extended phenotypes”—by helping us to construct a better future for ourselves, for other sentient beings, and for our environment.

  12. Evolutionary macroecology

    Directory of Open Access Journals (Sweden)

    José Alexandre F. Diniz-Filho

    2013-10-01

    Full Text Available Macroecology focuses on ecological questions at broad spatial and temporal scales, providing a statistical description of patterns in species abundance, distribution and diversity. More recently, historical components of these patterns have begun to be investigated more deeply. We tentatively refer to the practice of explicitly taking species history into account, both analytically and conceptually, as ‘evolutionary macroecology’. We discuss how the evolutionary dimension can be incorporated into macroecology through two orthogonal and complementary data types: fossils and phylogenies. Research traditions dealing with these data have developed more‐or‐less independently over the last 20–30 years, but merging them will help elucidate the historical components of diversity gradients and the evolutionary dynamics of species’ traits. Here we highlight conceptual and methodological advances in merging these two research traditions and review the viewpoints and toolboxes that can, in combination, help address patterns and unveil processes at temporal and spatial macro‐scales.

  13. Evolutionary awareness.

    Science.gov (United States)

    Gorelik, Gregory; Shackelford, Todd K

    2014-08-27

    In this article, we advance the concept of "evolutionary awareness," a metacognitive framework that examines human thought and emotion from a naturalistic, evolutionary perspective. We begin by discussing the evolution and current functioning of the moral foundations on which our framework rests. Next, we discuss the possible applications of such an evolutionarily-informed ethical framework to several domains of human behavior, namely: sexual maturation, mate attraction, intrasexual competition, culture, and the separation between various academic disciplines. Finally, we discuss ways in which an evolutionary awareness can inform our cross-generational activities-which we refer to as "intergenerational extended phenotypes"-by helping us to construct a better future for ourselves, for other sentient beings, and for our environment.

  14. Evolutionary Expectations

    DEFF Research Database (Denmark)

    Nash, Ulrik William

    2014-01-01

    The concept of evolutionary expectations descends from cue learning psychology, synthesizing ideas on rational expectations with ideas on bounded rationality, to provide support for these ideas simultaneously. Evolutionary expectations are rational, but within cognitive bounds. Moreover......, they are correlated among people who share environments because these individuals satisfice within their cognitive bounds by using cues in order of validity, as opposed to using cues arbitrarily. Any difference in expectations thereby arise from differences in cognitive ability, because two individuals with identical...... expectations emphasizes not only that causal structure changes are common in social systems but also that causal structures in social systems, and expectations about them, develop together....

  15. The Application of Multi-objective Evolutionary Algorithm in Collaborative Vehicle Routing%分区域多目标进化算法在协同车辆路径问题中的应用

    Institute of Scientific and Technical Information of China (English)

    谢桂芩; 涂井先

    2011-01-01

    To minimize the total cost of vehicle transport and to satisfy customers, it proposed a new mathematical model for multi-objective optimization of Multi-Depot collaborative vehicle routing with time windows in logistics. For the sake of this multi-objective optimization, a multi-objective evolutionary algorithm, based on decomposition, was adopted. In this algorithm, a new encoding method, which was beneficial to producing feasible individual, was presented. The efficiency of the algorithm was improved due to the perfect encoding. Finally, a test was carried out. The results show that the proposed model can solve effectively the problem of collaborative vehicle routing in logistics.%在以原有的车辆配送总费用最小化为目标的基础上,兼顾顾客的满意度目标,建立带有时间窗的多物流中心协同配送的车辆路径多目标优化问题的数学模型.对建立的多目标优化问题,采用分区域多目标进化算法思想,构造了利于产生可行解的编码方式,从而提高算法的运行效率.通过算例验证了建立的模型能有效地解决协同物流配送车辆路径问题.

  16. 基于变权重法的Pareto轨迹多目标进化算法%A multiobjective evolutionary algorithm based on weighted sum approach and tracing pareto method

    Institute of Scientific and Technical Information of China (English)

    唐卫东; 关志华; 吴中元

    2002-01-01

    大多数现有的多目标进化算法(MOEA-Multiobjective Evolutionary Algorithm)都是基于Pareto机制的,如NPGA(Niched Pareto Genetic Algorithm),NSGA(Non-dominated Sorting Genetic Algorithm)等.这些算法的每一个循环都要对种群中的部分或全部个体进行排序或比较,计算量很大.文中介绍了一种基于变权重线性加权的Pareto轨迹法-WSTPEA(Weighted Sum Approach and Tracing Pareto Method),该算法不是同时求得所有可能的非劣解,而是每执行一个循环步骤求得一个非劣解,通过权重变化次数控制算法循环的次数,从而使整个种群遍历Pareto曲线(面).文中给出了算法的详细描述和流程图,并且对两个实验测试问题进行了计算,最后对结果进行了分析.

  17. Search Strategy of Focused Crawler Based on Adaptive Immune Evolutionary Algorithm%基于自适应免疫进化算法的聚焦爬虫搜索策略

    Institute of Scientific and Technical Information of China (English)

    刘丽杰; 许楠; 李盼池

    2012-01-01

    聚焦爬虫是主题搜索引擎的核心部件。针对目前聚焦爬虫搜索策略的不足,提出基于主题相关度和页面重要性相结合的综合相关度来判别页面主题相关性,并采用自适应免疫进化算法这种搜索策略指导聚焦爬虫的爬行,实验结果证明,该算法下载的主题相关网页数所占比例明显高于最佳搜索和广度优先搜索算法的比例,具有更高的搜索效率。%Focused crawler was a core component of the topic search engine.To overcome the deficiency of focused crawler search strategy,a comprehensive value based on theme relevance and importance of page was proposed to determine the topic relevant of the page,and the adaptive immune evolutionary algorithm of this search strategy was used to guide the crawling strategy of focused crawler.The experiment results showed that the algorithm download the proportion to the number of webpage related to the themes was higher significantly than the best search and breadth first search algorithm and had higher searching efficiency.

  18. 量子进化算法在柔性作业车间调度问题中的应用%Quantum Evolutionary Algorithm for Flexible Job-Shop Scheduling Problems

    Institute of Scientific and Technical Information of China (English)

    张建明; 顾幸生

    2012-01-01

    In this paper, a quantum evolutionary algorithm is proposed for flexible job-shop scheduling problems with the objective to minimize the makespan. Aiming at the features of the flexible job-shop scheduling problems, both the working-procedures-based encoding method and the machine-based decoding method are proposed. Moreover, dynamic rotation angle and jumping gens operator are utilized in the proposed algorithm. Finally, simulation results are provided to demonstrate the effectiveness and the applicability of the proposed algorithm.%针对柔性作业车间调度完工时间最小化问题,提出了一种基于量子计算的量子进化算法。根据柔性作业车间调度问题的特点,设计出基于工序编码和基于机器编码的量子编码及解码方法。引入动态旋转角策略和跳跃基因算子,并通过实例验证了算法的有效性。

  19. Evolutionary medicine.

    Science.gov (United States)

    Swynghedauw, B

    2004-04-01

    Nothing in biology makes sense except in the light of evolution. Evolutionary, or darwinian, medicine takes the view that contemporary diseases result from incompatibility between the conditions under which the evolutionary pressure had modified our genetic endowment and the lifestyle and dietary habits in which we are currently living, including the enhanced lifespan, the changes in dietary habits and the lack of physical activity. An evolutionary trait express a genetic polymorphism which finally improve fitness, it needs million years to become functional. A limited genetic diversity is a necessary prerequisite for evolutionary medicine. Nevertheless, search for a genetic endowment would become nearly impossible if the human races were genetically different. From a genetic point of view, homo sapiens, is homogeneous, and the so-called human races have only a socio-economic definition. Historically, Heart Failure, HF, had an infectious origin and resulted from mechanical overload which triggered mechanoconversion by using phylogenically ancient pleiotropic pathways. Adaptation was mainly caused by negative inotropism. Recently, HF was caused by a complex remodelling caused by the trophic effects of mechanics, ischemia, senescence, diabetes and, neurohormones. The generally admitted hypothesis is that cancers were largely caused by a combination of modern reproductive and dietary lifestyles mismatched with genotypic traits, plus the longer time available for a confrontation. Such a concept is illustrated for skin and breast cancers, and also for the link between cancer risk and dietary habits.

  20. An Improved Quantum-inspired Evolutionary Algorithm for Solving the Travelling Salesman Problem%改进的量子进化算法及其在TSP问题中的应用

    Institute of Scientific and Technical Information of China (English)

    杨丽; 李平; 秦亚玲

    2006-01-01

    针对量子进化算法(Quantum-inspired Evolutionary Algorithm,QEA),在解决实际问题中遇到的困难,提出一种改进的量子进化算法,应用于求解旅行商问题(Travelling Salesman Problem,TSP),并提出了TSP中的Hamilton圈的随机搜索编码技术.通过求解TSP问题库中的部分问题,表明改进的算法比经典的量子进化算法及免疫遗传算法具有更快的收敛速度和更好的全局寻优能力.

  1. Evolutionary constrained optimization

    CERN Document Server

    Deb, Kalyanmoy

    2015-01-01

    This book makes available a self-contained collection of modern research addressing the general constrained optimization problems using evolutionary algorithms. Broadly the topics covered include constraint handling for single and multi-objective optimizations; penalty function based methodology; multi-objective based methodology; new constraint handling mechanism; hybrid methodology; scaling issues in constrained optimization; design of scalable test problems; parameter adaptation in constrained optimization; handling of integer, discrete and mix variables in addition to continuous variables; application of constraint handling techniques to real-world problems; and constrained optimization in dynamic environment. There is also a separate chapter on hybrid optimization, which is gaining lots of popularity nowadays due to its capability of bridging the gap between evolutionary and classical optimization. The material in the book is useful to researchers, novice, and experts alike. The book will also be useful...

  2. An adaptive multi-objective evolutionary algorithm directed by objective space decomposition%基于目标空间分解的自适应多目标进化算法

    Institute of Scientific and Technical Information of China (English)

    郑金华; 张作峰; 邹娟

    2013-01-01

    Aiming at solving the matching problem of individual and sub-problem of the multi-objective evolutionary algorithm based on decomposition (MOEA/D),the paper proposes an adaptive multi-objective evolutionary algorithm directed by objective space decomposition (MOEA/OSD) based on the evolution analysis of the MOEA/D.The MOEA/OSD decomposes an objective space by even spread weight vectors whose start points are the reference points,chooses a suitable sub-problem by using the information of individuals,and uses auxiliary weight vectors to compensate for the limitations of the decomposition approaches.The experimental results demonstrates that the MOEA/OSD could not only balance the convergence and diversity effectively but also approach the optimal solution by applying different decomposition approaches,and has a better convergence speed.%针对基于分解的多目标进化算法(MOEA/D)个体与子问题的匹配问题,在分析MOEA/D的进化规律的基础上,提出了一种基于目标空间分解的自适应多目标进化算法(MOEA/OSD).该算法采用以测试问题的参考点为起点的均匀权重向量分解目标空间,根据个体信息动态选择适合的子问题,并使用辅助向量的方法弥补分解方法的不足.对比实验结果表明,MOEA/OSD拥有较好的收敛性和分布性,采用不同的分解方法均能搜索到最优解,且具有较好的收敛速度.

  3. 一类带约束动态多目标优化问题的进化算法%Evolutionary algorithm for class of constrained dynamic multi-objective optimization problems

    Institute of Scientific and Technical Information of China (English)

    杨亚强; 刘淳安

    2012-01-01

    Dynamic multi-objective constrained optimization problem is a kind of NP-hard problem. The rank and the scalar constraint violation of the individual for evolution population under the dynamic environments are defined. Based on the two definitions, a new selection operator is presented. Based on an environment changing operator, a new dynamic constrained multi-objective optimization evolutionary algorithm, which is used to solve a class of constrained dynamic multi-objective optimization problems in which the environment variable is defined on the positive integer set, is given. The proposed algorithm has been tested on two constrained dynamic multi-objective optimization benchmark problems. The results obtained have been compared with the other algorithm. Simulations demonstrate the new algorithm can obtain good quality and uniformed distribution solution set in different environments for constrained dynamic multi-objective optimization problems.%动态多目标约束优化问题是一类NP-Hard问题,定义了动态环境下进化种群中个体的序值和个体的约束度,结合这两个定义给出了一种选择算子.在一种环境变化判断算子下给出了求解环境变量取值于正整数集Z+的一类带约束动态多目标优化问题的进化算法.通过几个典型的Benchmark函数对算法的性能进行了测试,其结果表明新算法能够较好地求出带约束动态多目标优化问题在不同环境下质量较好、分布较均匀的Pareto最优解集.

  4. Improved evolutionary algorithm with learning strategy for the flexible job-shop scheduling problem%带学习策略的遗传算法求解柔性作业调度问题

    Institute of Scientific and Technical Information of China (English)

    王公堂; 许化强

    2011-01-01

    There are some common traits between different best chromosomes.If these traits can be identified during evolution and be copied to the offspring,the later population will have a high quality and the efficiency of algorithm will be enhanced.Based on the analysis of the characteristics of the flexible job-shop problem,the symbiotic evolutionary algorithm was improved and was added with learning strategy.So offspring can inherit best traits of parent generation with high efficiency.The improved algorithm is tested on instances taken from the literature and compared with their results.The results show that the proposed algorithm outperformed in solution quality.%多个不同最优染色体之间存在许多共有特征,如果进化过程中能识别这些优秀特征并尽可能遗传到后代个体中,则可以改善后代种群质量,加快遗传算法的收敛速度。在分析柔性作业调度问题的基础上,采用共生遗传算法并加入学习策略进行改进,在进化过程中学习父代优秀特征并指导后代的进化。通过实验测试,并与其他文献中的结果进行比较,表明改进算法在解的质量上有较好的效果。

  5. Distributed Evolutionary Graph Partitioning

    CERN Document Server

    Sanders, Peter

    2011-01-01

    We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw's well known benchmark tables we are able to improve or recompute 76% of entries for the tables with 1%, 3% and 5% imbalance.

  6. 基于Pareto解集关联与预测的动态多目标进化算法%A dynamic multi-objective evolutionary algorithm based on Pareto set linkage and prediction

    Institute of Scientific and Technical Information of China (English)

    彭星光; 徐德民; 高晓光

    2011-01-01

    In order to solve dynamic multi-objective optimization problem(DMOPs), a dynamic multi-objective evolutionary algorithm based on Pareto set linkage and prediction(LP-DMOEA) is proposed and a Pareto set linking method based on hyperboxis designed. In this scheme, several time sequences which present the trend of Pareto solutions can be dynamically maintained. Based on the prediction of these time sequences, the initial population is generated. The LP-DMOEA is applied to the NSGA2 algorithm to solve three benchmark problems. Computational results show the effectiveness of the LPDMOEA to solve DMOPs.%针对动态多目标优化问题,提出一种基于Pareto解集关联与预测的动态多目标进化算法(LP-DMOEA),设计了基于超块的Pareto解集关联方法.该方法能够动态维护若十描述Pareto解变化规律的时间序列,通过对新环境下的Pareto解集进行预测来生成初始种群.将LP-DMOEA应用于非劣分类遗传算法(NSGA2),并对3类标准测试函数进行了实验,所得结果表明该方法能够有效求解动态优化问题.

  7. 基于模糊进化算法的建筑工程进度优化研究%Study on the construction schedule optimization based on fuzzy-evolutionary algorithm

    Institute of Scientific and Technical Information of China (English)

    刘泽; 赵胜利; 王晓燕

    2012-01-01

    In view of the uncertainty of building construction, fuzzy due date is denoted by six-point fuzzy numbers through the introduction of fuzzy mathematics. Based on the objective to maximize the clients' satisfaction degree and the reliability of the optimization result, the mathematical model for fuzzy resource-constrained project scheduling is established. By use of the evolutionary algorithm, the optimization of project progress under the limited resource is studied. The result of the computational experiment shows the algorithm is effective and feasible.%针对建筑工程施工工期的不确定性,引入模糊数学理论,采用6点模糊数表示工期.以建设单位对优化工期的满意度和可靠性作为优化目标,建立资源受限条件下施工进度数学优化模型,利用进化算法对施工进度进行优化.通过建筑工程实例,证明了本研究设计的算法的有效性和可行性.

  8. Integrated navigation system filter algorithms based on evolutionary artificial neural networks%基于进化人工神经网络的组合系统滤波技术

    Institute of Scientific and Technical Information of China (English)

    徐晓苏; 刘建娟

    2008-01-01

    在组合系统运用Kalman滤波器技术时,准确的系统模型和可靠的观测数据是保证其性能的重要因素,否则将大大降低Kalman滤波器的估计精度,甚至导致滤波器发散.为解决上述Kalman应用中的实际问题,提出了一种新颖的基于进化人工神经网络技术的自适应Kalman滤波器.仿真试验表明该算法可以在系统模型不准确时、甚至外部观测数据短暂中断时,仍能保证Kalman滤波器的性能.%The performance of Kalman filter in integrated navigation system depends on accurate system model and reliable observation data. Inaccurate system model or trustless observation data will cause low precision of Kalman filter, and even lead filter to divergence. So a new adaptive Kalman filter based on evolutionary artificial neural networks is used in this system. The algorithm is tested by simulations, and the results indicate that the proposed algorithm can efficiently overcome the shortcomings of traditional Kalman filter with better accuracy.

  9. 一种基于簇类进化的电力经济负荷分配优化算法%A Cluster Evolutionary Algorithm for Power System Economic Load Dispatch Optimization

    Institute of Scientific and Technical Information of China (English)

    陈皓; 潘晓英; 张洁

    2016-01-01

    In electric power system ,economic load dispatch (ELD) is an important topic ,which can not only help to build up safety and stable operation plans and prolong the service life of generating units but also can save energy and maximize the economic benefits of power enterprise .The practical ELD problem has non‐smooth cost function with nonlinear constraints which make it difficult to be effectively solved .In this study ,a novel global optimization algorithm ,cluster evolutionary algorithm (CEA ) , is proposed to solve ELD problem . In CEA , a virtual cluster organization has been constructed among individuals in order to dynamically adjust the searching process of simulated evolutionary system and improve the optimization efficiency of population .In simulations ,the CEA has been applied to 13 testing functions and 3 IEEE testing systems for verifying its feasibility .The experiments have shown the CEA can get high quality solutions with lesser computation cost for 13 testing functions .Compared with the other existing techniques ,the proposed algorithm has shown better performance for 3 IEEE systems .Considering the quality of the solution obtained ,this method seems to be a promising alternative approach for solving the ELD problem in practical power system .%电力经济负荷分配不仅能保证电力系统安全稳定地运行、延长机组使用寿命,还能节省能源,最大化电力企业的经济效益.此类问题可归为一种具有高维、不可微目标函数及多个非线性约束的数值优化问题.提出了一种新型的全局优化算法———簇类进化算法(cluster evolutionary algorithm ,CEA ),并将其应用于求解ELD问题.CEA利用聚类过程在进化个体间构建一定结构的连接关系,并利用这种虚拟的簇类化组织来协调和控制系统的优化计算过程,提高群体的问题空间搜索效率以及抗早熟能力.在仿真实验中13个典型测试函数和3个IEEE系统被

  10. Bee evolutionary genetic algorithm for reactive power optimization in power systems%基于蜜蜂进化型遗传算法的电力系统无功优化

    Institute of Scientific and Technical Information of China (English)

    杨晨; 宗晓萍

    2013-01-01

    A method based on bee evolution modifying genetic algorithm(BEGA)is presented for power system reactive power optimization. In this algorithm, the best chromosome called queen-bee among the current population is crossover with drones selected according to a certain crossover probability, which enhances the exploitation of searching global optimum. In order to avoid premature convergence, BEGA introduces a random population that extends search area. Consequentially it keeps the diversity of population. The presented method has been tested in IEEE6 bus systems, compared with other algorithms, the results show that: the ability of overall searching optimal solution is better and convergence speed is higher.%采用蜜蜂进化机制与遗传算法相结合的蜜蜂进化型遗传算法(bee evolutionary genetic algo-rithm,BEGA)对电力系统进行无功优化计算.该算法以一定概率将蜂王(最优个体)与雄蜂(被选的个体)2部分进行交叉,因此对最优个体包含信息的开采能力得以增强.随机种群的引入,降低了算法出现过早收敛的可能性,保持了种群多样性.应用BEGA对IEEE6节点系统进行无功优化计算的结果表明:较其他算法,BEGA具有更强的全局寻优能力和更快的收敛速度.

  11. 基于量子行为进化算法的聚焦爬虫搜索策略%Search strategy of focused crawler based on Bloch quantum evolutionary algorithm

    Institute of Scientific and Technical Information of China (English)

    刘丽杰; 李盼池; 张强

    2012-01-01

    According to the single value evaluation focused crawler search strategy has the topic drift problem, and make full use of the intelligence of the Bloch quantum evolutionary algorithm ( BQEA ) , this paper proposed a new algorithm of focused crawler. The algorithm integrated Web distribution on the Internet fully, used the advantages of two types of evaluation criteria of the immediate value and the future value adjusted to the proportion of two standards online in the integrated value, according to focused crawler search on the actual process. The experimental result by simulation show that, compared with the search strategy of a single value, the BQEA obtains a higher recall rate, and precision rate and can solve the existing problems with certain self-adaptive.%针对单一价值评价的聚焦爬虫搜索策略存在主题漂移等问题进行了研究,充分利用量子进化算法所具有的智能性,提出一种新的聚焦爬虫爬行算法.该算法充分结合网页在互联网上的分布特点,利用立即价值和未来价值两类评价标准的优势,根据聚焦爬虫实际运行过程中的搜索情况,在线调整这两种标准在综合价值中的比重.实验仿真结果表明,相对于单一价值的搜索策略,量子进化算法获得较高的页面查全率和信息查准率,能较好地解决现存问题,具有一定的自适应性.

  12. Evolutionary computation for dynamic optimization problems

    CERN Document Server

    Yao, Xin

    2013-01-01

    This book provides a compilation on the state-of-the-art and recent advances of evolutionary computation for dynamic optimization problems. The motivation for this book arises from the fact that many real-world optimization problems and engineering systems are subject to dynamic environments, where changes occur over time. Key issues for addressing dynamic optimization problems in evolutionary computation, including fundamentals, algorithm design, theoretical analysis, and real-world applications, are presented. "Evolutionary Computation for Dynamic Optimization Problems" is a valuable reference to scientists, researchers, professionals and students in the field of engineering and science, particularly in the areas of computational intelligence, nature- and bio-inspired computing, and evolutionary computation.

  13. Evolutionary thinking

    OpenAIRE

    Hunt, Tam

    2015-01-01

    Evolution as an idea has a lengthy history, even though the idea of evolution is generally associated with Darwin today. Rebecca Stott provides an engaging and thoughtful overview of this history of evolutionary thinking in her 2013 book, Darwin's Ghosts: The Secret History of Evolution. Since Darwin, the debate over evolution—both how it takes place and, in a long war of words with religiously-oriented thinkers, whether it takes place—has been sustained and heated. A growing share of this de...

  14. Wang Tiles Texture Synthesis utilizing Bee Evolutionary Genetic Algorithm%基于蜜蜂进化型遗传算法的Wang tiles纹理合成

    Institute of Scientific and Technical Information of China (English)

    孙涛; 徐蔚鸿

    2012-01-01

    In texture synthesis process,the thesis introduces Bee Evolution Genetic Algorithm,and uses the BEGA to realize global optimization of the sample texture selection,and solve diamond juncture problem in the synthesized textures.Therefore,and the quality of Tile sets is improved,and the synthesis speed is grown up.Through the experiment,make the ideal synthetic effect.%在基于Wang Tiles的纹理合成中引入蜜蜂进化型遗传算法,用它来实现样本纹理块选择的全局优化,解决纹理合成出现的菱形接缝问题,提高了Wang Tile集的质量,加快了合成速度。通过实验得到了理想的合成效果。

  15. Improved multi-objective evolutionary algorithm for optimization control in greenhouse environment%基于改进多目标进化算法的温室环境优化控制

    Institute of Scientific and Technical Information of China (English)

    王立舒; 侯涛; 姜淼

    2014-01-01

    A greenhouse environment control system plays a decisive role in greenhouse production processes and is a complex system to control. This paper provides an overview of a greenhouse control system and control technologies. We investigated the issue of a greenhouse climate control system based on temperature and humidity, and formulated a greenhouse climate dynamic model. The control strategy was presented for the dynamic model made use of conventional Proportional Integral and Derivative (PID) control algorithms in which it combined with an modified multi-objective evolutionary algorithm (MNSEA-II) based on NSGA-II. In MNSEA-II, mixed mutation strategy and local search strategy were utilized to tune two PID controller parameters, and the integrated time square error (ITSE) was considered as one of performance criteria. The mixed mutation strategy based on game theory could utilize adaptively the advantages of a different mutation operator to maintain the globe search capacity of population for a diversity of Pareto solutions, and the local search strategy could speed the convergence of algorithms to achieve more precise solutions. The mixed mutation strategy and the local search strategy could obtain an equilibrium between the diversity and precision of Pareto solutions. An evolutionary optimization process was employed to approximate the set of Pareto solutions, which was used to tune PID controller parameters to achieve good control performance. The tuning scheme has been tested for greenhouse climate control by minimizing ITSE and control increment or rate in a simulation system. Simulation results showed the effectiveness and usability of the proposed method for step responses. The obtained gains were applied in PID controllers and could achieve good control performance such as small overshoot, fast settling time, and less rise time and steady state error. The proposed optimization method offers an effective way to implement simple but robust solutions providing

  16. Evolutionary Computation and Its Applications in Neural and Fuzzy Systems

    Directory of Open Access Journals (Sweden)

    Biaobiao Zhang

    2011-01-01

    Full Text Available Neural networks and fuzzy systems are two soft-computing paradigms for system modelling. Adapting a neural or fuzzy system requires to solve two optimization problems: structural optimization and parametric optimization. Structural optimization is a discrete optimization problem which is very hard to solve using conventional optimization techniques. Parametric optimization can be solved using conventional optimization techniques, but the solution may be easily trapped at a bad local optimum. Evolutionary computation is a general-purpose stochastic global optimization approach under the universally accepted neo-Darwinian paradigm, which is a combination of the classical Darwinian evolutionary theory, the selectionism of Weismann, and the genetics of Mendel. Evolutionary algorithms are a major approach to adaptation and optimization. In this paper, we first introduce evolutionary algorithms with emphasis on genetic algorithms and evolutionary strategies. Other evolutionary algorithms such as genetic programming, evolutionary programming, particle swarm optimization, immune algorithm, and ant colony optimization are also described. Some topics pertaining to evolutionary algorithms are also discussed, and a comparison between evolutionary algorithms and simulated annealing is made. Finally, the application of EAs to the learning of neural networks as well as to the structural and parametric adaptations of fuzzy systems is also detailed.

  17. Evolutionary optimization of optical antennas

    CERN Document Server

    Feichtner, Thorsten; Kiunke, Markus; Hecht, Bert

    2012-01-01

    The design of nano-antennas is so far mainly inspired by radio-frequency technology. However, material properties and experimental settings need to be reconsidered at optical frequencies, which entails the need for alternative optimal antenna designs. Here a checkerboard-type, initially random array of gold cubes is subjected to evolutionary optimization. To illustrate the power of the approach we demonstrate that by optimizing the near-field intensity enhancement the evolutionary algorithm finds a new antenna geometry, essentially a split-ring/two-wire antenna hybrid which surpasses by far the performance of a conventional gap antenna by shifting the n=1 split-ring resonance into the optical regime.

  18. Evolutionary Dynamics of Biological Games

    Science.gov (United States)

    Nowak, Martin A.; Sigmund, Karl

    2004-02-01

    Darwinian dynamics based on mutation and selection form the core of mathematical models for adaptation and coevolution of biological populations. The evolutionary outcome is often not a fitness-maximizing equilibrium but can include oscillations and chaos. For studying frequency-dependent selection, game-theoretic arguments are more appropriate than optimization algorithms. Replicator and adaptive dynamics describe short- and long-term evolution in phenotype space and have found applications ranging from animal behavior and ecology to speciation, macroevolution, and human language. Evolutionary game theory is an essential component of a mathematical and computational approach to biology.

  19. Fault restoration of multi-objective distribution system based on multi-Agent evolutionary algorithm%基于多Agent演化算法的多目标配电网故障恢复

    Institute of Scientific and Technical Information of China (English)

    杨丽君; 刘建超; 卢志刚; 曹良晶

    2012-01-01

    针对大规模配电系统,定义了配电网运行均衡度指标,在完成重要负荷的优先恢复基础上,尽可能多地恢复失电负荷,再综合考虑配电网运行均衡度与网损两方面,建立了配电网多目标故障恢复数学模型.提出一种基于多Agent演化思想的多目标配电网故障恢复算法,每个目标作为一个代理(AG),代理(AG)拥有各自的演化群体,以各自的单个目标作为演化过程中的评价函数,在寻优过程中协调代理(CAG)将代理(AG)发送过来的最优解的概率分布进行合成,然后再发回给单个代理(AG),作为产生下一代解的依据.算例表明,该方法在很少的演化代数内将解群体收敛到Pareto最优解集,证明了该方法的高效性和实用性.%For large-scale distribution system, the index of equilibrium degree of distribution system is defined. On the basis of giving priority to restoring important load, the lost power load is restored as much as possible. Then a multi-objective distribution system restoration model is established by considering the equilibrium degree of distribution system and power loss. This paper proposes a multi-Agent evolutionary algorithm for the multi-objective restoration of distribution system network. Each objective function is an Agent, and every Agent has its own evolution groups and takes the individual objective as the evaluation function for the evolution. In the optimization process, the coordination agent synthesizes the probability distribution of the optimal solution which is sent by every single agent, and then sents the results back to each agent as the basis for generating the next generation of solutions. Example shows that the method can converge solutions to the Pareto optimal solution set via a few evolutionary algorithm, proving that the method is highly effective and practical.

  20. Neurocontroller analysis via evolutionary network minimization.

    Science.gov (United States)

    Ganon, Zohar; Keinan, Alon; Ruppin, Eytan

    2006-01-01

    This study presents a new evolutionary network minimization (ENM) algorithm. Neurocontroller minimization is beneficial for finding small parsimonious networks that permit a better understanding of their workings. The ENM algorithm is specifically geared to an evolutionary agents setup, as it does not require any explicit supervised training error, and is very easily incorporated in current evolutionary algorithms. ENM is based on a standard genetic algorithm with an additional step during reproduction in which synaptic connections are irreversibly eliminated. It receives as input a successfully evolved neurocontroller and aims to output a pruned neurocontroller, while maintaining the original fitness level. The small neurocontrollers produced by ENM provide upper bounds on the neurocontroller size needed to perform a given task successfully, and can provide for more effcient hardware implementations.

  1. Evolutionary engineering for industrial microbiology.

    Science.gov (United States)

    Vanee, Niti; Fisher, Adam B; Fong, Stephen S

    2012-01-01

    Superficially, evolutionary engineering is a paradoxical field that balances competing interests. In natural settings, evolution iteratively selects and enriches subpopulations that are best adapted to a particular ecological niche using random processes such as genetic mutation. In engineering desired approaches utilize rational prospective design to address targeted problems. When considering details of evolutionary and engineering processes, more commonality can be found. Engineering relies on detailed knowledge of the problem parameters and design properties in order to predict design outcomes that would be an optimized solution. When detailed knowledge of a system is lacking, engineers often employ algorithmic search strategies to identify empirical solutions. Evolution epitomizes this iterative optimization by continuously diversifying design options from a parental design, and then selecting the progeny designs that represent satisfactory solutions. In this chapter, the technique of applying the natural principles of evolution to engineer microbes for industrial applications is discussed to highlight the challenges and principles of evolutionary engineering.

  2. Aplicación de un Algoritmo Evolutivo en la Solución de Problemas Job Shop-Open Shop Application of an Evolutionary Algorithm to solve Job Shop-Open Shop Problems

    Directory of Open Access Journals (Sweden)

    Omar D Castrillón

    2011-01-01

    Full Text Available El objetivo del trabajo que se presenta fue disminuir el tiempo de proceso y el tiempo muerto, y aumentar la utilización de las máquinas, en un ambiente Job Shop-Open Shop, usando una nueva metodología basada en un algoritmo evolutivo. El estudio se realizó en una empresa del sector metalmecánico. La metodología propuesta es fácil de replicar y los resultados obtenidos son altamente consistentes, como se demuestra con un análisis de varianza realizado. Con la metodología propuesta se logró reducir el tiempo total de proceso en un 33% y el tiempo muerto en un 51% con una aproximación del 99%, respecto a la solución óptima estimada.The aim of the work presented in this paper was to reduce makespan time and idle time, and to increase machine utilization, in Job Shop-Open Shop environment, using a new methodology based on evolutionary algorithms. The study was done in an enterprise of the metal-mechanics sector. The proposed methodology is easy to implement and apply and the results are highiy consistent, as shown by a variance analysis. The methodology allows reducing the total processing time by 33% and idle time by 51 % with 99% approximation with respect to the optimum solution.

  3. Evolutionary Information Theory

    OpenAIRE

    Mark Burgin

    2013-01-01

    Evolutionary information theory is a constructive approach that studies information in the context of evolutionary processes, which are ubiquitous in nature and society. In this paper, we develop foundations of evolutionary information theory, building several measures of evolutionary information and obtaining their properties. These measures are based on mathematical models of evolutionary computations, machines and automata. To measure evolutionary information in an invariant form, we const...

  4. Evolutionary Multiobjective Design Targeting a Field Programmable Transistor Array

    Science.gov (United States)

    Aguirre, Arturo Hernandez; Zebulum, Ricardo S.; Coello, Carlos Coello

    2004-01-01

    This paper introduces the ISPAES algorithm for circuit design targeting a Field Programmable Transistor Array (FPTA). The use of evolutionary algorithms is common in circuit design problems, where a single fitness function drives the evolution process. Frequently, the design problem is subject to several goals or operating constraints, thus, designing a suitable fitness function catching all requirements becomes an issue. Such a problem is amenable for multi-objective optimization, however, evolutionary algorithms lack an inherent mechanism for constraint handling. This paper introduces ISPAES, an evolutionary optimization algorithm enhanced with a constraint handling technique. Several design problems targeting a FPTA show the potential of our approach.

  5. Evolutionary developmental psychology

    National Research Council Canada - National Science Library

    King, Ashley C; Bjorklund, David F

    2010-01-01

    The field of evolutionary developmental psychology can potentially broaden the horizons of mainstream evolutionary psychology by combining the principles of Darwinian evolution by natural selection...

  6. Evolutionary Approaches to Expensive Optimisation

    Directory of Open Access Journals (Sweden)

    Maumita Bhattacharya

    2013-03-01

    Full Text Available Surrogate assisted evolutionary algorithms (EA are rapidly gaining popularity where applications of EA in complex real world problem domains are concerned. Although EAs are powerful global optimizers, finding optimal solution to complex high dimensional, multimodal problems often require very expensive fitness function evaluations. Needless to say, this could brand any population-based iterative optimization technique to be the most crippling choice to handle such problems. Use of approximate model or surrogates provides a much cheaper option. However, naturally this cheaper option comes with its own price! This paper discusses some of the key issues involved with use of approximation in evolutionary algorithm, possible best practices and solutions. Answers to the following questions have been sought: what type of fitness approximation to be used; which approximation model to use; how to integrate the approximation model in EA; how much approximation to use; and how to ensure reliable approximation.

  7. Network Source Active Enhancement Algorithm Based on PSO Hierarchical Evolutionary%基于PSO递阶进化的网络资源活跃度增强算法

    Institute of Scientific and Technical Information of China (English)

    侯贵法; 常国权

    2015-01-01

    为了提高云计算环境下网络资源访问和调度能力,需要增强网络资源的活跃度,传统方法采用源信息系统最小方差粒子群优化算法实现资源活跃度增强调度,直接交互式多源信息的缺陷,导致信息访问的滞后和时延.提出一种基于粒子群(PSO)递阶进化的多出口网络资源活跃度增强算法,构建多出口网络资源调度和网络系统结构,粒子群进化按照属性的数据波动进行递阶分层,得到一个资源数据聚类的高密度区域,使得每一个初始种群中的个体都应有一个解,在多波束搜索PSO空间中实现粒子群PSO递阶进化,提高网络资源访问的活跃度.仿真实验表明,采用该算法,能避免粒子群在进行网络资源搜索调度过程中陷入局部最优,有效提高控制搜索精度,运行时间较短,能有效增强多出口网络资源的活跃度,进而提高了资源搜索成功率.%In order to improve the cloud computing cyber source access and scheduling capability of environment, the need to strengthen the cyber source activity, the traditional method is using the source information system minimum variance of particle swarm optimization algorithm for resource scheduling activity enhancement, defect directly interactive multiple source information, resulting in information access delay and delay. Proposed one kind based on Particle Swarm (PSO) ex-port more network resources hierarchical evolutionary liveness enhancement algorithm, constructing multi export network resource scheduling and network system structure, particle swarm optimization for hierarchical data according to the fluctu-ation property, get a resource data clustering of the high-density region, so that each individual in the initial population there should be a solution, in a multi beam search implementation of particle swarm PSO hierarchical evolutionary PSO space, improve the network resource access activity. Simulation results show that using this

  8. Evolutionary Dynamics of Biological Games

    OpenAIRE

    Nowak, M. A.; Sigmund, K.

    2004-01-01

    Darwinian dynamics based on mutation and selection from the core of mathematical models for adaptation and coevolution of biological populations. The evolutionary outcome is often not a fitness-maximizing equilibrium but can include oscillations and chaos. For studying frequency-dependent selection, game-theoretic arguments are more appropriate than optimization algorithms. Replicator and adaptive dynamics describe short-and long-term evolution in phenotype space and have found applications r...

  9. Parallel Evolutionary Modeling for Nonlinear Ordinary Differential Equations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    We introduce a new parallel evolutionary algorithm in modeling dynamic systems by nonlinear higher-order ordinary differential equations (NHODEs). The NHODEs models are much more universal than the traditional linear models. In order to accelerate the modeling process, we propose and realize a parallel evolutionary algorithm using distributed CORBA object on the heterogeneous networking. Some numerical experiments show that the new algorithm is feasible and efficient.

  10. Research on Large- scale Project Portfolio Management Model Based on Cooperative Co- evolutionary Genetic Algorithm%基于合作协同进化遗传算法的大型工程项目组合管理模型研究

    Institute of Scientific and Technical Information of China (English)

    李默; 王祖和; 杨彬

    2011-01-01

    Aiming at large-scale project portfolio management, a general project portfolio selection mathematical model wag set up based on analyzing the correction among benefit, resources, time and results of projects. The cooperative co evolutionary algorithm combined with genetic algorithm was applied to solve the project portfolio selection model. According to the project implementation phases, the algorithm decomposed those into different sub - populations, and sub - population coevolved with other sub - populations through cooperative co - evolutionary algorithm. Finally, effectiveness and practica bility of algorithm were proved by a case study.%针对大型工程项目组合管理问题,在分析工程项目组合中项目同收益、资源、工期和结果相关性的基础上,建立考虑相关性的工程项目组合选择数学模型.将合作协同进化算法与遗传算法相结合,应用于工程项目组合选择模型问题的求解,根据工程项目实施阶段划分不同的子种群,各子种群之间通过合作协同进化算法进行协调.最后,通过实例计算验证了算法的有效性和实用性.

  11. 基于实数编码量子进化算法的IIR数字滤波器优化设计%IIR digital filter optimization design based on read-coded quantum evolutionary algorithms

    Institute of Scientific and Technical Information of China (English)

    孙成发

    2013-01-01

    Based on optimization design for IIR digital filters being a multi-parameters and non-linear complex function optimization problem,a novel method of IIR digital filters optimization design is proposed,its core is that read-coded quantum evolutionary algorithms(RQEA)is applied on optimizing the interrelated parameters of IIR digital filters.In this paper, firstly,the maths model of IIR digital filter optimization design is proposed;secondly,the process of optimization design for IIR digital filters on the basis of RQEA is described in detail,final y,the validity and effectivenss of the introduced method are demonstrated by experimental results on the lowpass and highpass IIR digital filters.%  IIR数字滤波器设计的本质是求解多参数非线性复杂函数优化问题,提出应用实数编码量子进化算法优化IIR数字滤波器的相关参数,进而形成一种新的IIR数字滤波器优化设计方法。文中给出了IIR滤波器优化设计的数学模型,描述了应用实数编码量子进化算法优化设计IIR数字滤波器的具体实现步骤,并通过低通和高通IIR数字滤波器设计的仿真结果表明该方法的有效性和高效性。

  12. A Virus-Evolutionary Genetic Algorithm-Based Fast Air Vehicle Path Planning%基于病毒遗传算法的快速航迹规划方法

    Institute of Scientific and Technical Information of China (English)

    俞琪; 刘新; 周成平; 蔡超

    2011-01-01

    To enhance the real time planning ability of existing system , a fast path planning method based on virus-evolutionary genetic algorithm is proposed, the proposed method is aimed at improving the global step of a path planning method based on hierarchical strategy. The hierarchical planning method is used to efficiently handle path constraints by dividing the whole planning process into two steps : global planing and local planning. Employing a hierarchical strategy, this method may reduce the computation complexity. However it is well known that problems of premature and weakness in local searching exist in the genetic algorithm used in glohal planning. To overcome problems, the theory of virus-evolution is introduced into the global planning step. By designing a problem-specific representation of virus solutions and its virus infection operators ,the convergence performance and search efficiency are improved. Simulation results show that given the same path constraints our method can fast generate a satisfactory path.%为了提高现有航迹规划系统的实时规划能力,对基于分层策略的航迹规划方法中全局规划部分进行改进,提出了基于病毒遗传算法的快速规划方法.分层策略的航迹规划包括全局规划和局部规划,由于对不同性质的约束条件分阶段进行处理,该方法降低了航迹规划的计算复杂度.但全局规划采用的标准遗传算法仍存在早熟和局部收敛慢的问题.针对这些缺陷,采用病毒遗传算法进行改进.结合航迹规划的领域知识,给出了病毒种群的编码方法并设计了特定的病毒感染算子,使航迹寻优效率得以提高.仿真实验表明,在相同约束条件下,该方法能更快生成满足战术要求的航迹.

  13. WEEDS IDENTIFICATION USING EVOLUTIONARY ARTIFICIAL INTELLIGENCE ALGORITHM

    OpenAIRE

    2014-01-01

    In a world reached a population of six billion humans increasingly demand it for food, feed with a water shortage and the decline of agricultural land and the deterioration of the climate needs 1.5 billion hectares of agricultural land and in case of failure to combat pests needs about 4 billion hectares. Weeds represent 34% of the whole pests while insects, diseases and the deterioration of agricultural land present the remaining percentage. Weeds Identification has been one of the most inte...

  14. Designers' Cognitive Thinking Based on Evolutionary Algorithms

    OpenAIRE

    Zhang Shutao; Jianning Su; Chibing Hu; Peng Wang

    2013-01-01

    The research on cognitive thinking is important to construct the efficient intelligent design systems. But it is difficult to describe the model of cognitive thinking with reasonable mathematical theory. Based on the analysis of design strategy and innovative thinking, we investigated the design cognitive thinking model that included the external guide thinking of "width priority - depth priority" and the internal dominated thinking of "divergent thinking - convergent thinking", built a reaso...

  15. Efficient evolutionary algorithms for optimal control

    NARCIS (Netherlands)

    López Cruz, I.L.

    2002-01-01

    If optimal control problems are solved by means of gradient based local search methods, convergence to local solutions is likely. Recently, there has been an increasing interest in the use

  16. Fundamentals of natural computing basic concepts, algorithms, and applications

    CERN Document Server

    de Castro, Leandro Nunes

    2006-01-01

    Introduction A Small Sample of Ideas The Philosophy of Natural Computing The Three Branches: A Brief Overview When to Use Natural Computing Approaches Conceptualization General Concepts PART I - COMPUTING INSPIRED BY NATURE Evolutionary Computing Problem Solving as a Search Task Hill Climbing and Simulated Annealing Evolutionary Biology Evolutionary Computing The Other Main Evolutionary Algorithms From Evolutionary Biology to Computing Scope of Evolutionary Computing Neurocomputing The Nervous System Artif

  17. Evolutionary Computation for Realizing Distillation Separation Sequence Optimization Synthesis

    Institute of Scientific and Technical Information of China (English)

    Dong Hongguang; Qin Limin; Wang Kefeng; Yao Pingjing

    2005-01-01

    Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequence, and it is directly applied as the coding method. Genetic operators, which ensure to prohibit illegal filial generations completely, are designed by using the method of graph theory. The crossover operator based on a single parent or two parents is designed successfully. The example shows that the average ratio of search space from evolutionary algorithm with two-parent genetic operation is lower, whereas the rate of successful minimizations from evolutionary algorithm with single parent genetic operation is higher.

  18. 演化算法求解桁架多目标拓扑优化的收敛速度研究%A convergence speed study on evolutionary algorithms for solving truss multi-objective topology optimization

    Institute of Scientific and Technical Information of China (English)

    胡浩; 李刚

    2015-01-01

    Though evolutionary algorithms (EAs)are capable of satisfying the demands arising from the new advancements in structural topology optimization on global optimization,black-box function optimi-zation,combinatorial optimization and multi-objective optimization,the necessity of applying them to this field still depends on their convergence and computational efficiency simultaneously.This paper aims to reveal competent algorithms on these two aspects for stress constrained truss multi-objective topology optimization (MOTO)problems.We first propose a general method tailor-made for examining the convergence and efficiency of EAs on solving MOTO.The global optima of typical MOTO problems are rigorously derived using enumeration.Then multi-level convergence criteria are defined using hypervol-ume metric.The comparative study reveals outstanding EAs with greatest convergence speeds under different convergence requirement and the corresponding algorithmic mechanism.This way,this paper not only contributes to the theoretical foundation of solving MOTO problems using EAs,but also provides support for high efficiently solving practical engineering topology optimization problems.%演化算法能够同时满足结构拓扑优化的前沿领域对全局优化、黑箱函数优化、组合优化和多目标优化的需求,但采用此类算法的可行性与必要性由其收敛性与计算效率决定。本文以应力约束桁架多目标拓扑优化问题为求解对象,致力于揭示在收敛性与计算效率两方面具有竞争力的算法。首先提出评估演化算法求解拓扑优化问题收敛性与计算效率的通用方法,采用穷举法严格推导了典型桁架多目标拓扑优化问题的全局最优解,并采用超体积指标定义了多层次收敛性能准则。最后通过比较研究得到不同收敛性需求下具有最快收敛速度的演化算法,并揭示了具有竞争力的算法机制。本研究为演化算法求解多目标拓

  19. A Fuzzy Associative Classification Method Based on Multi-Objective Evolutionary Algorithm%一种基于多目标进化算法的模糊关联分类方法

    Institute of Scientific and Technical Information of China (English)

    霍纬纲; 邵秀丽

    2011-01-01

    Accuracy and interpretability are fuzzy associative classification model's optimization objective, which complement and restrict each other. So far informed research only takes classification model's accuracy into account, or transforms two-objective into single-objective optimization problem.Interpretability's optimization method is too simple. In the research field of classification model based on multi-objective optimization and fuzzy rule, most of them generate fuzzy rule according to sample dataset's quantitative attribute corresponding fuzzy item's permutation and combination. When there are many quantitative attribute in the dataset, evolutionary exploration space is large. So a fuzzy associative classification model based on variant apriori and multi-objective evolutionary algorithm NSGA-Ⅱ (MOEA-FACM) is proposed. MOEA-FACM adopts fuzzy confirmation measure based on probabilistic dependence to assess fuzzy associative rule in order to generate good quality rule set.Then a small number of fuzzy associative rules are selected from the prescreened candidate rule set using NSGA-Ⅱ. Maximization of the classification accuracy, minimization of the number of selected rules, and minimization of the total fuzzy items in antecedent of associative rule are regarded as optimization objectives. According to Pittsburgh coding approach and biased mutation operator, a number of non-dominated rule sets, and fuzzy associative classification model, with respect to these three objectives, are built, which can obtain interpretability-accuracy tradeoff. Experiment results on benchmark data sets show that compared with homogeneous classification model, the proposed model has high accuracy, better generalization ability and less number of fuzzy associative rules and total fuzzy items, and better interpretability.%准确率和解释性是模糊关联分类模型的两个相互制约的优化目标.目前已有的研究方法中,有的只考虑了分类模型的准确率,有的

  20. Cubic Spline Interpolation Reveals Different Evolutionary Trends of Various Species

    Directory of Open Access Journals (Sweden)

    Li Zhiqiang

    2016-01-01

    Full Text Available Instead of being uniform in each branch of the biological evolutionary tree, the speed of evolution, measured in the number of mutations over a fixed number of years, seems to be much faster or much slower than average in some branches of the evolutionary tree. This paper describes an evolutionary trend discovery algorithm that uses cubic spline interpolation for various branches of the evolutionary tree. As shown in an example, within the vertebrate evolutionary tree, human evolution seems to be currently speeding up while the evolution of chickens is slowing down. The new algorithm can automatically identify those branches and times when something unusual has taken place, aiding data analytics of evolutionary data.