Simplex GA and hybrid methods

These last years two global optimizations methods hybridizing Evolutionary Algorithms (EA, but mainly GA) with hill-climbing methods have been investigated. The first one involves two interwoven levels of optimization: Evolution (EA) and Individual Learning (hill-climbing), which cooperate in the global optimization process. The second one consists of modifying EA by the introduction of new genetic operators or by the alteration of traditional ones in such a way that these new operators reflect basic mechanisms of hill-climbing methods. Since we believe these two methods of hybridization to be complementary rather than redundant (the first method makes the hill-climbing perform locally whereas the second globally), a complete hybridization is advocated.

[1]  Hugues Bersini,et al.  The Immune Recruitment Mechanism: A Selective Evolutionary Strategy , 1991, ICGA.

[2]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[3]  Hugues Bersini,et al.  S.T.E.P.: the easiest way to optimize a function , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[5]  Geoffrey C. Fox,et al.  A Hybrid Genetic Algorithm for Task Allocation in Multicomputers , 1991, ICGA.

[6]  Fred Glover,et al.  Genetic algorithms and scatter search: unsuspected potentials , 1994 .

[7]  A. E. Eiben,et al.  Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms , 1995, ECAL.

[8]  Vittorio Maniezzo,et al.  Genetic evolution of the topology and weight distribution of neural networks , 1994, IEEE Trans. Neural Networks.

[9]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[10]  Hugues Bersini,et al.  In Search of a Good Evolution-Optimization Crossover , 1992, PPSN.

[11]  Jean-Michel Renders,et al.  Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[12]  Hugues Bersini,et al.  Hints for Adaptive Problem Solving Gleaned from Immune Networks , 1990, PPSN.

[13]  Kazuhiko Kawamura,et al.  Managing genetic search in job shop scheduling , 1993, IEEE Expert.

[14]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[15]  Bruce Tidor,et al.  An Analysis of Selection Procedures with Particular Attention Paid to Proportional and Boltzmann Selection , 1993, International Conference on Genetic Algorithms.

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

[17]  Hiroaki Kitano,et al.  A Hybrid Search for Genetic Algorithms: Combining Genetic AlgorithmsTABU Searchand Simulated Annealing , 1993, ICGA.