The Traveling Salesman Problem **************************************** Please c

Question

The Traveling Salesman Problem

****************************************

Please cite your sources and be as detailed as possible. Also, try to explain it in a non-technical

sense that is easy to understand for someone who might not have an extensive CS background.

***************************************

1)How does the traveling salesman problem (TSP) with graphs decide which route is the shortest?

2)How does the traveling salesman problem (TSP) know it has already visited a city?

3)Does TSP require a designated starting point, or does it pick one itself?

Again please cite your sources and be as detailed as possible when answering the above and describing the process that the program takes.

Explanation / Answer

1)TSP: person whose work is selling his company products in nearby places less time.think in this way .Consider places like nearby cities.some other way we can go one city to another city.i.e,distance we have to consider as a parameter.

Nodes :cities,edge weight:distance between cities so we apply graph algorithms like shortest path algorithms.

2)while traversing graph we mark it as visited node.

3)no, there is no particular starting point.we can pick our self starting point.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

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