Hii….Today our topic is traveling salesman problem. In this video we are going to solve an example related to TSP in operation Research.
The Traveling Salesman Problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pair wise distances, the task is to find a shortest possible tour that visits each city exactly once.
Two conditions of TSP is a salesman visit each city once. No city can be visit twice and visit to city i to i is not permitted.
THANK YOU FOR WATCHING
Please like share comments and subscribe
To watch more tutorial, press the below link
Maximization in assignment problem
Unbalanced Assignment Problem
Assignment problem for multiple solution
Assignment problem part 1
degeneracy in Transportation Problem
modi method transportation problem using north west corner rule 2
Modi Method Transportation Problem using Vam 1
unbalanced transportation problem vam method,
vogel’s approximation method transportation problem
least cost method transpotation problem, unbalanced table
least cost method transportation problem, balanced table
unbalanced transportation problem using north west corner method
north-west corner method transportation problem, balanced table
transportation problem in hindi, conversion of unbalanced table into balanced table
for watch more tutorials pls visit the playlist in the channel
playlist of operation research
Playlist of Transportation Problem
playlist of probability for engineering mathematics
playlist of algorithm design and analysis
Travelling salesman problem, travelling salesman problem in hindi, travelling salesman problem in operation Research, travelling salesman problem example, travelling salesman problem solution, travelling salesman problem example Solution .