Computational comparison of GRASP and DCTSP methods for the Traveling Salesman Problem
2017 2ND INTERNATIONAL CONFERENCE ON IMAGE, VISION AND COMPUTING (ICIVC 2017)(2017)
摘要
The greedy randomized adaptive search procedure and the dynamic convexized method are two state-of-the-art methods for the traveling salesman problem, which are tour improvement methods. For comparing the performances of the two methods, we give the implementation details, and test the two methods on the TSPLIB standard test instances. Experimental results show that the dynamic convexized method outperforms the greedy randomized adaptive search procedure for the traveling salesman problem.
更多查看译文
关键词
traveling salesman problem, dynamic convexized method, GRASP
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要