Two-commodity opposite direction network flow formulations for the travelling salesman problem

Konstantin Pavlikov () and Niels Christian Petersen ()
Additional contact information
Konstantin Pavlikov: University of Southern Denmark, Department of Business and Management
Niels Christian Petersen: University of Southern Denmark, Department of Business and Management

Computational Optimization and Applications, 2025, vol. 92, issue 3, No 9, 987-1033

Abstract: Abstract This paper considers the well-known Travelling Salesman Problem (TSP) in its symmetric and asymmetric versions. A distinctive feature of the symmetric version of the problem is the ability to formulate it as an undirected network optimization problem using $$n(n - 1)/2$$ n ( n - 1 ) / 2 binary variables, where n is the number of locations involved in the problem. At the same time, formulating the asymmetric version of the problem generally requires the full set of $$n(n - 1)$$ n ( n - 1 ) binary variables. This paper presents a new approach to formulate the symmetric and asymmetric TSPs based on the flow of two commodities. Unlike traditional approaches formulating the problem with the flow of multiple commodities, the flow of two commodities considered in this paper is organized in opposite directions along a Hamiltonian cycle in the complete graph with n nodes. The proposed two-commodity network flow formulations are strictly stronger than their one-commodity flow counterparts in terms of the quality of their linear programming relaxations. This is a new result in the sense that the existing two-commodity network flow formulations of the TSP provide lower bounds that are no different from those of the corresponding one-commodity flow formulations. Moreover, the opposite direction flow of two commodities allows us to formulate the asymmetric TSP with only $$n(n - 1)/2$$ n ( n - 1 ) / 2 binary variables, just as in the case of symmetric TSP. This result suggests that various classes of valid inequalities based upon the polyhedral structure of the symmetric problem are sufficient for designing branch-and-cut algorithms for the asymmetric problem. Finally, the proposed mathematical programming formulations are compared to the existing approaches analytically and using an extensive computational study.

Keywords: Travelling salesman problem; Combinatorial optimization; Cutting planes (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00660-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:coopap:v:92:y:2025:i:3:d:10.1007_s10589-025-00660-5

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-025-00660-5

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().