Variable neighbourhood search algorithms for asymmetric travelling salesman problems Online publication date: Tue, 29-Jul-2014
by Ittiporn Piriyaniti; Pisut Pongchairerks
International Journal of Operational Research (IJOR), Vol. 18, No. 2, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com