This is the 22nd video of the lecture series Optimization using Excel. Here we have solved the Travelling Salesman Problem (TSP) problem once again using the non-linear approach. 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. Setting up a TSP using a non-linear approach is easier compared to integer programming. However, the solving time is worse compared to integer programming.

TSP using integer programming was discussed in the video number 18 which is https://youtu.be/WO9NPOXl3aI


#tsp #TravellingSalesmanProblem #evolutionary #msexcel #nonlinear

Complete module:

1 Introduction: https://youtu.be/wbnfcUzWGrE
2. Introduction to LP: https://youtu.be/lr9dJNIeBiU
3. Graphical method to solve an LP: https://youtu.be/4KMQjD9vC7U
4. Introduction to Solver: https://youtu.be/enzlJrqV2N4
5. Product mix problem: https://youtu.be/uvk7ixnXzCg
6. Sensitivity analysis: https://youtu.be/rj7h7Zxj8dY
7. Integer programming: https://youtu.be/NloA4Zm6_1o
8. Transportation problem: https://youtu.be/bDHMi8G4e5E
9. Transshipment problem: https://youtu.be/_PLvU3nqUbw
10. Assignment problem: https://youtu.be/VNhsI4pId7g
11. Set covering problem: https://youtu.be/VNhsI4pId7g
12. Blending: https://youtu.be/921SwHikHDI
13. Network flow introduction: https://youtu.be/hla2zRkrJ3g
14. Shortest path problems: https://youtu.be/4T55qfqDLOQ
15. Maxflow problem: https://youtu.be/OQwIYctJaAM
16. Minimum Spanning Tree problem (Kruskal’s): https://youtu.be/uNpf8vvIePs
17. Minimum Spanning Tree problem (Prim’s): https://youtu.be/75MQLe5cpgk
18. Travelling Salesman Problem (ILP): https://youtu.be/WO9NPOXl3aI
19. Introduction to NLP: https://youtu.be/hcGbzqTgUys
20. Use of GRG solver: https://youtu.be/ZJT1fDqyoX8
21. Job sequencing model using Evolutionary solver: https://youtu.be/toGkKF_6_Tw
22. Travelling Salesman Problem using NLP: https://youtu.be/5da-jUXDrps


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.