Comparison of Heuristics for Resolving the Traveling Salesman Problem with Information Technology
Advanced materials research2014Vol. 886, pp. 593–597
Citations Over TimeTop 17% of 2014 papers
Abstract
Traveling Salesman Problem (Min TSP) is contained in the problem class NPO. It is NP-hard, means there is no efficient way to solve it. People have tried many kinds of algorithms with information technology. Thus in this paper we compare four heuristics, they are nearest neighbor, random insertion, minimum spanning tree and heuristics of Christofides. We dont try to find an optimal solution. We try to find approximated short trips via these heuristics and compare them.
Related Papers
- → Comparison of Heuristics for Resolving the Traveling Salesman Problem with Information Technology(2014)4 cited
- → The Solutions to Traveling Salesman Problem(2023)2 cited
- → A Natural Approach to Solving the Traveling Salesman Problem(2023)1 cited
- An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems(2006)
- Computation and Simulation Analysis of a Kind of Multiple Traveling Salesman problem(2009)