The Traveling Salesman Problem is one of the most well known problems
in operations research, computer science, and mathematics. Many
algorithms have been proposed for the solution of this problem.
A typical solution process is stepwise, where first an initial
tour is constructed, then any remaining unvisited points are inserted, and
then the existing tour is improved. There are many possible
algorithms for each step.
Create an initial tour
convex hull, sweep, nearest neighbor algorithms
Insert remaining free points
cheapest, farthest insertion algorithms
Improve existing tour
two, three, or Or exchange algorithms
In the next section, a demonstration of the TSP algorithms will be presented using the TOURS software package.
