chapter

Engineering Route Planning Algorithms

Authors:

Daniel Delling,

Dominik Schultes,

Dorothea WagnerAuthors Info & Claims

Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation

June 2009

Pages 117 - 139

https://doi.org/10.1007/978-3-642-02094-0_7

Published: 29 June 2009 Publication History

Abstract

Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra's algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-dependent routing, and flexible objective functions.

References

[1]

Barrett, C., Bisset, K., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering Label-Constrained Shortest-Path Algorithms. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 27-37. Springer, Heidelberg (2008).

[2]

Bast, H., Funke, S., Matijevic, D.: TRANSIT Ultrafast Shortest-Path Queries with Linear-Time Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication).

[3]

Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 46-59. SIAM, Philadelphia (2007).

[4]

Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science 316(5824), 566 (2007).

[5]

Batz, G.V., Geisberger, R., Sanders, P.: Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas. Technical report, ITI Sanders, Faculty of Informatics, Universität Karlsruhe (TH) (2008), arXiv:0804.3947v1 {cs.DS}.

[6]

Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Munro, I., Wagner, D. (eds.) Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 13-26. SIAM, Philadelphia (2008).

[7]

Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. Submitted to the ACM Journal of Experimental Algorithmics (2008) (full paper).

[8]

Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 303-318. Springer, Heidelberg (2008).

Digital Library

[9]

Bauer, R., Delling, D., Wagner, D.: Experimental Study on Speed-Up Techniques for Timetable Information Systems. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007), pp. 209-225. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2007).

[10]

Bingmann, T.: Visualisierung sehr großer Graphen. Student Research Project (2006).

[11]

Cooke, K., Halsey, E.: The Shortest Route Through a Network with Time-Dependent Intermodal Transit Times. Journal of Mathematical Analysis and Applications (14), 493-498 (1966).

[12]

Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1962).

[13]

Dean, B.C.: Continuous-Time Dynamic Shortest Path Algorithms. Master's thesis, Massachusetts Institute of Technology (1999).

[14]

Delling, D.: Time-Dependent SHARC-Routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 332-343. Springer, Heidelberg (2008).

[15]

Delling, D., Holzer, M., Müller, K., Schulz, F., Wagner, D.: High-Performance Multi-Level Routing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication).

[16]

Delling, D., Nannicini, G.: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008). LNCS. Springer, Heidelberg (2008) (to appear).

[17]

Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: Demetrescu, et al. (eds.) {19}.

[18]

Delling, D., Wagner, D.: Landmark-Based Routing in Dynamic Graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 52-65. Springer, Heidelberg (2007).

Digital Library

[19]

Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): 9th DIMACS Implementation Challenge - Shortest Paths (November 2006).

[20]

Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959).

[21]

Disser, Y., Müller-Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 347-361. Springer, Heidelberg (2008).

Digital Library

[22]

Fakcharoenphol, J., Rao, S.: Planar Graphs, Negative Weight Edges, Shortest Paths, and near Linear Time. Journal of Computer and System Sciences 72(5), 868-889 (2006).

[23]

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).

Digital Library

[24]

Goldberg, A.: Personal communication (2008).

[25]

Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156-165 (2005).

Digital Library

[26]

Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006), pp. 129-143. SIAM, Philadelphia (2006).

[27]

Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better Landmarks Within Reach. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 38-51. Springer, Heidelberg (2007).

Digital Library

[28]

Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication).

[29]

Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005), pp. 26-40. SIAM, Philadelphia (2005).

[30]

Gunkel, T., Müller-Hannemann, M., Schnee, M.: Improved Search for Night Train Connections. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007), pp. 243-258. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2007).

[31]

Gutman, R.J.: Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004), pp. 100-111. SIAM, Philadelphia (2004).

[32]

Hart, P.E., Nilsson, N., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4, 100-107 (1968).

[33]

Hilger, M., Köhler, E., Möhring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear).

[34]

Holzer, M.: Engineering Planar-Separator and Shortest-Path Algorithms. Ph.D thesis, Universität Karlsruhe (TH), Fakultät für Informatik (2008).

[35]

Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006). SIAM, Philadelphia (2006).

[36]

Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ACM Journal of Experimental Algorithmics (2008) (to appear).

[37]

Holzer, M., Schulz, F., Wagner, D., Willhalm, T.: Combining Speed-up Techniques for Shortest-Path Computations. ACM Journal of Experimental Algorithmics 10 (2006).

[38]

Holzer, M., Schulz, F., Willhalm, T.: Combining Speed-up Techniques for Shortest-Path Computations. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 269-284. Springer, Heidelberg (2004).

[39]

Ishikawa, K., Ogawa, M., Azuma, M., Ito, T.: Map Navigation Software of the Electro-Multivision of the 91 Toyoto Soarer. In: Proceedings of the Vehicle Navigation and Information Systems Conference (VNIS 1991), pp. 463-473. IEEE Computer Society, Los Alamitos (1991).

[40]

Kaufman, D.E., Smith, R.L.: Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Application. Journal of Intelligent Transportation Systems 1(1), 1-11 (1993).

[41]

Klein, P.N.: Multiple-Source Shortest Paths in Planar Graphs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 146-155 (2005).

[42]

Knopp, S., Sanders, P., Schultes, D., Schulz, F., Wagner, D.: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 36- 45. SIAM, Philadelphia (2007).

[43]

Köhler, E., Möhring, R.H., Schilling, H.: Acceleration of Shortest Path and Constrained Shortest Path Computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 126-138. Springer, Heidelberg (2005).

[44]

Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung, vol. 22, pp. 219-230. IfGI prints (2004).

[45]

Lauther, U.: An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear).

[46]

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).

Digital Library

[47]

Meyer, U.: Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 797-806 (2001).

[48]

Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speed Up Dijkstra's Algorithm. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 189-202. Springer, Heidelberg (2005).

[49]

Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics 11, 2.8 (2006).

[50]

Müller, K.: Berechnung kürzester Pfade unter Beachtung von Abbiegeverboten. Student Research Project (2005).

[51]

Müller, K.: Design and Implementation of an Efficient Hierarchical Speed-up Technique for Computation of Exact Shortest Paths in Graphs. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik (June 2006).

[52]

Muller, L.F., Zachariasen, M.: Fast and Compact Oracles for Approximate Distances in Planar Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 657-668. Springer, Heidelberg (2007).

Digital Library

[53]

Müller-Hannemann, M., Schnee, M.: Finding All Attractive Train Connections by Multi-Criteria Pareto Search. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 246- 263. Springer, Heidelberg (2007).

[54]

Müller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable Information: Models and Algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 67-90. Springer, Heidelberg (2007).

Digital Library

[55]

Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search for Time-Dependent Fast Paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 334-346. Springer, Heidelberg (2008).

Digital Library

[56]

Orda, A., Rom, R.: Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the ACM 37(3), 607-625 (1990).

[57]

Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics 12, Article 2.4 (2007).

[58]

Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568-579. Springer, Heidelberg (2005).

[59]

Sanders, P., Schultes, D.: Engineering Highway Hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 804-816. Springer, Heidelberg (2006).

[60]

Sanders, P., Schultes, D.: Engineering Fast Route Planning Algorithms. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 23-36. Springer, Heidelberg (2007).

Digital Library

[61]

Sanders, P., Schultes, D.: Robust, Almost Constant Time Shortest-Path Queries in Road Networks. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication).

[62]

Sanders, P., Schultes, D., Vetter, C.: Mobile Route Planning. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 732-743. Springer, Heidelberg (2008).

[63]

Schilling, H.: Route Assignment Problems in Large Networks. Ph.D thesis, Technische Universität Berlin (2006).

[64]

Schultes, D.: Route Planning in Road Networks. Ph.D thesis, Universität Karlsruhe (TH), Fakultät für Informatik (February 2008).

[65]

Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66-79. Springer, Heidelberg (2007).

Digital Library

[66]

Schulz, F.: Timetable Information and Shortest Paths. Ph.D thesis, Universität Karlsruhe (TH), Fakultät für Informatik (2005).

[67]

Schulz, F., Wagner, D., Weihe, K.: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 110-123. Springer, Heidelberg (1999).

Digital Library

[68]

Schulz, F., Wagner, D., Weihe, K.: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics 5 (2000).

[69]

Schulz, F., Wagner, D., Zaroliagis, C.: Using Multi-Level Graphs for Timetable Information in Railway Systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 43-59. Springer, Heidelberg (2002).

Digital Library

[70]

Thorup, M.: Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 242-251. IEEE Computer Society Press, Los Alamitos (2001).

[71]

Thorup, M.: Integer Priority Queues with Decrease Key in Constant Time and the Single Source Shortest Paths Problem. In: Proceedings of the 35th Annual ACM Symposium on the Theory of Computing (STOC 2003), June 2003, pp. 149-158 (2003).

[72]

U.S. Census Bureau, Washington, DC. UA Census 2000 TIGER/Line Files (2002), http://www.census.gov/geo/www/tiger/tigerua/ua_tgr2k.html

[73]

Volker, L.: Route planning in road networks with turn costs. Studienarbeit, Universität Karlsruhe, Institut für theoretische Informatik (2008).

[74]

Wagner, D., Willhalm, T.: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 776-787. Springer, Heidelberg (2003).

[75]

Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric Containers for Efficient Shortest-Path Computation. ACM Journal of Experimental Algorithmics 10, 1.3 (2005).

[76]

Willhalm, T.: Engineering Shortest Paths and Layout Algorithms for Large Graphs. Ph.D thesis, Universität Karlsruhe (TH), Fakultät für Informatik (2005).

Cited By

Sadri HSrinivasan VThomo A(2024)Efficient Computation of K-Edge Connected Components: An Empirical AnalysisModelling and Mining Networks10.1007/978-3-031-59205-8_6(80-96)Online publication date: 3-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-59205-8_6
Yamamoto DHiura YKim Y(2023)k-Fewest Turn and Shortest Path Algorithm based on Stroke GraphProceedings of the 16th ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/3615895.3628170(32-41)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3615895.3628170
Lin FHsieh H(2023)Exploiting Network Structure in Multi-criteria Distributed and Competitive Stationary-resource SearchingACM Transactions on Spatial Algorithms and Systems10.1145/35699379:4(1-33)Online publication date: 31-Dec-2023
https://dl.acm.org/doi/10.1145/3569937
Show More Cited By

Recommendations

Optimal Route Reflection Topology Design
LANC '18: Proceedings of the 10th Latin America Networking Conference

Autonomous Systems (ASes) exchange routing information about networks they can reach in the Internet, and the most widely extended way to connect them is by means of Border Gateway Protocol (BGP) sessions. ASes set up external BGP (eBGP) sessions ...
Designing optimal iBGP route-reflection topologies
NETWORKING'08: Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet

The Border Gateway Protocol (BGP) is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In large ASs, relying on a full-mesh of iBGP sessions between routers is not ...
On route selection for interdomain traffic engineering

In this article we investigate a model of route selection for interdomain traffic engineering where routing to multiple destinations can be coordinated. We identify potential routing instability and inefficiency problems, and derive a set of practical ...

Comments

Information & Contributors

Information

Published In

cover image Guide books

Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation

June 2009

400 pages

ISBN:9783642020933

Editors:
Jürgen Lerner
Department of Computer & Information Science, University of Konstanz, Konstanz, Germany 78457
,
Dorothea Wagner
Institute of Theoretical Informatics, Technical University of Karlsruhe, Karlsruhe, Germany 76128
,
Katharina A. Zweig
Department of Biological Physics, Eötvös Lorand University, Budapest, Hungary 1117

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 29 June 2009

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

99
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sadri HSrinivasan VThomo A(2024)Efficient Computation of K-Edge Connected Components: An Empirical AnalysisModelling and Mining Networks10.1007/978-3-031-59205-8_6(80-96)Online publication date: 3-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-59205-8_6
Yamamoto DHiura YKim Y(2023)k-Fewest Turn and Shortest Path Algorithm based on Stroke GraphProceedings of the 16th ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/3615895.3628170(32-41)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3615895.3628170
Lin FHsieh H(2023)Exploiting Network Structure in Multi-criteria Distributed and Competitive Stationary-resource SearchingACM Transactions on Spatial Algorithms and Systems10.1145/35699379:4(1-33)Online publication date: 31-Dec-2023
https://dl.acm.org/doi/10.1145/3569937
Shepherd DKnight J(2023)Low-Resolution Sensing for Sim-to-Real Complex Terrain RobotsTowards Autonomous Robotic Systems10.1007/978-3-031-43360-3_16(190-201)Online publication date: 13-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43360-3_16
Ma XGong RTan YMei HLi C(2022)Path Planning of Mobile Robot Based on Improved PRM Based on Cubic SplineWireless Communications & Mobile Computing10.1155/2022/16326982022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/1632698
Lin FHsieh H(2022)Traveling Transporter Problem: Arranging a New Circular Route in a Public Transportation System Based on Heterogeneous Non-Monotonic Urban DataACM Transactions on Intelligent Systems and Technology10.1145/351003413:3(1-25)Online publication date: 3-Mar-2022
https://dl.acm.org/doi/10.1145/3510034
Hsieh HLin FChen NYang T(2022)A Decision Framework to Recommend Cruising Locations for Taxi Drivers under the Constraint of Booking InformationACM Transactions on Management Information Systems10.1145/349068713:3(1-30)Online publication date: 11-Feb-2022
https://dl.acm.org/doi/10.1145/3490687
Mandal KHalder SRoy PPaul MBit SBanerjee R(2022)An Online Mobility Management System to Automatically Avoid Road Blockage and COVID-19 HotspotsNew Generation Computing10.1007/s00354-022-00180-440:4(1203-1239)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s00354-022-00180-4
Choudhury SSolovey KKochenderfer MPavone M(2021)Efficient Large-Scale Multi-Drone Delivery using Transit NetworksJournal of Artificial Intelligence Research10.1613/jair.1.1245070(757-788)Online publication date: 1-May-2021
https://dl.acm.org/doi/10.1613/jair.1.12450
Lin FHsieh H(2021)ConntransProceedings of the 29th International Conference on Advances in Geographic Information Systems10.1145/3474717.3483926(163-174)Online publication date: 2-Nov-2021
https://dl.acm.org/doi/10.1145/3474717.3483926
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Chapter

Media

Figures

Other

Tables

View Table of Contents