Abstract
In this paper we summarize some of the results of the author’s Ph.D.-thesis. We consider an extension of the traveling salesman problem (TSP). Instead of each path of two nodes, an arc, the costs depend on each three nodes that are traversed in succession. As such a path of three nodes, a 2-arc, is present in a tour if the two corresponding arcs are contained in that tour, we speak of a quadratic traveling salesman problem (QTSP). This problem is motivated by an application in biology, special cases are the TSP with reload costs as well as the angular-metric TSP. Linearizing the quadratic objective function, we derive a linear integer programming formulation and present a polyhedral study of the associated polytope. This includes the dimension as well as three groups of facet-defining inequalities. Some are related to the Boolean quadric polytope and some forbid conflicting configurations. Furthermore, we describe approaches to strengthen valid inequalities of TSP in order to get stronger inequalities for QTSP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., Schieber, B.: The angular-metric traveling salesman problem. SIAM J. Comput. 29, 697–711 (1999)
Amaldi, E., Galbiati, G., Maffioli, F.: On minimum reload cost paths, tours, and flows. Networks 57, 254–260 (2011)
Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)
Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393–410 (1954)
Fischer, A.: A polyhedral study of quadratic traveling salesman problems. Ph.D. thesis, Chemnitz University of Technology, Germany (2013)
Fischer, A.: An analysis of the asymmetric quadratic traveling salesman polytope. SIAM J. Discrete Math. 28(1), 240–276 (2014)
Fischer, A., Fischer, F.: An extended approach for lifting clique tree inequalities. J. Comb. Optim. 30(3), 489–519 (2015). doi:10.1007/s10878-013-9647-3
Fischer, A., Helmberg, C.: The symmetric quadratic traveling salesman problem. Math. Prog. 142(1–2), 205–254 (2013)
Fischetti, M.: Clique tree inequalities define facets of the asymmetric traveling salesman polytope. Discrete Appl. Math. 56(1), 9–18 (1995)
Grötschel, M., Padberg, M.W.: Lineare Charakterisierungen von Travelling Salesman Problemen. Zeitschrift für Operations Research, Series A 21(1), 33–64 (1977)
Grötschel, M., Pulleyblank, W.R.: Clique tree inequalities and the symmetric travelling salesman problem. Math. Oper. Res. 11(4), 537–569 (1986)
Jäger, G., Molitor, P.: Algorithms and experimental study for the traveling salesman problem of second order. LNCS 5165, 211–224 (2008)
Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B. (eds.): The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)
Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Prog. 45, 139–172 (1989)
Acknowledgments
This work was partially supported by the European Union and the Free State of Saxony funding the cluster eniPROD at Chemnitz University of Technology.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Fischer, A. (2016). A Polyhedral Study of the Quadratic Traveling Salesman Problem. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-28697-6_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28695-2
Online ISBN: 978-3-319-28697-6
eBook Packages: Business and ManagementBusiness and Management (R0)