A non-assignment problem-based formulation for the asymmetric travelling salesman problem and its variation

Nahid Jafari

International Journal of Operational Research, 2019, vol. 35, issue 4, 575-585

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.

Keywords: asymmetric travelling salesman problem; ATSP; multiple travelling salesman problem; m-TSP; selective travelling salesman problem. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101461 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:35:y:2019:i:4:p:575-585

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().