Improving Efficiency of Heuristics for the Large Scale Traveling Thief Problem
暂无分享,去创建一个
Xiaodong Li | Xin Yao | Yi Mei | X. Yao | Xiaodong Li | Yi Mei
[1] Borut alik. An efficient sweep-line Delaunay triangulation algorithm , 2005 .
[2] Zbigniew Michalewicz,et al. A comprehensive benchmark set and heuristics for the traveling thief problem , 2014, GECCO.
[3] David E. Goldberg,et al. AllelesLociand the Traveling Salesman Problem , 1985, ICGA.
[4] N. Krasnogor,et al. A NEW HYBRID HEURISTIC FOR LARGE GEOMETRIC TRAVELING SALESMAN PROBLEMS BASED ON THE DELAUNAY TRIANGULATION , 1995 .
[5] Jon Louis Bentley,et al. K-d trees for semidynamic point sets , 1990, SCG '90.
[6] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[7] Xin Yao,et al. Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems , 2009, IEEE Transactions on Evolutionary Computation.
[8] Xin Yao,et al. A Global Repair Operator for Capacitated Arc Routing Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[9] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[10] Xin Yao,et al. Improved memetic algorithm for Capacitated Arc Routing Problem , 2009, 2009 IEEE Congress on Evolutionary Computation.
[11] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[12] Gerhard Reinelt,et al. Fast Heuristics for Large Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[13] David S. Johnson,et al. Data structures for traveling salesmen , 1993, SODA '93.
[14] Xin Yao,et al. Simulated annealing with extended neighbourhood , 1991, Int. J. Comput. Math..
[15] Nicos Christofides. The optimum traversal of a graph , 1973 .
[16] Xin Yao,et al. A Memetic Algorithm for Periodic Capacitated Arc Routing Problem , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[17] Xin Yao,et al. Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem , 2011, IEEE Transactions on Evolutionary Computation.
[18] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[19] Xin Yao,et al. Dynamic Neighbourhood Size in Simulated Annealing , 1992 .
[20] Zbigniew Michalewicz,et al. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems , 2013, 2013 IEEE Congress on Evolutionary Computation.
[21] Borut Zalik. An efficient sweep-line Delaunay triangulation algorithm , 2005, Comput. Aided Des..
[22] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[23] Xiaodong Li,et al. Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems , 2014, IEEE Transactions on Evolutionary Computation.