Description: Euclidean traveling salesman problem is a given n points in the plane of a connection to determine the length of these n points the shortest Hamiltonian circuit. Euclidean distance to satisfy the triangle inequality, so the Euclidean traveling salesman problem is a special character with the triangle inequality the traveling salesman problem. It is still a NP complete problem. Double adjustable loop is the shortest Euclidean TSP traveling salesman problem a special case. N points in the plane two-tone TSP from the left point of the loop is started, the most strictly from left to right until the right point, and strictly from right to left until the left point, and connecting each point exactly once in a closed circuit.
To Search:
File list (Check if you may need any files):
双调旅行售货问题.cpp
双调旅行售货员问题.doc
Download