Combinatorial optimization
Exponential neighbourhood local search for the traveling salesman problem
Computers and Operations Research - Special issue on the traveling salesman problem
Computers and Operations Research - Special issue on the traveling salesman problem
Large Exponential Neighbourhoods for the Traveling Salesman Problem
Large Exponential Neighbourhoods for the Traveling Salesman Problem
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
| Hi-index | 0.00 |
Non-Euclidean TSP construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive efforts devoted to studying Euclidean TSP construction heuristics. Motivation for remedying this gap in the study of construction approaches is increased by the fact that such methods are a great deal faster than other TSP heuristics, which can be important for real time problems requiring continuously updated response. The purpose of this paper is to describe two new construction heuristics for the asymmetric TSP and a third heuristic based on combining the other two. Extensive computational experiments are performed for several different families of TSP instances, disclosing that our combined heuristic clearly outperforms well-known TSP construction methods and proves significantly more robust in obtaining high quality solutions over a wide range of problems. We also provide a short overview of recent results in domination analysis of TSP construction heuristics.