Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis
Artificial Intelligence ReviewPublished 1 August 1998
Francisco Herrera, Manuel Lozano, José Luís Verdegay
Citations1,137
SJR quartileQ1
SJR score3.01
SNIP5.11
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Different models of genetic operators and some mechanisms available for studying the behaviour of this type of genetic algorithms are revised and compared.
Abstract
Genetic algorithms play a significant role, as search techniques forhandling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc. Genetic algorithms are based on the underlying genetic process in biological organisms and on the naturalevolution principles of populations. These algorithms process apopulation of chromosomes, which represent search space solutions,with three operations: selection, crossover and mutation. Under its initial formulation, the search space solutions are coded using the binary alphabet. However, the good properties related with these algorithms do not stem from the use of this alphabet; other coding types have been considered for the representation issue, such as real coding, which would seem particularly natural when tackling optimization problems of parameters with variables in continuous domains. In this paper we review the features of real-coded genetic algorithms. Different models of genetic operators and some mechanisms available for studying the behaviour of this type of genetic algorithms are revised and compared.
Keywords
Computer Science
The MIT Press eBooksAdaptation in Natural and Artificial Systems
35,568 Citations1992John H. Holland
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.
Genetic Algorithms in Search, Optimization and Machine Learning
17,773 Citations1988David E. Goldberg, David Robson
Artificial intelligenceGenetic Algorithms + Data Structures = Evolution Programs
11,598 Citations1992Zbigniew Michalewicz
Handbook of Genetic Algorithms
7,308 Citations1991Lawrence Davis
Foundations of genetic algorithmsA Comparative Analysis of Selection Schemes Used in Genetic Algorithms
2,400 Citations1991David E. Goldberg, Kalyanmoy Deb
A number of selection schemes commonly used in modern genetic algorithms are compared on the basis of solutions to deterministic difference or differential equations, verified through computer simulations to provide convenient approximate or exact solutions and useful convergence time and growth ratio estimates.
Evolution and Optimum Seeking
2,200 Citations1995Hans–Paul Schwefel
Problems and Methods of Optimization Hill Climbing Strategies Random Strategies Evolution Strategies for Numerical Optimization Comparison of Direct Search Strategies for Parameter Optimization.
Evolutionary ComputationAn Overview of Evolutionary Algorithms for Parameter Optimization
2,110 Citations1993Thomas Bäck, Hans–Paul Schwefel
Three main streams of evolutionary algorithms (EAs), probabilistic optimization algorithms based on the model of natural evolution, are compared in this article: evolution strategies (ESs), evolutionary programming (EP), and genetic algorithms (GAs).
Foundations of genetic algorithmsReal-Coded Genetic Algorithms and Interval-Schemata
1,645 Citations1993Larry J. Eshelman, J. David Schaffer
It is shown how interval-schemata are analogous to Holland's symbol- schemata and provide a key to understanding the implicit parallelism of real-valued GAs and support the intuition that real-coded GAs should have an advantage over binary coded GAs in exploiting local continuities in function optimization.
IEEE Transactions on Neural NetworksAn introduction to simulated evolutionary optimization
1,508 Citations1994David B. Fogel
The development of each of these procedures over the past 35 years is described and some recent efforts in these areas are reviewed.
international conference on Genetic algorithmsReducing bias and inefficiency in the selection algorithm
1,408 Citations1987James E. Baker
A sheet which is a blend of water-insoluble fibers and pieces of film of a dry material which converts to a gel quickly on contact with a large amount of water.
Deep Blue (University of Michigan)An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
1,299 Citations1975Kenneth DeJong
Evolutionary ComputationPredictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
1,203 Citations1993Heinz Mühlenbein, Dirk Schlierkamp-Voosen
The numerical performance of the BGA is demonstrated on a test suite of multimodal functions and the number of function evaluations needed to locate the optimum scales only as n ln(n) where n is thenumber of parameters.
Complex SystemsMessy genetic algorithms: motivation, analysis, and first results
1,128 Citations1989David E. Goldberg, Bradley Korb +1 more
The mGA presented herein repeatedly achieves globally optimal results without prior knowledge of good string arrangements, and it does so at the very first generation in which strings are long enough to cover the problem.
Foundations of genetic algorithmsGenetic Algorithms for Real Parameter Optimization
989 Citations1991Alden H. Wright
It is shown that k-point crossover can be viewed as a crossover operation on the vector of parameters plus perturbations of some of the parameters, which suggests a genetic algorithm that uses real parameter vectors as chromosomes, real parameters as genes, and real numbers as alleles.
IEEE ExpertInduction: Processes of Inference, Learning, and Discovery
824 Citations1987John H. Holland, Keith J. Holyoak +3 more
Induction is the first major effort to bring the ideas of several disciplines to bear on a subject that has been a topic of investigation since the time of Socrates and is included in the Computational Models of Cognition and Perception Series.
A Survey of Evolution Strategies.
746 Citations1991Thomas Bäck, Frank Hoffmeister +1 more
Evolution Strategies are algorithms which imitate the principles of natural evolution as a method to solve parameter optimization problems and adaptation of the strategy parameters for the mutation variances as well as their covariances are described.
Springer eBooksGenetic algorithms + data structures = evolution programs (2nd, extended ed.)
666 Citations1994Zbigniew Michalewicz
John Wiley & Sons, Inc. eBooksEvolution and Optimum Seeking: The Sixth Generation
655 Citations1993Hans–Paul Schwefel
The most comprehensive work of its kind, Evolution and Optimum Seeking offers a state-of-the-art perspective on the field for researchers in computer-aided design, planning, control, systems analysis, computational intelligence, and artificial life.
international conference on Genetic algorithmsAn Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms.
448 Citations1991Cezary Z. Janikow, Zbigniew Michalewicz
Real-coded genetic algorithms. Virtual alphabets, and blocking.
439 Citations1991David E. Goldberg
A theory of convergence for real coded genetic algorithms GAs that use oating point or other high cardinality codings in their chromosomes is presented and postulates that selection dominates early GA performance and restricts subsequent search to intervals with above average function value dimension by dimension.
KybernetesAn Overview of Genetic Algorithms
381 Citations1992John Galletly
An overview of the field of genetic algorithms is presented as representing a novel optimization strategy which is receiving much attention and is based on the principles of population genetics and biology.
Communications of the ACMGenetic and evolutionary algorithms come of age
362 Citations1994David E. Goldberg
Darwinian evolution has spawned a family of computational methods called genetic algorithms (GAs) or evolutionary algorithms (EAs) that are derived from natural examples and used in computer science and engineering.
International Journal of Approximate ReasoningTuning fuzzy logic controllers by genetic algorithms
357 Citations1995Francisco Herrera, Manuel Lozano +1 more
A method is presented for tuning fuzzy control rules by genetic algorithms to make the fuzzy logic control systems behave as closely as possible to the operator or expert behavior in a control process.
Artificial IntelligenceClassifier systems and genetic algorithms
331 Citations1989Lashon B. Booker, David E. Goldberg +1 more
The definition, theory, and extant applications of classifier systems are reviewed, comparing them with other machine learning techniques, and closing with a discussion of advantages, problems, and possible extensions of classifiers.
Evolutionary ComputationUsing Genetic Algorithms to Explore Pattern Recognition in the Immune System
260 Citations1993Stephanie Forrest, Brenda Javornik +2 more
The paper reports simulation experiments on two pattern-recognition problems that are relevant to natural immune systems and reviews the relation between the model and explicit fitness-sharing techniques for genetic algorithms, showing that the immune system model implements a form of implicit fitness sharing.
EQUIVALENCE CLASS ANALYSIS OF GENETIC ALGORITHMS
241 Citations1991Nicholas J. Radcliffe
IEEE Transactions on Systems Man and CyberneticsA genetic algorithm for the linear transportation problem
240 Citations1991G. A. Vignaux, Zbigniew Michalewicz
The use of alternative genetic algorithms for solving the linear transportation problem and the relationship between representation structures and genetic operators is investigated for constrained problems, and the value of structures richer than bitstrings is demonstrated.
Machine LearningDynamic Parameter Encoding for Genetic Algorithms
226 Citations1992Nicol N. Schraudolph, Richard K. Belew
Dynamic Parameter Encoding is shown to be empirically effective and amenable to analysis; the problem of premature convergence in GAs is explored through two convergence models.
Fuzzy Sets and SystemsPictorial representations of fuzzy connectives, Part I: Cases of t-norms, t-conorms and averaging operators
222 Citations1989M. Mizumoto
Part I of this paper shows a number of examples of existing t-norms and t-conorms which are known as good models of fuzzy set-theoretic intersection and union, and then the pictorial representations are made with the aid of a computer.
Extended Selection Mechanisms in Genetic Algorithms.
211 Citations1991Thomas Bäck, Frank Hoffmeister
Common selection mechanisms used in Evolutionary Algorithms are combined to form some generalized variants of selection that are applied to a Genetic Algorithm and are subject to an experimental comparison.
Elsevier eBooksRepresentation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms
204 Citations1988Richard A. Caruana, J. David Schaffer
Experimental results are presented that indicate Gray coding is generally superior to binary coding for function optimization using the genetic algorithm and suggests that Gray coding eliminates the “Hamming cliff” problem that makes some transitions difficult when using a binary representation.
Real-coded Genetic Algorithms with Simulated Binary Crossover: Studies on Multimodal and Multiobjective Problems.
204 Citations1995Kalyanmoy Deb, Amarendra Kumar
Simulation results suggest the applica t ion of realcod ed GAs with SBX operator to rea l-world optimization problems at large and observe that the real-coded GAs perform equally well or bet ter than binary coded GAs in solving a number of test problems.
Using Genetic Algorithms with Small Populations
194 Citations1993Colin R. Reeves
This paper approaches the question of specifying a minimum size by asking what characteristics of an initial population are likely to lead to poor performance, and calculates population sizes which will almost certainly avoid such features, on the assumption that initial populations are chosen in a random fashion.
Journal of Experimental & Theoretical Artificial IntelligenceRepresentational issues in genetic optimization
185 Citations1990Gunar E. Liepins, Michael D. Vose
Formal functions are partially characterized as easy or hard for genetic algorithms to optimize, and affine transformations are shown to be sufficiently powerful to transform at least selected deceptive problems into easy ones.
Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways
184 Citations2002Jean-Michel Renders, Hugues Bersini
Two methods of hybridizing genetic algorithms (GA) with hill-climbing for global optimization are investigated and applied and compared for the maximization of complex functions defined in high-dimensional real space.
Foundations of genetic algorithmsGenetic Operators for Sequencing Problems
169 Citations1991B. R. Fox, Mary Beth Mcmahon
A thorough understanding of recombination operators for sequences will open up the possibility of applying genetic algorithms to a wide variety of problem domains, including scheduling.
Medical Entomology and ZoologyGenetic Algorithms and Robotics: A Heuristic Strategy for Optimization
158 Citations1991Yuval Davidor
Machine LearningDynamic Parameter Encoding for genetic algorithms
145 Citations1992Nicol N. Schraudolph, Richard K. Belew
Fuzzy Sets and SystemsFuzzy connectives based crossover operators to model genetic algorithms population diversity
144 Citations1997Francisco Herrera, Manuel Lozano +1 more
New crossover operators based on fuzzy connectives for real-coded genetic algorithms are presented, designed to avoid the premature convergence problem.
Using real-valued genetic algorithms to evolve rule sets for classification
143 Citations2002Arthur L. Corcoran, Sandip Sen
It is shown howreal-valued attribute ranges could be encoded with real-valued genes and a new uniform method for representing don't cares in the rules is presented.
Lecture notes in computer scienceStrategy adaptation by competing subpopulations
142 Citations1994Dirk Schlierkamp-Voosen, Heinz Mühlenbein
It is shown that strategy adaptation by competing subpopulations makes the BGA more robust and more efficient.
IEEE Transactions on Neural NetworksTheoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part I: Basic properties of selection and mutation
129 Citations1994Xiaofeng Qi, F. Palmieri
Recursive formulae for the GACS in the general infinite population case are derived and their validity is rigorously proven and it is shown how the increment of the population mean is driven by its own diversity and follows a modified Newton's search.
Artificial IntelligenceGeneralizing the notion of schema in genetic algorithms
127 Citations1991Michael D. Vose
The concept of schema and the Schema Theorem are interpreted from a new perspective, which allows GAs to be regarded as a constrained random walk, and offers a view which is amenable to generalization.
Fuzzy Recombination for the Breeder Genetic Algorithm
114 Citations1995Hans-Michael Voigt, Heinz Mühlenbein +1 more
A new recombination operator called fuzzy recombination FR is introduced for contin uous genes and the performance of the operator is analyzed by means of the equation describ ing the response to selection.
Lecture notes in computer scienceSelf-adaptive genetic algorithm for numeric functions
111 Citations1996Robert Hinterding, Zbigniew Michalewicz +1 more
A genetic algorithm is developed which selfadapts both mutation strength and population size and the results indicate that the approach works quite well.
IEEE Transactions on Neural NetworksComments on "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. I. Basic properties of selection and mutation" [with reply]
104 Citations1998Yong Gao, Xiaofeng Qi +1 more
Recursive formulae for the GACS in the general infinite population case are derived and their validity is rigorously proven and it is shown how the increment of the population mean is driven by its own diversity and follows a modified Newton's search.
Fuzzy Sets and SystemsPictorial representations of fuzzy connectives, Part II: Cases of compensatory operators and self-dual operators
99 Citations1989Masaharu Mizumoto
Compensatory operators are discussed and generalized compensatory operators which can be obtained from averaging operators are proposed which are defined by using t-norms, t-conorms and averaging operators.
Journal of Applied ProbabilityEquilibrium behavior of population genetic models with non-random mating. Part I: Preliminaries and special mating systems
88 Citations1968Samuel Karlin
IEEE Transactions on Neural NetworksTheoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part II: Analysis of the diversification role of crossover
78 Citations1994Xiaofeng Qi, F. Palmieri
Recursive equations for the population distributions are derived for a uniform crossover operator in multi-dimensional continuous space, showing how the crossover operator probes new regions of the solution space while keeping the population within the feasible region.
IEE Proceedings J OptoelectronicsOptimal multilayer filter design using real coded genetic algorithms
72 Citations1992Eric Michielssen, S. Ranji Ranjithan +1 more
Expected Allele Coverage and the Role of Mutation in Genetic Algorithms
68 Citations1993David M. Tate, Alice E. Smith
It is argued that the optimal mutation rate depends strongly on the choice of encoding, and that problems requiring nonbinary encodings may benefit from utation rates much higher than those generally used with binaryencodings.
Adaptation of population sizes by competing subpopulations
62 Citations2002Dirk Schlierkamp-Voosen, Heinz Mühlenbein
A competition scheme which dynamically allocates the number of trials given to different search strategies and is able to combine the strengths of individual search strategies in a synergetic way is presented.
International Journal of Intelligent SystemsDynamic and heuristic fuzzy connectives-based crossover operators for controlling the diversity and convergence of real-coded genetic algorithms
60 Citations1998Francisco Herrera, Manuel Lozano +1 more
Two types of crossover operators based on fuzzy connectives for real‐coded genetic algorithms are presented, designed to keep a suitable sequence between the exploration and the exploitation along the genetic algorithm's run and for generating offspring near to the best parents in order to offer diversity or convergence in a profitable way.
Non-Linear Genetic Representations
60 Citations1992Nicholas J. Radcliffe
The central thesis of the paper is that for many problems conventional linear chromosomes and recombination operators are inadequate for effective genetic search, and that for general problems non-linear representations are required.
Lecture notes in computer scienceFrom recombination of genes to the estimation of distributions II. Continuous parameters
58 Citations1996Heinz Mühlenbein, J. Bendisch +1 more
The new points (offspring) are generated from distributions, a uniform distribution and a distribution generated by univariate marginal distributions and the performance of the BGA is analytically computed.
Annals of Mathematics and Artificial IntelligenceCharacterizing crossover in genetic algorithms
50 Citations1992Gunar E. Liepins, Michael D. Vose
C crossover is a binary operator that preserves schemata and commutes with addition and projection, and for any set of chromosomes and familyF of crossover operators, it fully characterize the reachable chromosomes.
A Real Coded Genetic Algorithm with an Explorer and an Exploiter Populations.
50 Citations1997Shigeyoshi Tsutsui, Ashish Ghosh +2 more
A method for adaptive load balancing between the two sub-GAs within a bGA, which uses knowledge of the number of restarts occurring in the explorer sub-GA, is explored.
Evolutionary ProgrammingFast Convergence Thanks to Diversity.
43 Citations1996M. Sefrioui, Jacques Périaux +1 more
This review presents a newborn with a large segmental facial hemangioma and abnormal genesis of the cerebropetal arteries and gives an overview of the anomalies associated with the PHACE syndrome.
Lecture notes in computer scienceThe influence of different coding schemes on the computational complexity of genetic algorithms in function optimization
27 Citations1996Ralf Salomon
The theoretical analysis presented here strongly suggests that real-valued parameters (implemented by floating point values provided by the programming language) should be the best choice when applying a GA in the field of function optimization.
An analysis on linear crossover for real number chromosomes in an infinite population size
26 Citations2002Tatsuya Nomura
An approach for mathematical analysis of genetic algorithms with real number chromosomes using a linear combination of the elements on the locus and verifying the property in the change of the distribution of the chromosomes is presented.
Modal mutations in evolutionary algorithms
22 Citations2002H. Voigt, T. Anheyer
Modal mutation schemes for evolutionary algorithms as a generalization of the breeder genetic algorithm mutation scheme are introduced and analyzed for multimodal continuous parameter optimization problems.
An analysis on crossovers for real number chromosomes in an infinite population size
21 Citations1997Tatsuya Nomura
This paper focuses on crossovers, gives a general framework of the description for the change of the distribution of the population through them, and verifies the properties of c crossover based on the framework.
Lecture notes in computer scienceHeuristic crossovers for real-coded genetic algorithms based on fuzzy connectives
17 Citations1996Francisco Herrera, Manuel Lozano
Heuristic crossover operators for real-coded genetic algorithms, which use the adaptation of the parents for generating the offspring are presented, which may be modeled in order to avoid the premature convergence problem and to introduce good final behaviour.
IEEE International Conference on Neural NetworksRetaining diversity of genetic algorithms for multivariable optimization and neural network learning
17 Citations2002Y. Ichikawa, Yoshikazu Ishii
Methods to retain diversity of the allele distribution in the search for genetic algorithms (GAs) are presented and case studies with problems of neural network pattern matching and unsupervised learning of a neural network which controls an inverted pendulum are discussed.
Evolutionary ComputationSome Comments on Evolutionary Algorithm Theory
16 Citations1996Ralf Salomon
It turns out that spherical symmetry leads to simplifications in (self-adaptive) EAs but seems inappropriate for certain genetic algorithm variants, since small mutation rates bias a search algorithm toward the coordinate axes.
A Stationary Point Convergence Theory for Evolutionary Algorithms.
16 Citations1996William E. Hart
This paper deenes a class of evolutionary algorithms called evolutionary pattern search algorithms (EPSAs) and analyzes their convergence properties and finds a stationary point convergence theory based on an extension of the convergence theory for generalized pattern search methods.
Heterogeneous distributed genetic algorithms based on the crossover operator
14 Citations1997Francisco Herrera
A type of heterogeneous distributed real-coded genetic algorithms that apply a different crossover operator to each subpopulation that consistently outperform equivalent sequential genetic algorithms and homogeneous distributed genetic algorithms.
A generalized stationary point convergence theory for evolutionary algorithms
12 Citations2010William E. Hart
A convergence theory for EPSAs that is allowed to both increase and decrease the step size is presented, based on an extension of the converge theory for generalized pattern search methods.
Lecture notes in computer scienceNumerical coding and unfair average crossover in GA for fuzzy rule extraction in dynamic environments
11 Citations1996Tatsuya Nomura, Tsutomu Miyoshi
It is shown that the ”Unfair Average Crossover” method is superior to conventional methods using discrete chromosome coding in cases where there is a tendency for data to change dynamically.
international conference on Genetic algorithmsMultivalued Evolutionary Algorithms
10 Citations1993Hans-Michael Voigt, Jan Born +1 more
This work calls the transformation between genes and phenes a developmental process because of its dynamics and presents a Multival-ued Evolutionary Algorithm (MEA) based on this observation.
…