I am working on the Traveling Salesman Problem. I have a good grasp of the overa

Question

I am working on the Traveling Salesman Problem. I have a good grasp of the overall problem, but I am trying to figure out how to split the route. For example, you start in Boston( index 0) and you have 10 cities but you need to end back in Boston(index 0) during the half of the trip you had to go back to Boston (index 0). Technically, you have to be more than 2 times in Boston. This problem is being solved using Solver, so Index has been used. I know how to solve the problem, but I can't figure out how to split it in two, so the sales man leaves Boston and visits 5 cities, comes back to Boston, and then leaves again to the other 5 cities to end in Boston.

Explanation / Answer

The problem can be solved using linear programming method in excel using solver where if you are being given some data in terms of distance and cost to cover that distance, you can put the data in solver in excel and also write the constraints in solver usinf equations so as to optimize the route with minimal cost.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

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