THREE GENDERS GA WITH EDGE EXCHANGE CROSSOVER
The traveling salesman problem (TSP) is a typical combinatorial problem in Operations Research. GA is a useful heuristic method and uses techniques which are based on the means of natural selection such as inher itance, selection, mutation and crossover. In this study, edge exchange crossover method (EXX) has been modified to introduce 3 genders to GA which may avoid fast convergence toward a local optimal. The three gen ders GA keeps various gene characteristics in populations and is going to solve the tendencies. The proposed three genders GA has been compared with normal EXX through some benchmark problems in TSPLIB. The proposed method has obtained better route than the EXX in large benchmark problems.
Genetic Algorithm genders edge exchange crossover (EXX) TSPLIB
Yohei Miki Yoshinari Yanagawa Hiroki Okubo Shigeji Miyazaki
Graduate school of Natural Science and Technology, Okayama University, Okayama, 700 -8530, Japan
国际会议
The Ninth International Conference on Industrial Management(第九届工业管理国际会议 ICIM2008)
日本大阪
英文
763-768
2008-09-16(万方平台首次上网日期,不代表论文的发表时间)