22. Travelling Salesman Problem (TSP) using the Evolutionary solver | Optimization Using Excel

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 Salesman Problem (TSP) usin...  


#tsp #TravellingSalesmanProblem #evolutionary #msexcel #nonlinear

Complete module:

1 Introduction:    • 1.Introduction | Optimization using Excel  
2. Introduction to LP:    • 2.Introduction to LP | Optimization using ...  
3. Graphical method to solve an LP:    • 3.Graphical method an LP | Optimization us...  
4. Introduction to Solver:    • 4.Introduction to Solver tool | Optimizati...  
5. Product mix problem:    • 5.Solving a Product Mix Problem using Solv...  
6. Sensitivity analysis:    • 6.Sensitvity and Answer reports | Optimiza...  
7. Integer programming:    • 7.Integer programming & Binary Integer pro...  
8. Transportation problem:    • 8.Transportation problem | Optimization us...  
9. Transshipment problem:    • 9.Transshipment Problem | Optimization usi...  
10. Assignment problem:    • 10.Assignment Problem | Optimization using...  
11. Set covering problem:    • 10.Assignment Problem | Optimization using...  
12. Blending:    • 12.Blending or Diet problem | Optimization...  
13. Network flow introduction:    • 13.Network flow models (introduction) | Op...  
14. Shortest path problems:    • 14. Shortest Path Problem | Optimization u...  
15. Maxflow problem:    • 15. Maxflow problem | Optimization using E...  
16. Minimum Spanning Tree problem (Kruskal’s):    • 16. Minimum Spanning Tree problem using Kr...  
17. Minimum Spanning Tree problem (Prim’s):    • 17. How to solve the Minimum Spanning Tree...  
18. Travelling Salesman Problem (ILP):    • 18. Travelling Salesman Problem (TSP) usin...  
19. Introduction to NLP:    • 19. Introduction to Non-Linear Programming...  
20. Use of GRG solver:    • 20. Solving a non-linear problem using the...  
21. Job sequencing model using Evolutionary solver:    • 21. A Job Sequencing problem using the Evo...  
22. Travelling Salesman Problem using NLP:    • 22. Travelling Salesman Problem (TSP) usin...  


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.