A non-assignment problem-based formulation for the asymmetric travelling salesman problem and its variation
by Nahid Jafari
International Journal of Operational Research (IJOR), Vol. 35, No. 4, 2019

Abstract: In this paper, an exact formulation for the asymmetric travelling salesman problem (ATSP) is presented by approaching it as a single commodity flow problem. This approach is different from existing exact formulations in the literature which are based on the assignment problem (AP), thus, it resolves issues that the AP-based formulations pose for solving certain real world instances by standard integer programming methods such as branch and bound. Moreover, in our computational experiments, half of the total computational time is expended to find the first feasible solution, then it is converged quickly to optimality. In contrast, the AP-based models rapidly computed an initial feasible solution but showed slow convergence to the optimum. Moreover, it is extendable to other variations of the travelling salesman problem (TSP) such as the multiple TSP and the selective TSP.

Online publication date: Sun, 11-Aug-2019

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 Operational Research (IJOR):
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