In Example 5.7, consider the addition of two more locations: (12, 12)

with a demand of 13, and (3, 11) with a demand of 5.

a. Ignore capacity (and demands) and solve the TSP using the nearest neighbor (from and to the DC).

b. From your answer in (a), identify an opportunity of a two-opt (if any) and perform a local improvement.

c. Formulate the TSP problem as an optimization problem in Excel

(use the alldifferent constraint) and solve.

Example 5.7 This simple daily routing example illustrates Savings Method. A depot (T) is located at (5,5). The depot serves four customers (A to D) with the following locations and daily demands:

Cost per unit distance of travel is $100. Truck capacity is 20 units, and distance is measured using the Euclidean metric. The distance between each location pair is given by 

Transcribed Image Text:

Customer C C C3 C X-location 2 7 9 3 Y-location 8 3 9 8 Daily Demand 12 11 6 8