Optimization using Excel – 22.Travelling Salesman Problem using NLP

Optimization using Excel
Lecture 22
Soumitra Chakraborty
Play Video

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.