June 2024
Intermediate to advanced
189 pages
6h 33m
English
Since long ago, a suitable solution to the traveling salesman problem in different scenarios has always been a popular problem for research. Various heuristic and evolutionary approaches have been designed for it. We developed a simple heuristic approach to identify n optimal routes from nC2 routes abiding a degree constraint, where only those routes are selected in the set of feasible routes (Hx), which have a degree less than or equal to 2. We implemented the present tactic on the milk delivery problem, that is, to determine the best route for a milk van supplying milk to (i) 10 houses and ...
Read now
Unlock full access