Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems

Expert Systems with Applications

Volumn 37, Issue 3, 2010, Pages 1863-1878

  Chang, Pei Chann ^a   Huang, Wei Hsiu ^a   Ting, Ching Jung ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Artificial chromosomes; Dynamic diversity; Genetic algorithm; Individual diversity

Indexed keywords

ARTIFICIAL CHROMOSOMES; COMBINATORIAL PROBLEM; DIVERSITY CONTROL; DIVERSITY LEVEL; DYNAMIC THRESHOLD; EARLY CONVERGENCE; ESSENTIAL PROBLEMS; EVOLUTIONARY PROCESS; GENETIC OPERATORS; GLOBAL CONVERGENCE; INDIVIDUAL DIVERSITY; LOCAL OPTIMA; PREMATURE CONVERGENCE; SOLUTION SPACE; THRESHOLD LEVELS; TSP PROBLEMS;

CHROMOSOMES; COMBINATORIAL MATHEMATICS; GENETIC ALGORITHMS; GENETIC ENGINEERING; MATHEMATICAL OPERATORS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

CONVERGENCE OF NUMERICAL METHODS;

EID: 70449526530     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.07.066     Document Type: Article

References (27)

1. Baker, J. E. (1989). An analysis of the effects of selection in genetic algorithms. PhD thesis, Computer Science Department, Vanderbilt University, Nashville, TN.
2. Black T., Fogel D.B., and Michalewicz Z. Handbook on evolutionary computation (1997), IOP Publishing Ltd. and Oxford University Press
3. Boonlong, K., Chaiyaratana, N., & Kuntanapreeda, S. (2002a). Time optimal and time-energy optimal control of a satellite attitude using genetic algorithms. In The 2002 ASME international mechanical engineering congress and exposition, New Orleans, LA, DSC-3343611-8.
4. Boonlong, K., Chaiyaratana, N., & Kuntanapreeda, S. (2002b). Using a co-operative co-evolutionary genetic algorithm to solve optimal control problems in a hysteresis system. In The 2002 world congress on computational intelligence - The 2002, congress on evolutionary computation, Honolulu, HI (Vol. 2, pp. 1504-1509).
5. Chang P.C., Chen S.H., and Fan C.Y. Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Applied Soft Computing Journal 8 1 (2008) 767-777
6. Chang P.C., Chen S.H., and Liu C.H. Sub-population genetic algorithm with mining gene structures for flow shop scheduling problems. Expert Systems with Applications 33 3 (2007) 762-771
7. Eshelman L.I. The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In: Rawlins G.J.E. (Ed). Foundations of genetic algorithm Vol. l (1991), Morgan Kanfmann, San Mateo, CA 265-283
8. Fonseca, C. M., & Fleming, P. J. (1993). Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization. In Proceedings of the fifth international conference on genetic algorithms.
9. Fonseca, C. M., & Fleming, P. J. (1995). Multi-objective genetic algorithms made easy: Selection, sharing and mating restriction. In Proceedings of the first international conference on generic algorithms in engineering systems: Innovations and applications, Sheffield, UK (pp. 45-52).
10. Fonseca C.M., and Fleming P.J. Multi-objective optimization and multiple constraint handling with evolutionary algorithms - Pan I: A unified formulation. IEEE Transactions on Systems, Man and Cybernetics 28 1 (1998) 26-37
11. Gen M., and Cheng R. Genetic algorithms and engineering design (1997), Wiley, New York
12. Goldberg D.E. Genetic algorithms in search, optimization and machine learning (1989), Addison-Wesley, Reading, Massachusetts
13. Goldberg, D. E., & Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In Genetic algorithms and their applications (ICGA'87) (pp. 41-49).
14. Larrañaga P., Kuijpers1 C.M.H., Murga1 R.H., Inza1 I., and Dizdarevic1 S. Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review 13 (1999)
15. Mauldin, M. L. (1984). Maintaining diversity in genetic search. In Proceedings of the national conference on artificial intelligence, Austin, TX (pp. 247-250).
16. Mori, N., Yoshida, J., Tamaki, H., Kita, H., & Nishikawa, Y. (1995). A thermo-dynamical selection rule for the genetic algorithm. In Proceedings of the second IEEE international conference on evolutionary computation, Perth, WA (pp. 188-192).
17. Peña, J., Robles, V., Larrañaga, P., Herves, V., Rosales, F., & Perez, M. (2004). GA-EDA: Hybrid evolutionary algorithm using genetic and estimation of distribution algorithms. In Innovations in applied artificial intelligence: 17th international conference on industrial and engineering applications of artificial intelligence and expert systems, IEA/AIE 2004, Ottawa, Canada, May 17-20.
18. Pimpawat, C., & Chaiyaratana, N. (2001). Using a cooperative co-evolutionary genetic algorithm to solve a three-dimensional container loading problem. In The 2001 congress on evolutionary computation, Seoul, Korea (Vol. 2, pp. 1197-1204).
19. Potter M.A., and DeJong K.A. A cooperative co-evolutionary approach to function optimization. Lecture Notes in Computer Science 866 (1994) 249-251
20. Shimodaira, H. (1996). A new genetic algorithm using large mutation rates and population-elitist selection (GALME). In Proceedings of the eighth IEEE international conference on tools with artificial intelligence, Toulouse, France (pp. 25-32).
21. Shimodaira, H. (1997). DCGA: A diversity control oriented genetic algorithm. In Proceedings of the second international conference on genetic algorithms in engineering systems: Innovations and applications, Glasgow, UK (pp. 444-449).
22. Shimodaira, H. (1999). A diversity control oriented genetic algorithm (DCGA): Development and experimental results. In: Proceedings of the genetic and evolutionary computation conference (Vol. 1, pp. 603-611).
23. Shimodaira, H. (2001). A diversity-control-oriented genetic algorithm (DCGA): Performance in function optimization. In The 2001 congress on evolutionary computation, Seoul, Korea (pp. 44-51).
24. Tsutsui S., Fujimoto Y., and Ghosh A. Forking genetic algorithms: GAs with search space division schemes. Evolutionary Computation 5 (1997) 61-80
25. Ursem, R. K., Angeline, P. J., Michalewicz, Z., Schoenauer, M., Yao, X., & Zalzala, A. (1999). Multinational evolutionary algorithms. In Proceedings of the congress of evolutionary computation (CEC-99) (Vol. 3, pp. 1633-1640).
26. Weerayuth, N., & Chaiyaratana, N. (2002). Closed-loop time-optimal path planning using a multi-objective diversity control oriented genetic algorithm. In The 2002 IEEE international conference on systems, man, and cybernetics, Hammamet, Tunisia (Vol. 6, pp. 345-351).
27. Whitley, D. (1989). The GENITOR algorithm and selection pressure: Why rank-based allocation of reproduction trials is best. In Proceedings of the third international conference on genetic algorithms, Fairfax, VA (pp. 116-121).