Abstract
The Generalized Traveling Salesman Path Problem (GTSPP) involves finding the shortest path from a location s to a location t that passes through at least one location from each of a set of generalized location categories (e.g., gas stations, grocery stores). This NP-hard problem type has many applications in transportation and location-based services. We present two exact algorithms for solving GTSPP instances, which rely on a unique product-graph search formulation. Our exact algorithms are exponential only in the number of categories (not in the total number of locations) and do not require the explicit construction of a cost matrix between locations, thus allowing us to efficiently solve many real-world problems to optimality. Experimental analysis on the road network of North America demonstrates that we can optimally solve large-scale, practical GTSPP instances typically in a matter of seconds, depending on the overall number and sizes of the categories.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Behzad, A., Modarres, M.: A new efficient transformation of generalized traveling salesman problem into traveling salesman problem. In: Proceedings of the 15th International Conference of Systems Engineering, ICSE (2002)
Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.F.: Phast: Hardware-accelerated shortest path trees. In: IPDPS, pp. 921–931 (2011)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Dimitrijevic, V., Saric, Z.: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Inf. Sci. 102(1-4), 105–110 (1997)
Fischetti, M., Gonzalez, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45(3), 378–394 (1997)
Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008)
Henry-Labordere, A.L.: The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem. RIRO B-2, 43–49 (1969)
Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. The Journal of the Operational Research Society 47(12), 1461–1467 (1996)
Laporte, G., Mercure, H., Nobert, Y.: Generalized travelling salesman problem through n sets of nodes: The asymmetrical case. Discrete Applied Mathematics 18(2), 185–197 (1987)
Laporte, G., Nobert, Y.: Generalized travelling salesman problem through n sets of nodes: An integer programming approach. INFOR 21(1), 61–75 (1983)
Lien, Y.-N., Ma, Y.W.E., Wah, B.W.: Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem. Inf. Sci. 74(1-2), 177–189 (1993)
Maue, J., Sanders, P., Matijevic, D.: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. In: Àlvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 316–327. Springer, Heidelberg (2006)
Noon, C.E., Bean, J.C.: A lagrangian based approach for the asymmetric generalized traveling salesman problem. Operations Research 39(4), 623–632 (1991)
Saksena, J.P.: Mathematical model of scheduling clients through welfare agencies. CORS Journal 8, 185–200 (1970)
Srivastava, S.S., Kumar, S., Garg, R.C., Sen, P.: Generalized travelling salesman problem through n sets of nodes. CORS Journal 7, 97–101 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rice, M.N., Tsotras, V.J. (2012). Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems. In: Klasing, R. (eds) Experimental Algorithms. SEA 2012. Lecture Notes in Computer Science, vol 7276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30850-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-30850-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30849-9
Online ISBN: 978-3-642-30850-5
eBook Packages: Computer ScienceComputer Science (R0)