Abstract
This paper addresses the Forward Shortest Path Tour Problem (FSPTP). Given a weighted directed graph, whose nodes are partitioned into clusters, the FSPTP consists of finding a shortest path from a source node to a destination node and which crosses all the clusters in a fixed order. We propose a polynomial time algorithm to solve the problem and show that our algorithm can be easily adapted to solve the shortest path tour problem, a slightly different variant of the FSPTP. Moreover, we carried out some preliminary computational tests to verify how the performance of the algorithm is affected by parameters of the instances.
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
References
Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. I, 3rd edn. Athena Scientific (2005)
Artmeier, A., Haselmayr, J., Leucker, M., Sachenbacher, M.: The shortest path problem revisited: optimal routing for electric vehicles. In: Proceedings of the KI 2010, Advances in Artificial Intelligence, 33rd Annual German Conference on AI, Karlsruhe, Germany, pp. 309–316, 21–24 Sept 2010. Springer, Berlin, Heidelberg
Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Computers & OR 78, 163–171 (2017)
Carrabs, F., Cerulli, R., Cerrone, C., D’Ambrosio, C.: Improved upper and lower bounds for the close enough traveling salesman problem, Green, Pervasive, and Cloud Computing. In: Proceedings of the 12th International Conference, GPC 2017, Cetara, Italy, pp. 165–177, 11–14 May 2017. Springer International Publishing (2017)
Festa, P.: Complexity analysis and optimization of the shortest path tour problem. Optim. Lett. 6(1), 163–175 (2012)
Festa, P., Guerriero, F., Laganà, D., Musmanno, R.: Solving the shortest path tour problem. Eur. J. Oper. Res. 230, 464–474 (2013)
Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Bertsekas, D.P.: An auction algorithm for shortest paths. SIAM J. Optim. 1, 425–447 (1991)
Bertsekas, D.P., Pallottino, S., Scutellà, M.G.: Polynomial auction algorithms for shortest paths. Comput. Optim. Appl. 4, 99–125 (1995)
Lum, O., Cerrone, C., Golden, B., Wasil, E.: Partitioning a street network into compact, balanced, and visually appealing routes. Networks (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Carrabs, F., Cerulli, R., Festa, P., Laureana, F. (2017). On the Forward Shortest Path Tour Problem. In: Sforza, A., Sterle, C. (eds) Optimization and Decision Science: Methodologies and Applications. ODS 2017. Springer Proceedings in Mathematics & Statistics, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-67308-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-319-67308-0_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67307-3
Online ISBN: 978-3-319-67308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)