High dimensional function optimization using a new genetic local search suitable for parallel computers

In this paper, we propose a new genetic local search named GLSDC (a genetic local search with distance independent diversity control) by extending the basic idea of DIDC (a genetic algorithm with distance independent diversity control) to coarse grained parallelization. GLSDC employs a local search method as a search operator. GLSDC also uses genetic operators, i.e., a crossover operator and a generation alternation model. However, in GLSDC, the crossover operator is not used as a search operator, but is used only for converging the population. GLSDC has an ability to find multiple optima simultaneously by stacking good individuals that have been found by the local search. Finding multiple optima is often required when we try to solve real world problems. The effectiveness of the proposed method is verified through numerical experiments on several high dimensional benchmark problems.

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

[2]  Jason G. Digalakis,et al.  A Parallel Memetic Algorithm for Solving Optimization Problems , 2001 .

[3]  William H. Press,et al.  Numerical recipes in C , 2002 .

[4]  Shuhei Kimura,et al.  A Genetic Algorithm with Distance Independent Diversity Control for High Dimensional Function Optimization. , 2003 .

[5]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[6]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[7]  Shigenobu Kobayashi,et al.  Extrapolation-directed crossover for real-coded GA: overcoming deceptive phenomena by extrapolative search , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[8]  Hiroaki Satoh,et al.  Minimal generation gap model for GAs considering both exploration and exploitation , 1996 .

[9]  X. Yao,et al.  Scaling up fast evolutionary programming with cooperative coevolution , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[10]  M. Yamamura,et al.  A functional specialization hypothesis for designing genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[11]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[12]  Isao Ono,et al.  A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.

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

[14]  David Mark Levine,et al.  A parallel genetic algorithm for the set partitioning problem , 1995 .

[15]  S. Kobayashi,et al.  Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[16]  Shigenobu Kobayashi,et al.  An Extension of UNDX Based on Guidelines for Designing Crossover Operators , 2000 .

[17]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..