19,845 research outputs found
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
This is the post-print version of the article. The official published version can be obtained from the link below - Copyright @ 2007 SpringerIn this paper a genetic algorithm is proposed where the worst individual and individuals with indices close to its index are replaced in every generation by randomly generated individuals for dynamic optimization problems. In the proposed genetic algorithm, the replacement of an individual can affect other individuals in a chain reaction. The new individuals are preserved in a subpopulation which is defined by the number of individuals created in the current chain reaction. If the values of fitness are similar, as is the case with small diversity, one single replacement can affect a large number of individuals in the population. This simple approach can take the system to a self-organizing behavior, which can be useful to control the diversity level of the population and hence allows the genetic algorithm to escape from local optima once the problem changes due to the dynamics.This work was supported by FAPESP (Proc. 04/04289-6)
Experimental study on population-based incremental learning algorithms for dynamic optimization problems
Copyright @ Springer-Verlag 2005.Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world problems are often dynamic. This seriously challenges traditional evolutionary algorithms. In this paper, the application of population-based incremental learning (PBIL) algorithms, a class of evolutionary algorithms, for dynamic problems is investigated. Inspired by the complementarity mechanism in nature a Dual PBIL is proposed, which operates on two probability vectors that are dual to each other with respect to the central point in the genotype space. A diversity maintaining technique of combining the central probability vector into PBIL is also proposed to improve PBILs adaptability in dynamic environments. In this paper, a new dynamic problem generator that can create required dynamics from any binary-encoded stationary problem is also formalized. Using this generator, a series of dynamic problems were systematically constructed from several benchmark stationary problems and an experimental study was carried out to compare the performance of several PBIL algorithms and two variants of standard genetic algorithm. Based on the experimental results, we carried out algorithm performance analysis regarding the weakness and strength of studied PBIL algorithms and identified several potential improvements to PBIL for dynamic optimization problems.This work was was supported by
UK EPSRC under Grant GR/S79718/01
Adaptive primal-dual genetic algorithms in dynamic environments
This article is placed here with permission of IEEE - Copyright @ 2010 IEEERecently, there has been an increasing interest in applying genetic algorithms (GAs) in dynamic environments. Inspired by the complementary and dominance mechanisms in nature, a primal-dual GA (PDGA) has been proposed for dynamic optimization problems (DOPs). In this paper, an important operator in PDGA, i.e., the primal-dual mapping (PDM) scheme, is further investigated to improve the robustness and adaptability of PDGA in dynamic environments. In the improved scheme, two different probability-based PDM operators, where the mapping probability of each allele in the chromosome string is calculated through the statistical information of the distribution of alleles in the corresponding gene locus over the population, are effectively combined according to an adaptive Lamarckian learning mechanism. In addition, an adaptive dominant replacement scheme, which can probabilistically accept inferior chromosomes, is also introduced into the proposed algorithm to enhance the diversity level of the population. Experimental results on a series of dynamic problems generated from several stationary benchmark problems show that the proposed algorithm is a good optimizer for DOPs.This work was supported in part by the National Nature Science Foundation of China (NSFC) under Grant 70431003 and Grant
70671020, by the National Innovation Research Community Science Foundation
of China under Grant 60521003, by the National Support Plan of China under Grant 2006BAH02A09, by the Engineering and Physical Sciences
Research Council (EPSRC) of U.K. under Grant EP/E060722/1, and by the
Hong Kong Polytechnic University Research Grants under Grant G-YH60
The Evolutionary Unfolding of Complexity
We analyze the population dynamics of a broad class of fitness functions that
exhibit epochal evolution---a dynamical behavior, commonly observed in both
natural and artificial evolutionary processes, in which long periods of stasis
in an evolving population are punctuated by sudden bursts of change. Our
approach---statistical dynamics---combines methods from both statistical
mechanics and dynamical systems theory in a way that offers an alternative to
current ``landscape'' models of evolutionary optimization. We describe the
population dynamics on the macroscopic level of fitness classes or phenotype
subbasins, while averaging out the genotypic variation that is consistent with
a macroscopic state. Metastability in epochal evolution occurs solely at the
macroscopic level of the fitness distribution. While a balance between
selection and mutation maintains a quasistationary distribution of fitness,
individuals diffuse randomly through selectively neutral subbasins in genotype
space. Sudden innovations occur when, through this diffusion, a genotypic
portal is discovered that connects to a new subbasin of higher fitness
genotypes. In this way, we identify innovations with the unfolding and
stabilization of a new dimension in the macroscopic state space. The
architectural view of subbasins and portals in genotype space clarifies how
frozen accidents and the resulting phenotypic constraints guide the evolution
to higher complexity.Comment: 28 pages, 5 figure
Hierarchical Crossover and Probability Landscapes of Genetic Operators
The time evolution of a simple model for crossover is discussed. A variant of
this model with an improved exploration behavior in phase space is derived as a
subset of standard one- and multi-point crossover operations. This model is
solved analytically in the flat fitness case. Numerical simulations compare the
way of phase space exploration of different genetic operators. In the case of a
non-flat fitness landscape, numerical solutions of the evolution equations
point out ways to estimate premature convergence.Comment: 11 pages, uuencoded postcript fil
Effects of neutral selection on the evolution of molecular species
We introduce a new model of evolution on a fitness landscape possessing a
tunable degree of neutrality. The model allows us to study the general
properties of molecular species undergoing neutral evolution. We find that a
number of phenomena seen in RNA sequence-structure maps are present also in our
general model. Examples are the occurrence of "common" structures which occupy
a fraction of the genotype space which tends to unity as the length of the
genotype increases, and the formation of percolating neutral networks which
cover the genotype space in such a way that a member of such a network can be
found within a small radius of any point in the space. We also describe a
number of new phenomena which appear to be general properties of neutrally
evolving systems. In particular, we show that the maximum fitness attained
during the adaptive walk of a population evolving on such a fitness landscape
increases with increasing degree of neutrality, and is directly related to the
fitness of the most fit percolating network.Comment: 16 pages including 4 postscript figures, typeset in LaTeX2e using the
Elsevier macro package elsart.cl
A multi-agent based evolutionary algorithm in non-stationary environments
This article is posted here with permission of IEEE - Copyright @ 2008 IEEEIn this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolve to find optimum. All agents live in a lattice like environment, where each agent is fixed on a lattice point. In order to increase the energy, agents can compete with their neighbors and can also acquire knowledge based on statistic information. In order to maintain the diversity of the population, the random immigrants and adaptive primal dual mapping schemes are used. Simulation experiments on a set of dynamic benchmark problems show that MAEA can obtain a better performance in non-stationary environments in comparison with several peer genetic algorithms.This work was suported by the Key Program of National Natural Science Foundation of China under Grant No. 70431003, the Science Fund for Creative Research Group of the National Natural Science Foundation of China under Grant No. 60521003, the National Science and Technology Support Plan of China under Grant No. 2006BAH02A09, and the Engineering and Physical Sciences Research Council of the United Kingdom under Grant No. EP/E060722/1
- …