Deterministic, stochastic and local search algorithms for real-world ATSP instances
by Pisut Pongchairerks; Jutathip Putponpai
International Journal of Logistics Systems and Management (IJLSM), Vol. 24, No. 2, 2016

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.

Online publication date: Tue, 10-May-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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