The EAX Algorithm Considering Diversity Loss
暂无分享,去创建一个
[1] Shigenobu Kobayashi,et al. Deterministic Multi-step Crossover Fusion: A Handy Crossover Composition for GAs , 2002, PPSN.
[2] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[3] Yuichi Nagata. Criteria for designing crossovers for TSP , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[4] Hajime Kita,et al. A genetic solution for the traveling salesman problem by means of a thermodynamical selection rule , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[5] L. Darrell Whitley,et al. The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt , 1998, PPSN.
[6] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.
[7] B. Freisleben,et al. Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[8] Cheng-Yan Kao,et al. Solving traveling salesman problems by combining global and local search mechanisms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[9] Takeshi Yamada,et al. Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.
[10] Darrell Whitley,et al. Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .