Title: Deterministic, stochastic and local search algorithms for real-world ATSP instances

Authors: Pisut Pongchairerks; Jutathip Putponpai

Addresses: Faculty of Engineering, Thai-Nichi Institute of Technology, Suan Luang, Bangkok 10250, Thailand ' Faculty of Engineering, Thai-Nichi Institute of Technology, Suan Luang, Bangkok 10250, Thailand

Abstract: This paper considers six asymmetric travelling salesman problem instances generated from the real data. To solve these instances, this paper develops multiple deterministic, stochastic and local search algorithms which construct their solutions based on the geographical information, such as the adjacent cities, the border cities, the boundary of the country, and the directions on map. The neighbourhood structures of the proposed local search algorithms are very efficient and contain only small numbers of solutions. All proposed algorithms are simple and very fast.

Keywords: asymmetric TSP; travelling salesman problem; ATSP; neighbourhood structure; deterministic algorithms; stochastic algorithms; local search algorithms; geographic information; adjacent cities; border cities; country borders; map directions.

DOI: 10.1504/IJLSM.2016.076474

International Journal of Logistics Systems and Management, 2016 Vol.24 No.2, pp.265 - 282

Received: 24 Mar 2015
Accepted: 18 Apr 2015
Published online: 10 May 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article