Abstract
Carpooling route planning becomes an important problem with the growth of low-carbon traffic systems. When each passenger has several potential locations to get on and off the car, the problem will be more challenging. In the paper, we discussed a simplified carpooling route planning problem, namely the Shortest Path Tour Problem (SPTP), whose aim is to find a single-origin single-destination shortest path through an ordered sequence of disjoint node subsets. We propose Stage Dijkstra and Global Dijkstra algorithms to find the optimal shortest path, with the time complexity of \(O(l(n+m)\log n)\) and \(O(l(n+m)\log (ln))\) respectively, where l represents the number of node subsets. To the best of our knowledge, \(O(l(n+m)\log n)\) is the best time complexity of the exact algorithms for SPTP. Experiments conducted on large-scale road networks and synthetic datasets demonstrate the effectiveness and efficiency of our proposed algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zhang, W.A., Yuan, C., Zhang, Y., Ye, J.: Taxi or hitchhiking: predicting passenger’s preferred service on ride sharing platforms. In: ACM SIGIR Conference on Research & Development in Information Retrieval (SIGIR), pp. 1041–1044 (2018)
Zeng, Y., Tong, Y., Song, Y., Chen,L.: The simpler the better: An indexing approach for shared-route planning queries. In: Proceedings of the VLDB Endowment, vol. 13, pp. 3517–3530 (2020)
Dantzig, G.B., Ray Fulkerson, D., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2(4), 393–410 (1954)
Bajajm, C.P.: Some constrained shortest-route problems. In: Unternehmensforschung, vol. 15(1), pp. 287–301 (1971)
Festa, P.: Complexity analysis and optimization of the shortest path tour problem. Optimiz. Lett. 6(1), 163–175 (2012)
Osanlou, K., Bursuc, A., Guettier, C., Cazenave, T., Jacopin, E.: Optimal solving of constrained path-planning problems with graph convolutional networks and optimized tree search. In: International Conference on Intelligent Robots and Systems (IROS), pp. 3519–3525 (2019)
Festa, P., Guerriero, F., Laganà, D., Musmanno, R.: Solving the shortest path tour problem. Euro. J. Oper. Res. 230(3), 464–474 (2013)
Bhat, S., Rouskas, G.N.: Service-concatenation routing with applications to network functions virtualization. In: International Conference on Computer Communication and Networks (ICCCN), pp. 1–9 (2017)
Prokopiak, R.: Using the Viterbi decoding trellis graph approach to find the most effective investment path. In: Smart Cities & Information and Communication Technology (CTTE-FITCE), pp. 1–6 (2019)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory IT-13, 260–269 (1967)
Acknowledgements
This work was supported by the National Key R &D Program of China [2020YFB1707900], the National Natural Science Foundation of China [62272302, 62172276], Shanghai Municipal Science and Technology Major Project [2021SHZDZX0102], and DiDi GAIA Research Collaboration Plan [202204].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Gao, Y. et al. (2024). Algorithms for Shortest Path Tour Problem in Large-Scale Road Network. In: Wu, W., Tong, G. (eds) Computing and Combinatorics. COCOON 2023. Lecture Notes in Computer Science, vol 14423. Springer, Cham. https://doi.org/10.1007/978-3-031-49193-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-031-49193-1_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49192-4
Online ISBN: 978-3-031-49193-1
eBook Packages: Computer ScienceComputer Science (R0)