One of the best known routing problems is the traveling salesman problem (TSP) which requires a salesman to travel from a starting location to a predetermined set of destinations exactly once and complete the tour by returning to the place of origin.  In doing so, the goal or objective of the salesman is to travel along that route that minimizes the total distance.  Many variations of the TSP have been