Comparing greedy constructive heuristic subtour elimination methods for the traveling salesman problem

Comparing greedy constructive heuristic subtour elimination methods for the traveling salesman problem

Purpose – This paper aims to define the class of fragment constructive heuristics used to compute feasible solutions for the traveling salesman problem (TSP) into edge-greedy and vertex-greedy subclasses. As these subclasses of heuristics can create subtours, two known methodologies for subtour elim...

Full description

Bibliographic Details
Main Authors: Petar Jackovich, Bruce Cox, Raymond R. Hill
Format: Article
Language:English
Published: Emerald Publishing 2020-11-01
Series:Journal of Defense Analytics and Logistics
Subjects:
traveling salesman problem
constructive heuristic
edge greedy
multiple fragment heuristic
subtour elimination
vertex greedy
heuristic
fragment constructive heuristic
exhaustive loop
greedy tracker
ordered greedy
Online Access:https://www.emerald.com/insight/content/doi/10.1108/JDAL-09-2020-0018/full/pdf?title=comparing-greedy-constructive-heuristic-subtour-elimination-methods-for-the-traveling-salesman-problem

Internet

https://www.emerald.com/insight/content/doi/10.1108/JDAL-09-2020-0018/full/pdf?title=comparing-greedy-constructive-heuristic-subtour-elimination-methods-for-the-traveling-salesman-problem

Similar Items