Travelling Salesman Problem as Assignment Problem in Hindi (Lecture.38)

This video explains solving steps for Travelling Salesman Problem as assignment problem.
--–----------------------------------
Note----
If the distance (or time or cost) between every pair of cities is independent of the direction of travel, the problem is said to be "symmetrical" .
If for one or more pairs of cities the distance (or time or cost) varies with direction, the problem is called "asymmetrical" .
For example, it takes more time to go up a hill between two stations than come down the hill between them; similarly, a flight may take more time against the wind direction compared to that in the direction of wind.
-----------------------------
Related videos....
1. Assignment Problem (Minimization)
   • Assignment problem | Hungarian method...  

2. Assignment Problem (Maximization)
   • Maximization Assignment Problem in Hi...  
.......................................................
Operations Research(OR) |
Computer Oriented Optimization Techniques (COOT)|
For MCA, MBA, B.tech, B.E.,B.Sc.
CBSE UGC NET & Other Exams

#travelingsalesmanproblem #travellingsalesmanproblem #assignmentproblem