Abstract
The balanced traveling salesman problem (BTSP) is a variant of the traveling salesman problem, in which one seeks a tour that minimizes the difference between the largest and smallest edge costs in the tour. The BTSP, which is obviously NP-hard, was first investigated by Larusic and Punnen (Comput Oper Res 38(5):868–875, 2011). They proposed several heuristics based on the double-threshold framework, which converge to good-quality solutions though not always optimal. In this paper, we design a special-purpose branch-and-cut algorithm for exactly solving the BTSP. In contrast with the classical TSP, due to the BTSP’s objective function, the efficiency of algorithms for solving the BTSP depends heavily on determining correctly the largest and smallest edge costs in the tour. In the proposed branch-and-cut algorithm, we develop several mechanisms based on local cutting planes, edge elimination, and variable fixing to locate those edge costs more precisely. Other critical ingredients in our method are algorithms for initializing lower and upper bounds on the optimal value of the BTSP, which serve as warm starts for the branch-and-cut algorithm. Experiments on the same testbed of TSPLIB instances show that our algorithm can solve 63 out of 65 instances to proven optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Enquiries about data availability should be directed to the authors.
Notes
References
Arkin EM, Chiang Y-J, Mitchell JSB, Skiena SS, Yang T-C (1999) On the maximum scatter traveling salesperson problem. SIAM J Comput 29(2):515–544
Camerini PM, Maffioli F, Martello S, Toth P (1986) Most and least uniform spanning trees. Discrete Appl Math 15(2–3):181–197
Cappanera P, Scutella MG (2005) Balanced paths in acyclic networks: tractable cases and related approaches. Netw Int J 45(2):104–111
Galil Z, Schieber B (1988) On finding most uniform spanning trees. Discrete Appl Math 20:173–175
Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551–570
Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using networks. In: Varoquaux G, Vaught T, Millman J (eds) Proceedings of the 7th python in science conference, Pasadena, CA USA, pp 11 – 15
Helsgaun K (2009) General k-opt submoves for the Lin–Kernighan TSP heuristic. Math Program Comput 1(2):119–163
Katoh N, Iwano K (1994) Efficient algorithms for minimum range cut problems. Networks 24:395–407
Larusic J, Punnen AP (2011) The balanced traveling salesman problem. Comput Oper Res 38(5):868–875
LaRusic J, Punnen AP (2014) The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis. Comput Oper Res 43:20–35
Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245–2269
Martello S, Pulleyblank WR, Toth P, De Werra D (1984) Balanced optimization problems. Oper Res Lett 3(5):275–278
Plante RD, Lowe TJ, Chandrasekaran R (1987) The product matrix traveling salesman problem: an application and solution heuristic. Oper Res 35(5):772–783
Reinelt G (1991) TSPLIB—a traveling salesman problem library. ORSA J Comput 3(4):376–384
Scutellà MG (1998) A strongly polynomial algorithm for the uniform balanced network flow problem. Discrete Appl Math 81(1–3):123–131
Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146–160
Turner L (2011) Variants of shortest path problems. Algorithmic Oper Res 6:91–104
Vairaktarakis GL (2003) On Gilmore–Gomory’s open question for the bottleneck tsp. Oper Res Lett 31(6):483–491
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors have not disclosed any competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Vo, T.Q.T., Baiou, M. & Nguyen, V.H. A branch-and-cut algorithm for the balanced traveling salesman problem. J Comb Optim 47, 4 (2024). https://doi.org/10.1007/s10878-023-01097-4
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-023-01097-4