A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems

Numerical optimization problems enjoy a signi cant popularity in evolutionary computation community; all major evolutionary techniques (genetic algorithm, evolution strategies, evolutionary programming) have been applied to these problems. However, many of these techniques (as well as other, classical optimization methods) have di culties in solving some real-world problems which include non-trivial constraints. For such problems, very often the global solution lies on the boundary of the feasible region. Thus it is important to investigate some problem-speci c operators, which search this boundary in an e cient way. In this study we discuss a new experimental evidence on usefulness of so-called geometrical crossover, which might be used for a boundary search for particular problems. This operator enhances also the e ectiveness of evolutionary algorithms (based on oating point representation) in a signi cant way.

[1]  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.

[2]  Z. Michalewicz,et al.  Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[3]  Atidel B. Hadj-Alouane,et al.  A dual genetic algorithm for bounded integer programs James C. Bean, Atidel Ben Hadj-Alouane. , 1993 .

[4]  Zbigniew Michalewicz,et al.  Evolutionary optimization of constrained problems , 1994 .

[5]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[6]  Marc Schoenauer,et al.  Constrained GA Optimization , 1993, ICGA.

[7]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[8]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[9]  Alice E. Smith,et al.  Genetic Optimization Using A Penalty Function , 1993, ICGA.

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

[11]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[12]  Z. Michalewicz Genetic Algorithms , Numerical Optimization , and Constraints , 1995 .

[13]  Fred Glover,et al.  Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .

[14]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..

[15]  Michael M. Skolnick,et al.  Using Genetic Algorithms in Engineering Design Optimization with Non-Linear Constraints , 1993, ICGA.

[16]  F. Glover HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[17]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[18]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[19]  James P. Kelly,et al.  Large-scale controlled rounding using tabu search with strategic oscillation , 1993, Ann. Oper. Res..