Heuristic approach and its application to solve NP-complete traveling salesman problem
Abstract
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 ...
Get Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
