Explore BrainMass

Explore BrainMass

    Traveling Salesman Problem: Nearest Neighborhood Method

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    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.

    © BrainMass Inc. brainmass.com October 9, 2019, 11:10 pm ad1c9bdddf


    Solution Summary

    This posting contains the attachment that solves the problem using the nearest neighbor method. It has step-by-step procedures and explanations to easily understand the concept.