Abstract
In this paper a branch-and-bound algorithm for the Symmetric Travelling Salesman Problem (STSP) is presented. The algorithm is based on the 1-tree Lagrangian relaxation. A new branching strategy is suggested in which the algorithm branches on the 1-tree edge belonging to the vertex with maximum degree in the 1-tree and having the maximum tolerance. This strategy is compared with branching on the shortest edge and the so-called strong branching, which is the branching on the edge with maximum tolerance also applied by Held and Karp (1971). The computational experiments show that proposed branching strategy provides better results on TSPlib benchmark instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Benchimol, P., Régin, J.C., Rousseau, L.M., Rueher, M., van Hoeve, W.J.: Improving the Held and Karp approach with constraint programming. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 40–44. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13520-0_6
Hansen, K.H., Krarup, J.: Improvements of the Held-Karp algorithm for the symmetric traveling-salesman problem. Math. Program. 7(1), 87–96 (1974)
Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138–1162 (1970)
Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6–25 (1971)
Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)
Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231–247 (1992)
Matai, R., Singh, S., Mittal, M.L.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Traveling Salesman Problem, Theory and Applications. InTech (2010)
Reinelt, G.: TSPLIB-A traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)
Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Lecture Notes in Computer Science. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48661-5
Volgenant, T., Jonker, R.: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur. J. Oper. Res. 9(1), 83–89 (1982)
Acknowledgments
The research was funded by Russian Science Foundation (RSF project No. 17-71-10107).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Nikolaev, A., Batsyn, M. (2018). Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem. In: Iliopoulos, C., Leong, H., Sung, WK. (eds) Combinatorial Algorithms. IWOCA 2018. Lecture Notes in Computer Science(), vol 10979. Springer, Cham. https://doi.org/10.1007/978-3-319-94667-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-94667-2_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94666-5
Online ISBN: 978-3-319-94667-2
eBook Packages: Computer ScienceComputer Science (R0)