On the harmonious mating strategy through tabu search

Information Sciences

Volumn 156, Issue 3-4, 2003, Pages 189-214

  Ting, Chuan Kang ^a   Li, Sheng Tun ^b   Lee, Chungnan ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

^b NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

Author keywords

Genetic algorithm; Restrictive mating; Sexual selection; Tabu search; Traveling salesman problem

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

HARMONIOUS MATING STRATEGY;

INFORMATION SCIENCE;

EID: 0141844528     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(03)00176-2     Document Type: Article

References (46)

1. Holland J.H. Adaptation in Natural and Artificial Systems. 1975;University of Michigan Press.
2. Goldberg D.E. Genetic Algorithm in Search, Optimization, and Machine Learning. 1989;Addison-Wesley Publishing Company Inc.
3. Davis L. Handbook of Genetic Algorithms. 1991;Von Nostrand Reinhold.
4. Gen M., Cheng R. Genetic Algorithms and Engineering Design. 1997;A Wiley-Interscience Publication.
5. Man K.F., Tang K.S., Kwong S. Genetic Algorithms. 1999;Springer-Verlag, London.
6. D. Whitley, The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best, in: Proceedings of 3rd International Conference on Genetic Algorithms, San Mateo, CA, 1989, pp. 116-121.
7. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Publishers.
8. Pham D.T., Karaboga D. Intelligent Optimisation Techniques: Genetic Algorithms, Tabu search, Simulated Annealing and Neural Networks. 2000;Springer-Verlag, London.
9. Glover F., Kelly J.P., Laguna M. Genetic algorithms and tabu search: Hybrid for optimization. Comput. Oper. Res. 22(1):1995;111-134.
10. Handa K., Kuga S. Pollycell placement for analog LSI chip designs by genetic algorithms and tabu search. IEEE Int. Conf. Evol. Comput. 2:1995;716-721.
11. A.J. Chin, H.W. Kit, A. Lim, A new GA approach for the vehicle routing problem, in: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence, 1999, pp. 307-310.
12. Abdinnour-Helm S. A hybrid heuristic for the uncapacitated hub location problem. Eur. J. Oper. Res. (106):1998;489-499.
13. Mantawy A.H., Abdel-Magid Y.L., Selim S.Z. Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem. IEEE Trans. Power System. 4(3):1999;829-836.
14. Liaw C.F. A hybrid genetic algorithm for the open shop scheduling problem. Eur. J. Oper. Res. (124):2000;28-42.
15. Ozdamar L., Birbil S.I. Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur. J. Oper. Res. (110):1998;525-547.
16. K. Nara, Genetic algorithm for power systems planning, in: Proceedings of the Fourth International Conference on Advances in Power System Control, Operation and Management, 1997.
17. Liu Y., Ma L., Zhang J. GA/SA/TS hybrid algorithms for reactive power optimization. IEEE Power Eng. Soc. Summer Meeting. 1:2000;245-249.
18. K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, Doctoral Dissertation, University of Michigan, Ann Arbor, 1975.
19. A. Petrowski, A new selection operator dedicated to speciation, in: Proceedings of the Seventh International Conference on Genetic Algorithms, 1997, pp. 144-151.
20. Mauldin M.L. Maintaining diversity in genetic search. Proc. Natl. Conf. AI. 31:1984;247-250.
21. L.J. Eshelman, J.D. Schaffer, Preventing premature convergence in genetic algorithms by preventing incest, in: Proceedings of the Fourth International Conference on Genetic Algorithms, 1991, pp. 115-122.
22. H. Shimodaira, DCGA: a diversity control oriented genetic algorithm, IEEE International Conference on Tools with Artificial Intelligence, 1997, pp. 367-374.
23. Matsui K. New selection method to improve the population diversity in genetic algorithms. IEEE Int. Conf. Systems, Man, Cybernet. 1:1999;625-630.
24. C. Fernandes, A. Rosa, A study on non-random mating and varying population size in genetic algorithm using a royal road function, in: Proceedings of IEEE Congress on Evolutionary Computation, Seoul, South Korea, 2001.
25. M. Mitchell, S. Forrest, J.H. Holland, The royal road for genetic algorithms: Fitness landscapes and GA performance, in: Proceedings of the First European Conference on Artificial Life, 1992.
26. R. Bian, Z. Chen, Z. Yuan, Improved crossover strategy of genetic algorithms and analysis of its performance, in: Proceedings of the Third World Congress on Intelligent Control and Automation, 2000, pp. 516-520.
27. De S., Pal S.K., Ghosh A. Genotypic and phenotypic assortative mating in genetic algorithm. Inform. Sci. 105:1998;209-226.
28. Fernandes C., Tavares R., Munteanu C., Rosa A. Assortative mating in genetic algorithms for vector quantization problems. Proc. ACM SAC. 2001:2001;361-365.
29. I. Chakraborty, B. Chakraborty, Ideal marriage for fine tuning in GA, in: Proceedings of IEEE International Conference Systems, Man, and Cybernetics, vol. 1, 1999, pp. 631-636.
30. E. Ronald, When selection meets seduction, in: Proceedings of the Sixth International Conference on Genetic Algorithms, 1995, pp. 167-173.
31. Ratford M., Tuson A., Thompson H. An investigation of sexual selection as a mechanism for obtaining multiple distinct solutions. Emerg. Technol. 1997.
32. Mori N., Yoshida J., Tamaki H., Kita H., Nishikawa Y. A thermodynamical selection rule for the genetic algorithm. Proc. IEEE Int. Conf. Evol. Comput. 1:1995;188-192.
33. R. Craighurst, W. Martin, Enhancing GA performance through crossover prohibitions based on ancestry, in: Proceedings of the Sixth International Conference on Genetic Algorithms, 1996, pp. 130-135.
34. C. Fernandes, R. Tavares, A. Rosa, niGAVaPS - Outbreeding in genetic algorithms, in: Proceedings of the 2000 ACM Symposium on Applied Computing, 2000, pp. 477-482.
35. W.M. Spears, Simple subpopulation schemes, in: Evolutionary Programming Conference, 1994, pp. 296-307.
36. C. Ryan, Racial harmony and function optimization in genetic algorithms - The races genetic algorithm, in: Proceedings of EP'95. The MIT Press.
37. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem, http://www.research.att.com/~dsj/chtsp/index.html.
38. Ronald S. Distance functions for order-based encodings. IEEE Int. Conf. Evolut. Comput. 1997;49-54.
39. Bandyopadhyay S., Pal S.K. Incorporating chromosome differentiation in genetic algorithms. Informat. Sci. 104:1998;293-319.
40. Bandyopadhyay S., Pal S.K. Pattern classification with genetic algorithms: Incorporation of chromosome differentiation. Pattern Recogn. Lett. 18:1997;119-131.
41. Hedrick P.W. Genetics of Population. 2000;Jones & Bartlett Publishers.
42. Hartl D.L., Clark A.G. Principles of Population Genetics. 1997;Sinauer Associates.
43. Srinivas M., Patnaik L.M. Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Systems, Man, Cybernet. 24(4):1994;656-667.
44. Pal S.K., Bandyopadhyay S., Murthy C.A. Genetic algorithms for generation of class boundaries, Man, and Cybernetics. IEEE Trans. Systems. 28(6):1998;816-828.
45. Hinterding R., Michalewicz Z., Eiben A.E. Adaptation in evolutionary computation: a survey. IEEE Int. Conf. Evolut. Comput. 1997;65-69.
46. Eiben A.E., Hinterding R., Michalewicz Z. Parameter control in evolutionary algorithms. IEEE Trans. Evolut. Comput. 3(2):1999;124-141.