Microgenetic algorithms as generalized hill-climbing operators for GA optimization

We investigate the potential of a microgenetic algorithm (MGA) as a generalized hill-climbing operator. Combining a standard GA with the suggested MGA operator leads to a hybrid genetic scheme GA-MGA, with enhanced searching qualities. The main GA performs global search while the MGA explores a neighborhood of the current solution provided by the main GA, looking for better solutions. The MGA operator performs genetic local search. The major advantage of MGA is its ability to identify and follow narrow ridges of arbitrary direction leading to the global optimum. The proposed GA-MGA scheme is tested against 13 different schemes, including a simple GA and GAs with different hill-climbing operators. Experiments are conducted on a test set including eight constrained optimization problems with continuous variables. Extensive simulation results demonstrate the efficiency of the proposed GA-MGA scheme. For the same number of fitness evaluations, GA-MGA exhibited a significantly better performance in terms of solution accuracy, feasibility percentage of the attained solutions, and robustness.

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

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

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

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

[5]  Kalmanje Krishnakumar,et al.  Micro-Genetic Algorithms For Stationary And Non-Stationary Function Optimization , 1990, Other Conferences.

[6]  John A. Miller,et al.  An evaluation of local improvement operators for genetic algorithms , 1993, IEEE Trans. Syst. Man Cybern..

[7]  James Bowen,et al.  Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[9]  Vassilios Petridis,et al.  Varying Fitness Functions in Genetic Algorithms: Studying the Rate of Increase of the Dynamic Penalty Terms , 1998, PPSN.

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

[11]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[12]  Patrick D. Surry,et al.  Formal Memetic Algorithms , 1994, Evolutionary Computing, AISB Workshop.

[13]  Zbigniew Michalewicz,et al.  GENOCOP: a genetic algorithm for numerical optimization problems with linear constraints , 1996, CACM.

[14]  Vassilios Petridis,et al.  Varying fitness functions in genetic algorithm constrained optimization: the cutting stock and unit commitment problems , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[15]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

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

[17]  Hyun Myung,et al.  Evolutionary programming techniques for constrained optimization problems , 1997, IEEE Trans. Evol. Comput..

[18]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

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

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

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

[22]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[23]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[24]  Robert G. Reynolds,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[25]  Vassilios Petridis,et al.  Varying quality function in genetic algorithms and the cutting problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[26]  Anastasios G. Bakirtzis,et al.  A genetic algorithm solution to the unit commitment problem , 1996 .