Hybrid population-based variable neighbourhood search and simulated annealing algorithms for asymmetric travelling salesman problems Online publication date: Fri, 27-Dec-2013
by Ittiporn Piriyaniti; Pisal Yenradee
International Journal of Industrial and Systems Engineering (IJISE), Vol. 15, No. 4, 2013
Abstract: The asymmetric travelling salesman problem (ATSP) is a generalised travelling salesman problem that the distances between a pair of cities may not be equal in opposite directions. This problem has a close relation with real-world problems in logistics and transportation. This paper aims to enhance performances of variable neighbourhood search (VNS) algorithm by introducing population-based approach (EVNS) and simulated annealing (SA) technique to the VNS algorithm. Benchmark ATSP instances available in TSP library (TSPLIB) are used to test the performances of the proposed algorithms. Experimental results show that the solution quality can be improved significantly when the population-based approach is applied and the worse solution is accepted with some probabilities which is a mechanism of SA technique. The proposed EVNS-SA algorithm has very good performances among the algorithms for solving ATSP available in literatures.
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 Industrial and Systems Engineering (IJISE):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook