Adjusting Population Distance for the Dual-Population Genetic Algorithm

A dual-population genetic algorithm (DPGA) is a new multipopulation genetic algorithm that solves problems using two populations with different evolutionary objectives. The main population is similar to that of an ordinary genetic algorithm, and it evolves in order to obtain suitable solutions. The reserve population evolves to maintain and offer diversity to the main population. The two populations exchange genetic materials using interpopulation crossbreeding. This paper proposes a new fitness function of the reserve population based on the distance to the main populations. The experimental results have shown that the performance of DPGA is highly related to the distance between the populations and that the best distance differs for each problem. Generally, it is difficult to decide the best distance between the populations without prior knowledge about the problem. Therefore, this paper also proposes a method to dynamically adjust the distance between the populations using the distance between good parents, i.e., the parents that generated good offspring.

[1]  Thomas Bäck,et al.  The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm , 1992, PPSN.

[2]  R. K. Ursem.  Multinational evolutionary algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[4]  Jie Yao,et al.  BMPGA: a bi-objective multi-population genetic algorithm for multi-modal function optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[5]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[6]  Kwang Ryel Ryu,et al.  A dual-population genetic algorithm for balanced exploration and exploitation , 2006, Computational Intelligence.

[7]  Kwang Ryel Ryu,et al.  A dual population genetic algorithm with evolving diversity , 2007, 2007 IEEE Congress on Evolutionary Computation.

[8]  L. Darrell Whitley,et al.  Island Model genetic Algorithms and Linearly Separable Problems , 1997, Evolutionary Computing, AISB Workshop.

[9]  L. Darrell Whitley,et al.  Evaluating Evolutionary Algorithms , 1996, Artif. Intell..

[10]  Mark Wineberg,et al.  Distance between Populations , 2003, GECCO.

[11]  Shigeyoshi Tsutsui,et al.  Forking Genetic Algorithm with Blocking and Shrinking Modes (fGA) , 1993, ICGA.

[12]  Thomas Bäck,et al.  Optimal Mutation Rates in Genetic Search , 1993, ICGA.

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

[14]  Michael J. Shaw,et al.  Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.