This is the 18th video of the lecture series Optimization using Excel. Here we have discussed how to solve a Travelling Salesman Problem (TSP) problem using Integer Programming. A TSP is a specific type of network where the flow unit will start from a node and terminate the journey at the same node after visiting all the other nodes of the network only once. The objective is to minimize the total distance traveled.

Complete module:

1 Introduction: [ Ссылка ]
2. Introduction to LP: [ Ссылка ]
3. Graphical method to solve an LP: [ Ссылка ]
4. Introduction to Solver: [ Ссылка ]
5. Product mix problem: [ Ссылка ]
6. Sensitivity analysis: [ Ссылка ]
7. Integer programming: [ Ссылка ]
8. Transportation problem: [ Ссылка ]
9. Transshipment problem: [ Ссылка ]
10. Assignment problem: [ Ссылка ]
11. Set covering problem: [ Ссылка ]
12. Blending: [ Ссылка ]
13. Network flow introduction: [ Ссылка ]
14. Shortest path problems: [ Ссылка ]
15. Maxflow problem: [ Ссылка ]
16. Minimum Spanning Tree problem (Kruskal’s): [ Ссылка ]
17. Minimum Spanning Tree problem (Prim’s): [ Ссылка ]
18. Travelling Salesman Problem (ILP): [ Ссылка ]
19. Introduction to NLP: [ Ссылка ]
20. Use of GRG solver: [ Ссылка ]
21. Job sequencing model using Evolutionary solver: [ Ссылка ]
22. Travelling Salesman Problem using NLP: [ Ссылка ]


What type of problem is a Travelling salesman?

The traveling salesman problem (TSP) is an algorithmic problem tasked with finding the shortest route between a set of points and locations that must be visited. In the problem statement, the points are the cities a salesperson might visit.

What is travelling salesman problem explain with example?

The traveling salesman problem consists of a salesman and a set of cities. The salesman has to visit each one of the cities starting from a certain one (e.g. the hometown) and returning to the same city. The challenge of the problem is that the traveling salesman wants to minimize the total length of the trip.

Is travelling salesman problem solved?

Image result for travelling salesman problem
The traveling salesman problem is easy to state, and — in theory at least — it can be easily solved by checking every round-trip route to find the shortest one.

свернуть