Explore BrainMass
Share

Explore BrainMass

    Traveling Salesman Problem

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

    Provide an example of when the traveling salesman problem can be used to find the best solution to a problem pertaining to grocery stores.

    © BrainMass Inc. brainmass.com October 10, 2019, 4:49 am ad1c9bdddf
    https://brainmass.com/math/algebra/traveling-salesman-problem-478678

    Solution Preview

    The Traveling Salesman Problem (TSP) is an algorithm used to solve the following problem:

    Given a list of locations and their pairwise distances, find the shortest possible route that visits each location exactly once and returns to the origin.

    Grocery stores chains need to be restocked daily. For example, if there are 150 Walmarts in the Boston area, all 150 need to be visited by the supply truck for restocking. If the ...

    Solution Summary

    This solution provides an example of when the traveling salesman problem can be used to find the best solution to a problem pertaining to grocery stores.

    $2.19