Parallel Simulated Annealing and Genetic Algorithms: a Space of Hybrid Methods

Simulated annealing and genetic algorithms represent powerful optimization methods with complementary strengths and weaknesses. Hence, there is an interest in identifying hybrid methods (which combine features of both SA and GA) that exhibit performance superior than either method alone. This paper introduces a systematic approach to identifying these hybrids by defining a space of methods as a nondeterministic generating grammar. This space includes SA, GA, previously introduced hybrids and many new methods. An empirical evaluation has been completed for 14 methods from this space applied to 9 diverse optimization problems. Results demonstrate that the space contains promising new methods. In particular, a new method that combines the recombinative power of GAs and annealing schedule of SA is shown to be one of the best methods for all 9 optimization problems explored.

[1]  W. Ebeling,et al.  Boltzmann and Darwin strategies in complex optimization , 1987 .

[2]  Bruce E. Rosen,et al.  Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .

[3]  Werner Ebeling,et al.  Boltzmann-, Darwin-, and Haeckel-Strategies in Optimization Problems , 1990, PPSN.

[4]  Dana S. Richards,et al.  Distributed genetic algorithms for the floorplan design problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[7]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[8]  Jan Karel Lenstra,et al.  A local search template (extended abstract) , 1992 .

[9]  Karl-Heinz Hoffmann,et al.  Optimizing Simulated Annealing , 1990, PPSN.

[10]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[11]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Werner Ebeling,et al.  Optimization of NP-Complete Problems by Boltzmann-Darwin Strategies Including Life Cycles , 1988 .

[14]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[15]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[16]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[17]  Hans-Paul Schwefel,et al.  Numerical Optimization of Computer Models , 1982 .

[18]  Daniel R. Greening,et al.  Parallel simulated annealing techniques , 1990 .

[19]  David J. Sirag,et al.  Toward a unified thermodynamic genetic operator , 1987 .

[20]  A. E. Eiben,et al.  Global Convergence of Genetic Algorithms: A Markov Chain Analysis , 1990, PPSN.

[21]  David E. Goldberg,et al.  A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing , 1990, Complex Syst..

[22]  Runhe Huang,et al.  Implementing the Genetic Algorithm on Transputer Based Parallel Processing Systems , 1990, PPSN.

[23]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .