- #1
WMDhamnekar
MHB
- 378
- 28
It is difficult to understand the solution provided in the video to the travelling salesman problem having Hamiltonian circuits with added length constraint.
The travelling salesman problem has been solved in the below given video, but I didn't understand lower bound computed for the following paths.
I also didn't understand the why Path 8,9 10 and 11 have been called 'first tour', 'better tour', 'inferior tour' and 'optimal tour' respectively.
What are the meanings of l=24 for Path 8, l=19 for Path 9, l= 24 for Path 10 and l=16 for Path 11?
Path 4: a,e lb=19,
Path 5:a,b,c lb=16,
Path 6:a,b,d lb=16,
Path 7: a,b,e lb=19,
Path 8:a,b,c,d (e,a) l=24 first tour ,
Path 9: a,b,c,e(d,a) l= 19 (better tour),
Path 10: a,b,d,c (e,a) l=24 (inferior tour),
Path 11: a,b,d,e(c,a) l=16 optimal tour.
Watch the vide here →
Would any member explain me the travelling salesman problem solved in this video?
Can we solve this problem by another method where conditions of the travelling salesman problem is not satisfied?
The condition is the salesman has to visit each city in the tour only once and return to the start city.
The travelling salesman problem has been solved in the below given video, but I didn't understand lower bound computed for the following paths.
I also didn't understand the why Path 8,9 10 and 11 have been called 'first tour', 'better tour', 'inferior tour' and 'optimal tour' respectively.
What are the meanings of l=24 for Path 8, l=19 for Path 9, l= 24 for Path 10 and l=16 for Path 11?
Path 4: a,e lb=19,
Path 5:a,b,c lb=16,
Path 6:a,b,d lb=16,
Path 7: a,b,e lb=19,
Path 8:a,b,c,d (e,a) l=24 first tour ,
Path 9: a,b,c,e(d,a) l= 19 (better tour),
Path 10: a,b,d,c (e,a) l=24 (inferior tour),
Path 11: a,b,d,e(c,a) l=16 optimal tour.
Watch the vide here →
Would any member explain me the travelling salesman problem solved in this video?
Can we solve this problem by another method where conditions of the travelling salesman problem is not satisfied?
The condition is the salesman has to visit each city in the tour only once and return to the start city.