Variable neighbourhood search algorithms for asymmetric travelling salesman problems

Ittiporn Piriyaniti and Pisut Pongchairerks

International Journal of Operational Research, 2013, vol. 18, issue 2, 157-170

Abstract: The aim of the research is to find the best neighbourhood structures for the shaking step and the local search step in the variable neighbourhood search algorithm (VNS) when applied to the asymmetric travelling salesman problem (ATSP). Many variants of the VNS algorithm are proposed based on their neighbourhood structures. The performances of these VNS algorithms are tested with the benchmark instances of the ATSP, one of the best known logistics problems.

Keywords: asymmetric TSP; travelling salesman problem; ATSP; variable neighbourhood search; VNS; NP-hard; combinatorial problems; neighbourhood structures; logistics. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=56104 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:18:y:2013:i:2:p:157-170

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().