Practical Genetic Algorithms
Published 14 May 2003
Randy L. Haupt, Sue Ellen Haupt
Citations4,206
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.
Abstract
Introduction to Optimization The Binary Genetic Algorithm The Continuous Parameter Genetic Algorithm Applications An Added Level of Sophistication Advanced Applications Evolutionary Trends Appendix Glossary Index.
Keywords
Computer Science
Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning
49,278 Citations1989
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The Journal of Chemical PhysicsEquation of State Calculations by Fast Computing Machines
37,074 Citations1953N. Metropolis, Arianna W. Rosenbluth +3 more
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.
American Journal of Physics<i>The Fractal Geometry of Nature</i>
21,750 Citations1983Benoît B. Mandelbrot, John Wheeler
Swarm IntelligenceParticle swarm optimization
21,351 Citations2007Riccardo Poli, James Kennedy +1 more
A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
IEEE Transactions on Evolutionary ComputationNo free lunch theorems for optimization
13,936 Citations1997David H. Wolpert, William G. Macready
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.
Medical Entomology and ZoologyGenetic Programming: On the Programming of Computers by Means of Natural Selection
13,257 Citations1992John R. Koza
This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
Artificial intelligenceGenetic Algorithms + Data Structures = Evolution Programs
11,598 Citations1992Zbigniew Michalewicz
IEEE Transactions on Evolutionary ComputationMultiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
8,605 Citations1999Eckart Zitzler, Lothar Thiele
The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.
IEEE Transactions on Evolutionary ComputationAnt colony system: a cooperative learning approach to the traveling salesman problem
7,994 Citations1997Marco Dorigo, Luca Maria Gambardella
The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and it is concluded comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.
Oxford University Press eBooksSwarm Intelligence
6,415 Citations1999Eric Bonabeau, Marco Dorigo +1 more
This chapter discusses Ant Foraging Behavior, Combinatorial Optimization, and Routing in Communications Networks, and its application to Data Analysis and Graph Partitioning.
Belarusian State Pedagogical University repository (Belarusian State Pedagogical University)Neural network design
5,164 Citations1995Martin Hagan, Howard B. Demuth +1 more
This book, by the authors of the Neural Network Toolbox for MATLAB, provides a clear and detailed coverage of fundamental neural network architectures and learning rules, as well as methods for training them and their applications to practical problems.
Adaptive Signal Processing
5,121 Citations1991
This volume discusses three recently developed general methodologies for designing signal predictors under nonclassical operating conditions, namely the robust predictor, the high-speed Levinson modeling, and the approximate conditional mean nonlinear predictor.
Fuzzy Logic with Engineering Applications
4,708 Citations2010Timothy J. Ross
CERN Document Server (European Organization for Nuclear Research)Fundamentals of neural networks: architectures, algorithms, and applications
3,046 Citations1994Laurene V. Fausett
IEEE Transactions on Systems Man and CyberneticsOptimization of Control Parameters for Genetic Algorithms
2,831 Citations1986John J. Grefenstette
GA's are shown to be effective for both levels of the systems optimization problem and are applied to the second level task of identifying efficient GA's for a set of numerical optimization problems.
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.
IEEE Transactions on Evolutionary ComputationParameter control in evolutionary algorithms
1,913 Citations1999A. E. Eiben, Robert Hinterding +1 more
This paper revision the terminology, which is unclear and confusing, thereby providing a classification of such control mechanisms, and surveys various forms of control which have been studied by the evolutionary computation community in recent years.
international conference on Genetic algorithmsGenetic algorithms with sharing for multimodal function optimization
1,890 Citations1987David E. Goldberg, Jon T. Richardson
IEEE Transactions on Evolutionary ComputationEvolutionary computation: comments on the history and current state
1,532 Citations1997Thomas Bäck, Ulrich Hammel +1 more
The purpose, the general structure, and the working principles of different approaches, including genetic algorithms (GA), evolution strategies (ES), and evolutionary programming (EP) are described by analysis and comparison of their most important constituents (i.e. representations, variation operators, reproduction, and selection mechanism).
Mathematics of Operations ResearchCooling Schedules for Optimal Annealing
1,232 Citations1988Bruce Hajek
A Monte Carlo optimization technique called “simulated annealing” is a descent algorithm modified by random ascent moves in order to escape local minima which are not global minima.
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.
Mathematical Modeling
954 Citations1993Mark M. Meerschaert
international conference on Genetic algorithmsA study of permutation crossover operators on the traveling salesman problem
892 Citations1987I. M. Oliver, David J. Smith +1 more
Medical Entomology and ZoologyGenetic Programming III: Darwinian Invention and Problem Solving
762 Citations1999John R. Koza, David André +2 more
Genetically evolved solutions to dozens of problems of design, control, classification, system identification, and computational molecular biology are presented.
Artificial evolution for computer graphics
728 Citations1991Karl Sims
It is proposed that artificial evolution has potential as a powerful tool for achieving flexible complexity with a minimum of user input and knowledge of details.
Annals of Mathematics and Artificial IntelligenceModeling genetic algorithms with Markov chains
446 Citations1992Allen E. Nix, Michael D. Vose
A simple genetic algorithm as a Markov chain is model, both complete and exact, which considers the asymptotics of the steady state distributions as population size increases.
Artificial IntelligenceEvaluating evolutionary algorithms
406 Citations1996Darrell Whitley, Soraya Rana +2 more
Some basic principles that can be used to develop test suites are discussed and the role of test suites as they have been used to evaluate evolutionary search algorithms are examined.
Evolutionary Art and Computers
402 Citations1992Stephen Todd, William Latham
Part 1: personal view, structure of book system - overview of system winsom - geometry and algorithms for "what I can see", lighting and rendering, texture, tay-tracer interactive graphics - picture style and hardware.
Lecture notes in computer scienceGenetic algorithms with multi-parent recombination
393 Citations1994A. E. Eiben, Paul-Erik Raué +1 more
The experiments show that 2-parent recombination is inferior on the classical DeJong functions and in some cases 2 parents are optimal, while in some others more parents are better.
Principles of communication systems
373 Citations1970Herbert Taub, D. L. Schilling
This edition features improved treatment of signal analysis, including representations in signal space, as well as a more complete and modern presentation of random variables and random processes.
Optimal Mutation Rates in Genetic Search
371 Citations1993Thomas Bäck
The results indicate that a variation of the mutation rate is useful in cases where the tness function is a multimodal pseudo boolean function where multimodality may be caused by the objective function as well as the encoding mechanism.
Serial and Parallel Genetic Algorithms as Function Optimizers
319 Citations1993V. Scott Gordon, L. Darrell Whitley
Barrow being distinguished from the parent cultivar by its medium to dark yellow ray floret color, taller plant height, larger flower size, and longer flowering response period.
Monthly Weather ReviewRandom Forcing and Forecasting Using Principal Oscillation Pattern Analysis
267 Citations1989Cécile Penland
Physica D Nonlinear PhenomenaA stochastic model of IndoPacific sea surface temperature anomalies
246 Citations1996Cécile Penland
Lecture notes in computer scienceIntelligent mutation rate control in canonical genetic algorithms
215 Citations1996Thomas Bäck, Martin Schütz
The strengths of the proposed deterministic schedule and the self-adaptation method are demonstrated by a comparison of their performance on difficult combinatorial optimization problems, and both methods are shown to perform significantly better than the canonical genetic algorithm.
Coarse-grain parallel genetic algorithms: categorization and new approach
177 Citations2002Shyh-Chang Lin, William F. Punch +1 more
A new coarse-grained GA architecture, the Injection Island GA (iiGA), is proposed and the preliminary results of iiGA's show them to be a promising new approach to coarse-grain GA's.
Evolutionary methods for musical composition
88 Citations1998Geraínt A. Wiggins, Georgios Th. Papadopoulos +2 more
GAs are not ideal for the simulation of human musical thought (notwithstanding their ability to produce good results) because their operation in no way simulates human behaviour.
Journal of HeuristicsTest driving three 1995 genetic algorithms: New test functions and geometric matching
83 Citations1995Darrell Whitley, Ross Beveridge +2 more
An elitist simple genetic algorithm, the CHC algorithm and Genitor are compared using new test problems that are not readily solved using simple local search methods and a hybrid algorithm is examined that combines local and genetic search.
Evolutionary ComputationOn the Scalability of Parallel Genetic Algorithms
82 Citations1999Erick Cantú‐Paz, David E. Goldberg
The results of the paper suggest that parallel GAs can integrate large numbers of processors and significantly reduce the execution time of many practical applications.
Monthly Weather ReviewForecasting Northern Hemisphere 700-mb Geopotential Height Anomalies Using Empirical Normal Modes
80 Citations1993Cécile Penland, Michael Ghil
INFORMS journal on computingStopping Criteria for Finite Length Genetic Algorithms
77 Citations1996Haldun Aytuğ, Gary J. Kœhler
Borders are derived on the number of iterations required to achieve a level of confidence to guarantee that a genetic algorithm has seen all populations and, hence, an optimal solution.
Advances in Applied ProbabilityAsymptotic convergence of genetic algorithms
76 Citations1998Raphaël Cerf
A delicate interaction between the perturbations and the selection pressure may force the convergence toward the global maxima of the fitness function, and the existence of a critical population size is put forward, above which this kind of convergence can be achieved.
Medical Entomology and ZoologyANSI Common Lisp
72 Citations1995Paul Graham
1. Welcome to Lisp, a beginners' guide to the language and some examples of applications.
Choice Reviews OnlineSimply Scheme: introducing computer science
61 Citations1994
This lively introduction to computer science and computer programming in Scheme is for non-computer science majors with a strong interest in the subject and for computer science majors who lack prior programming experience.
The Nature of Mutation in Genetic Algorithms
61 Citations1995Robert Hinterding, Harry Gielewski +1 more
The variables of numerical functions are treated as the genes, and the role of mutation as an independent reproduction operator in Genetic Algorithms is investigated.
IEEE Transactions on Evolutionary ComputationAn evolutionary strategy for global minimization and its Markov chain analysis
54 Citations1998Olivier François
The mutation-or-selection evolutionary strategy (MOSES) is presented, and explicit parametrizations of MOSES are proposed to solve complex discrete optimization problems.
Genetic Algorithms Applications to Set Covering and Traveling Salesman Problems
53 Citations1990Gunar E. Liepins, Michael R. Hilliard +2 more
The results suggest that genetic algorithms have their place in optimization of constrained problems, however, lack of, or insufficient use of fundamental building blocks seems to keep the tested genetic algorithm variants from being competitive with specialized search algorithms on ordering problems.
Lecture notes in computer scienceEvolution strategies: An alternative evolutionary algorithm
52 Citations1996Thomas Bäck
It is argued that the application of canonical genetic algorithms for continuous parameter optimization problems implies some difficulties caused by the encoding of continuous object variables by binary strings and the constant mutation rate used in genetic algorithms.
Physica D Nonlinear PhenomenaSolitons from sine waves: Analytical and numerical methods for non-integrable solitary and cnoidal waves
50 Citations1986John P. Boyd
Wave MotionModeling nonlinear resonance: A modification to the stokes' perturbation expansion
42 Citations1988Sue Ellen Haupt, John P. Boyd
Artificial intelligence for engineering design analysis and manufacturingOptimal design of flywheels using an injection island genetic algorithm
41 Citations1999David Eby, Ronald C. Averill +2 more
All variations of the Injection Island Genetic Algorithm were found to be extremely efficient in terms of computational time required to final solution of similar fitness when compared to the parallel GAs.
Foundations of genetic algorithmsConditions for Implicit Parallelism
34 Citations1991John J. Grefenstette
This paper focuses on invariants among genetic algorithms that differ along two dimensions: the way user-defined objective function is mapped to a fitness measure, and the way the fitness measure is used to assign offspring to parents.
The MIT Press eBooksEvolving Fractal Movies
27 Citations1996
A method for representing a fractal set of fractals, the Meta-IFS, is defined and an interactive evolutionary program is used to create examples of this mathematical structure.
Deep Blue (University of Michigan)Synthesis of resistive tapers to control scattering patterns of strips
7 Citations2006Randy L. Haupt, Valdis V. Liepa
Deep Blue (University of Michigan)Solving Nonlinear Wave Problems with Spectral Boundary Value Techniques.
3 Citations1988Sue Ellen Haupt