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 • 18. Travelling Salesma...
#tsp #TravellingSalesmanProblem #evolutionary #msexcel #nonlinear
Complete module:
1 Introduction: • 1.Introduction | Optim...
2. Introduction to LP: • 2.Introduction to LP |...
3. Graphical method to solve an LP: • 3.Graphical method an ...
4. Introduction to Solver: • 4.Introduction to Solv...
5. Product mix problem: • 5.Solving a Product Mi...
6. Sensitivity analysis: • 6.Sensitvity and Answe...
7. Integer programming: • 7.Integer programming ...
8. Transportation problem: • 8.Transportation probl...
9. Transshipment problem: • 9.Transshipment Proble...
10. Assignment problem: • 10.Assignment Problem ...
11. Set covering problem: • 10.Assignment Problem ...
12. Blending: • 12.Blending or Diet pr...
13. Network flow introduction: • 13.Network flow models...
14. Shortest path problems: • 14. Shortest Path Prob...
15. Maxflow problem: • 15. Maxflow problem | ...
16. Minimum Spanning Tree problem (Kruskal’s): • 16. Minimum Spanning T...
17. Minimum Spanning Tree problem (Prim’s): • 17. How to solve the M...
18. Travelling Salesman Problem (ILP): • 18. Travelling Salesma...
19. Introduction to NLP: • 19. Introduction to No...
20. Use of GRG solver: • 20. Solving a non-line...
21. Job sequencing model using Evolutionary solver: • 21. A Job Sequencing p...
22. Travelling Salesman Problem using NLP: • 22. Travelling Salesma...
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.