Selecting survivors in genetic algorithm using tabu search strategies

Memetic Computing

Volumn 1, Issue 3, 2009, Pages 191-203

  Ting, Chuan Kang ^a   Ko, Cheng Feng ^a   Huang, Chih Hui ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithm; Hybridization; Survival selection; Tabu search

Indexed keywords

ASPIRATION CRITERIA; COMBINATORIAL OPTIMIZATION PROBLEMS; CONVERGENCE SPEED; DIVERSITY MAINTENANCE; EMPIRICAL ANALYSIS; GLOBAL SEARCH; HYBRIDIZATION; KEY ELEMENTS; POPULATION DIVERSITY; SEARCH STRATEGIES; SELECTION OPERATORS; SELECTION PRESSURES; SOLUTION QUALITY; SURVIVAL SELECTION;

COMBINATORIAL OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS;

TABU SEARCH;

EID: 79251627173     PISSN: 18659284     EISSN: 18659292     Source Type: Journal    
DOI: 10.1007/s12293-009-0013-z     Document Type: Article

References (33)

1. Abdinnour-Helm S (1998) A hybrid heuristic for the uncapacitated hub location problem. Eur J Oper Res 106: 489-499.
2. Ackley DH (1987) A connectionist machine for genetic Hillclimbing. Kluwer, Boston.
3. Aranha C, Iba H (2009) The memetic tree-based genetic algorithm and its application to portfolio optimization. Memetic Comput 1(2): 139-151.
4. Bersini H, Dorigo M, Langerman S, Seront G, Gambardella L (1996) Results of the first international contest on evolutionary optimisation. In: Proceedings of the Third IEEE conference on evolutionary computation, pp 611-615.
5. Chin AJ, Kit HW, Lim A (1999) A new GA approach for the vehicle routing problem. In: Proceedings of the 11th IEEE international conference on tools with artificial intelligence, pp 307-310.
6. De Jong K (1975) An analysis of the behavior of a class of genetic adaptive systems. Ph. D. thesis, University of Michigan.
7. Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Natural Computing. Springer, Heidelberg.
8. Gandomkar M, Vakilian M, Ehsan M (2005) A genetic-based tabu search algorithm for optimal DG allocation in distribution networks. Elect Power Compon Syst 33(12): 1351-1361.
9. Glover F, Kelly JP, Laguna M (1995) Genetic algorithms and tabu search: hybrid for optimization. Computers Ops Res 22(1): 1-134.
10. Glover F, Languna M (1997) Tabu search. Kluwer, Boston.
11. Griewank AO (1981) Generalized descent for global optimization. J Optim Theory Appl 34(1): 11-39.
12. Hageman JA, Wehrens R, van Sprang HA, Buydens LMC (2003) Hybrid genetic algorithm-tabu search approach for optimising multilayer optical coatings. Anal Chim Acta 490: 211-222.
13. Handa K, Kuga S (1995) Pollycell placement for analog lsi chip designs by genetic algorithms and tabu search. In: IEEE int. conf. evol. comput., pp 716-721.
14. Hart WE, Krasnogor N, Smith JE (2004) Recent advances in memetic algorithms. Springer, Heidelberg.
15. Hasan SMK, Sarker R, Essam D, Cornforth D (2009) Memetic algorithms for solving job-shop scheduling problems. Memetic Comput 1(1): 69-83.
16. Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Michigan.
17. Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2): 204-223.
18. Jiang T, Cui Q, Shi G, Ma S (2003) Protein folding simulations of the hydrophobic-hydrophilic model by combining tabu search with genetic algorithms. J Chem Phys 119(8): 4592-4596.
19. Liaw CF (2000) A hybrid genetic algorithm for the open shop scheduling problem. Eur J Oper Res 124: 28-42.
20. Nara K (1997) Genetic algorithm for power systems planning. In: Proceedings of the fourth international conference on advances in power system control, operation and management, pp 11-14.
21. Neri F, Tirronen V (2009) Scale factor local search in differential evolution. Memetic Comput 1(2): 153-171.
22. Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern Part B Cybern 36(1): 141-152.
23. Ozdamar L, Birbil SI (1998) Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur J Oper Res 110: 525-547.
24. Rastrigin LA (1974) Systems of extremal control. Nauka, Moscow.
25. Gerhard Reinelt. TSPLIB http://www. iwr. uni-heidelberg. de/groups/comopt/software/TSPLIB95/ (1995).
26. Schwefel HP (1981) Numerical optimization of computer models. Wiley, New York.
27. Shin DJ, Kim JO, Kim KT, Choo JB, Singh C (2004) Optimal service restoration and reconfiguration of network using genetic-tabu algorithm. Elect Power Syst Res 71: 145-152.
28. Ting CK, Li ST, Lee C (2001) Tga: a new integrated approach to evolutionary algorithms. In: Proc. of the IEEE congress on evolutionary computation, pp 917-924.
29. Ting CK, Li ST, Lee CN (2003) On the harmonious mating strategy through tabu search. Inform Sci 156: 189-214.
30. Vilcot G, Billaut JC (2008) A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur J Oper Res 190: 398-411.
31. Whitley D (1989) The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Proc. of the 3rd international conference on genetic algorithms, pp 116-121, San Mateo, CA.
32. Xian B, Li T, Sun G, Cao T (2004) The combination of principal component analysis, genetic algorithm and tabu search in 3d molecular similarity. Mol Struct 674: 87-97.
33. Yu X, Tang K, Chen T, Yao X (2009) Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memetic Comput 1(1): 3-24.