Selecting survivors in genetic algorithm using tabu search strategies

Genetic algorithm (GA) is well-known for its effectiveness in global search and optimization. To balance selection pressure and population diversity is an important issue of designing GA. This paper proposes a novel hybridization of GA and tabu search (TS) to address this issue. The proposed method embeds the key elements of TS—tabu restriction and aspiration criterion—into the survival selection operator of GA. More specifically, the tabu restriction is used to prevent inbreeding for diversity maintenance, and the aspiration criterion is activated to provide moderate selection pressure under the tabu restriction. The interaction of tabu restriction and aspiration criterion enables survivor selection to balance selection pressure and population diversity. The experimental results on numerical and combinatorial optimization problems show that this hybridization can significantly improve GAs in terms of solution quality as well as convergence speed. An empirical analysis further identifies the influences of the TS strategies on the performance of this hybrid GA.

[1]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[2]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[3]  K. Handa,et al.  Polycell placement for analog LSI chip designs by genetic algorithms and tabu search , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[4]  Tonghua Li,et al.  The combination of principal component analysis, genetic algorithm and tabu search in 3d molecular similarity , 2004 .

[5]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[6]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[7]  Hitoshi Iba,et al.  The Memetic Tree-based Genetic Algorithm and its application to Portfolio Optimization , 2009, Memetic Comput..

[8]  Linet Özdamar,et al.  Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions , 1998, Eur. J. Oper. Res..

[9]  Hans-Paul Schwefel,et al.  Numerical Optimization of Computer Models , 1982 .

[10]  Chungnan Lee,et al.  On the harmonious mating strategy through tabu search , 2003, Inf. Sci..

[11]  Andrew Lim,et al.  A new GA approach for the vehicle routing problem , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[12]  K. Nara,et al.  Genetic algorithm for power systems planning , 1997 .

[13]  Jin-O Kim,et al.  Optimal service restoration and reconfiguration of network using Genetic-Tabu algorithm , 2004 .

[14]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[15]  Ville Tirronen,et al.  Scale factor local search in differential evolution , 2009, Memetic Comput..

[16]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[17]  L. Buydens,et al.  Hybrid genetic algorithm-tabu search approach for optimising multilayer optical coatings , 2003 .

[18]  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).

[19]  Jean-Charles Billaut,et al.  A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem , 2008, Eur. J. Oper. Res..

[20]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[21]  A. Griewank Generalized descent for global optimization , 1981 .

[22]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..

[23]  Luca Maria Gambardella,et al.  Results of the first international contest on evolutionary optimisation (1st ICEO) , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[24]  Sue Abdinnour-Helm,et al.  A hybrid heuristic for the uncapacitated hub location problem , 1998, Eur. J. Oper. Res..

[25]  M. Gandomkar,et al.  A Genetic–Based Tabu Search Algorithm for Optimal DG Allocation in Distribution Networks , 2005 .

[26]  Songde Ma,et al.  Protein folding simulations of the hydrophobic–hydrophilic model by combining tabu search with genetic algorithms , 2003 .

[27]  Sheng-Tun Li,et al.  TGA: a new integrated approach to evolutionary algorithms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[28]  Xin Yao,et al.  Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization , 2009, Memetic Comput..

[29]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[30]  D. Ackley A connectionist machine for genetic hillclimbing , 1987 .