The figure below represents the customer locations and distances between them in

Question

The figure below represents the customer locations and distances between them in a logistical network (the table also provides the complete (symmetric) distance between the customers).

a) (15 pts): Assume our vehicle is at customer-A location and needs to go back to same location. Find a low cost (low distance) tour and associated total distance that visits all the customers starting with customer A and ending at customer A using the nearest neighborhood heuristic using initial iteration point as customer A.

b) (15 pts): Use the cheapest insertion heuristic to find a low-cost tour that visits all the customers exactly once. Report the tour sequence and the associated tour cost. Show the steps of your iterations.

Explanation / Answer

a) Using the nearest neighborhood heuristic, the path would be as follows:

A à B à F à E à C à D à A

Associated cost being: 24+49+18+57+47+57 = 252

b) For visiting all customers exactly once, the path would be: A à B à F à E à C à D

Associated cost being: 24+49+18+57+47 = 195

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.