Traveling Salesman Problem: Nearest Neighborhood Method

Jon is a traveling salesman for a pharmaceutical company. His territory includes 5 cities and he needs to find the least expensive route to the cities and home. Starting at city A, determine the optimal route using nearest neighborhood method.

Attached is the whole problem with the diagram.

© SolutionLibrary Inc. solutionlibary.com 9836dcf9d7 https://solutionlibrary.com/math/algebra/traveling-salesman-problem-nearest-neighborhood-method-7h9m
Attachments