The Traveling Salesperson Problem
M117, December 2, 2011 (due December 5, 2011)
Your name:
A salesperson wants to travel to each of the following four cities exactly once, starting and
ending in Winston Salem. The goal is to find a route which will minimize the total distance
traveled.
(1) List all of the possible Hamiltonian circuits starting and ending in Winston Salem.
These are the possible routes the salesperson can take.
(2) Calculate the distance traveled for each of the routes.