Abstract
A parallel two-level evolutionary algorithm which evolves genetic algorithms of maximum convergence velocity is presented. The meta-algorithm combines principles of evolution strategies and genetic algorithms in order to optimize continuous and discrete parameters of the genetic algorithms at the same time (mixed-integer optimization).
The genetic algorithms which result from the meta-evolution experiment are considerably faster than standard genetic algorithms and confirm recent theoretical results about optimal mutation rates and the interaction of selective pressure and mutation rate.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Th. Bäck. The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. In Männer and Manderick [14], pages 85–94.
Th. Bäck. Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. In Proceedings of the IEEE International Conference on Evolutionary Computation, 1994.
Th. Bäck and F. Hoffmeister. Extended selection mechanisms in genetic algorithms. In Belew and Booker [6], pages 92–99.
Th. Bäck and H.-P. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1):1–23, 1993.
J. E. Baker. Adaptive selection methods for genetic algorithms. In J. J. Grefenstette, editor, Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, pages 101–111. Lawrence Erlbaum Associates, Hillsdale, NJ, 1985.
R. K. Belew and L. B. Booker, editors. Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1991.
H. J. Bremermann. The evolution of intelligence: The nervous system as a model of its environment. Technical Report 1, Contract No. 477(17), Department of Mathematics, University of Washington, Seattle, July 1958.
B. Freisleben and M. Härtfelder. Optimization of genetic algorithms by genetic algorithms. In R. F. Albrecht, C. R. Reeves, and N. C. Steele, editors, Artificial Neural Nets and Genetic Algorithms, pages 392–399. Springer, Wien, 1993.
D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading, MA, 1989.
D. E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In Rawlins [16], pages 69–93.
J. J. Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics, SMC-16(1):122–128, 1986.
W. E. Hart and R. K. Belew. Optimizing an arbitrary function is hard for the genetic algorithm. In Belew and Booker [6], pages 190–195.
K. A. De Jong. An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan, 1975. Diss. Abstr. Int. 36(10), 5140B, University Microfilms No. 76–9381.
R. Männer and B. Manderick, editors. Parallel Problem Solving from Nature 2. Elsevier, Amsterdam, 1992.
H. Mühlenbein. How genetic algorithms really work: I. mutation and hillclimbing. In Männer and Manderick [14], pages 15–25.
G. J. E. Rawlins, editor. Foundations of Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1991.
J. D. Schaffer, editor. Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1989.
J. D. Schaffer, R. A. Caruana, L. J. Eshelman, and R. Das. A study of control parameters affecting online performance of genetic algorithms for function optimization. In Schaffer [17], pages 51–60.
J. D. Schaffer and L. J. Eshelman. On crossover as an evolutionary viable strategy. In Belew and Booker [6], pages 51–60.
H.-P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chichester, 1981.
G. Syswerda. Uniform crossover in genetic algorithms. In Schaffer [17], pages 2–9.
A. H. Wright. Genetic algorithms for real parameter optimization. In Rawlins [16], pages 205–218.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bäck, T. (1994). Parallel optimization of evolutionary algorithms. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_285
Download citation
DOI: https://doi.org/10.1007/3-540-58484-6_285
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58484-1
Online ISBN: 978-3-540-49001-2
eBook Packages: Springer Book Archive