A study on the design issues of Memetic Algorithm

Over the recent years, there has been increasing research activities made on improving the efficacy of memetic algorithm (MA) for solving complex optimization problems. Particularly, these efforts have revealed the success of MA on a wide range of real world problems. MAs not only converge to high quality solutions, but also search more efficiently than their conventional counterparts. Despite the success and surge in interests on MAs, there is still plenty of scope for furthering our understanding on how and why synergy between population- based and individual learning searchers would lead to successful Memetic Algorithms. In this paper we outline several important design issues of Memetic Algorithms and present a systematic study on each. In particular, we conduct extensive experimental studies on the impact of each individual design issue and their relative impacts on memetic search performances by means of three commonly used synthetic problems. From the empirical studies obtained, we attempt to reveal the behaviors of several MA variants to enhance our understandings on MAs.

[1]  W. Hart.  Adaptive global optimization with local search , 1994 .

[2]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[4]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[5]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[6]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[7]  Meng Joo Er,et al.  PARALLEL MEMETIC ALGORITHM WITH SELECTIVE LOCAL SEARCH FOR LARGE SCALE QUADRATIC ASSIGNMENT PROBLEMS , 2006 .

[8]  Kai-Yew Lum,et al.  Max-min surrogate-assisted evolutionary algorithm for robust design , 2006, IEEE Transactions on Evolutionary Computation.

[9]  Jorge Nocedal,et al.  Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.

[10]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[11]  MENG HIOT LIM,et al.  Iterative genetic algorithm for learning efficient fuzzy rule set , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[12]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[13]  Ju Li,et al.  A QoS-Tunable Scheme for ATM Cell Scheduling Using Evolutionary Fuzzy System , 2005, Applied Intelligence.

[14]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[15]  David E. Goldberg,et al.  Optimizing Global-Local Search Hybrids , 1999, GECCO.

[16]  Jing Tang,et al.  Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems , 2006, Soft Comput..

[17]  Feng-Sheng Wang,et al.  Hybrid differential evolution with multiplier updating method for nonlinear constrained optimization problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[18]  Jim Smith,et al.  A Memetic Algorithm With Self-Adaptive Local Search: TSP as a case study , 2000, GECCO.

[19]  Bah-Hwee Gwee,et al.  An evolution search algorithm for solving N-queen problems , 2005, Int. J. Comput. Appl. Technol..

[20]  Yu Yuan,et al.  Extensive Testing of a Hybrid Genetic Algorithm for Solving Quadratic Assignment Problems , 2002, Comput. Optim. Appl..

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

[22]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[23]  Kay Chen Tan,et al.  A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows , 2003, Comput. Optim. Appl..

[24]  A. Keane,et al.  Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling , 2003 .

[25]  Kok Wai Wong,et al.  Surrogate-Assisted Evolutionary Optimization Frameworks for High-Fidelity Engineering Design Problems , 2005 .