Development of a parallel optimization method based on genetic simulated annealing algorithm

This paper presents a parallel genetic simulated annealing (PGSA) algorithm that has been developed and applied to optimize continuous problems. In PGSA, the entire population is divided into sub-populations, and in each sub-population the algorithm uses the local search ability of simulated annealing after crossover and mutation. The best individuals of each subpopulation are migrated to neighboring ones after a certain number of epochs. An implementation of the algorithm is discussed and the performance is evaluated against a standard set of test functions. PGSA shows some remarkable improvement in comparison with the conventional parallel genetic algorithm and the breeder genetic algorithm (BGA).

[1]  A. Griewank.  Generalized descent for global optimization , 1981 .

[2]  L. Darrell Whitley,et al.  Serial and Parallel Genetic Algorithms as Function Optimizers , 1993, ICGA.

[3]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

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

[5]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[6]  Hao Chen,et al.  Parallel Simulated Annealing and Genetic Algorithms: a Space of Hybrid Methods , 1994, PPSN.

[7]  David E. Goldberg,et al.  Parallel Recombinative Simulated Annealing: A Genetic Algorithm , 1995, Parallel Comput..

[8]  Heinz Mühlenbein,et al.  Strategy Adaption by Competing Subpopulations , 1994, PPSN.

[9]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[10]  Reinhard Männer,et al.  Towards an Optimal Mutation Probability for Genetic Algorithms , 1990, PPSN.

[11]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

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

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

[14]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[15]  Enrique Alba,et al.  A survey of parallel distributed genetic algorithms , 1999 .

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

[17]  Tomoyuki Hiroyasu,et al.  Parallel Simulated Annealing using Genetic Crossover , 2000 .

[18]  Peter J. Fleming,et al.  Parallel Genetic Algorithms: A Survey , 1994 .

[19]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[20]  James P. Cohoon,et al.  Population-Oriented Simulated Annealing: A Genetic/Thermodynamic Hybrid Approach to Optimization , 1995, International Conference on Genetic Algorithms.

[21]  Alan J. Mayne,et al.  Towards Global Optimisation 2 , 1976 .

[22]  Hao Chen,et al.  Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm , 1998, IEEE Trans. Parallel Distributed Syst..

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

[24]  Enrique Alba,et al.  A survey of parallel distributed genetic algorithms , 1999, Complex..