A proposal for Zoning Crossover of Hybrid Genetic Algorithms for large-scale traveling salesman problems
暂无分享,去创建一个
Moritoshi Yasunaga | Kunihito Yamamori | Ikuo Yoshihara | Masaharu Munetomo | Masafumi Kuroda | M. Yasunaga | I. Yoshihara | K. Yamamori | M. Munetomo | Masafumi Kuroda
[1] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[2] José Ignacio Hidalgo,et al. A hybrid heuristic for the traveling salesman problem , 2001, IEEE Trans. Evol. Comput..
[3] Dinh Hung Nguyen. Hybrid genetic algorithms for combinatorial optimization problems , 2004 .
[4] I. Yoshihara,et al. Modified edge recombination operators of genetic algorithms for the traveling salesman problem , 2000, 2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies.
[5] Yasunaga Moritoshi,et al. Greedy Genetic Algorithms for Symmetric and Asymmetric TSPs (特集 進化的計算) , 2002 .
[6] Forschungsinstitut für Diskrete. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .
[7] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[8] Moritoshi Yasunaga,et al. Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[9] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[10] Heinz Mühlenbein,et al. Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..
[11] Darrell Whitley,et al. Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .
[12] Hiroaki SENGOKU,et al. A Fast TSP Solver Using GA on JAVA , 1999 .