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 #TravellingSalesmanProblem #evolutionary #msexcel #nonlinear

Complete module:

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.

[ThePashupatinverma]

I would really appreciate if you right the formula explicitly at some place in some larger font.

[cy.ng]

Hey there, this is a great tutorial. May I ask if I want to to limit the solver to just solve 3 cities instead of 4, how can I do that?