Sublinear search spaces for shortest path planning in grid and road networks
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-021-00777-3
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Robert Geisberger & Peter Sanders & Dominik Schultes & Christian Vetter, 2012. "Exact Routing in Large Road Networks Using Contraction Hierarchies," Transportation Science, INFORMS, vol. 46(3), pages 388-404, August.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
- , Marcin Wozniak & Radzimski, Adam & Wajchman-Świtalska, Sandra, 2024. "Is More Always Better? Evaluating Accessibility to Parks and Forests in 33 European Cities Using Sustainable Modes of Transportation," OSF Preprints hcwgp, Center for Open Science.
- Zhan, Xingbin & Szeto, W.Y. & Shui, C.S. & Chen, Xiqun (Michael), 2021. "A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
- Young Woong Park, 2021. "Optimization for L 1 -Norm Error Fitting via Data Aggregation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 120-142, January.
- Mepparambath, Rakhi Manohar & Soh, Yong Sheng & Jayaraman, Vasundhara & Tan, Hong En & Ramli, Muhamad Azfar, 2023. "A novel modelling approach of integrated taxi and transit mode and route choice using city-scale emerging mobility data," Transportation Research Part A: Policy and Practice, Elsevier, vol. 170(C).
- Stefan Kuhlemann & Kevin Tierney, 2020. "A genetic algorithm for finding realistic sea routes considering the weather," Journal of Heuristics, Springer, vol. 26(6), pages 801-825, December.
- Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
- Yaqiong Liu & Hock Soon Seah & Guochu Shou, 2016. "Cost-Optimal Time-dEpendent Routing with Time and Speed Constraints in Directed Acyclic Road Networks," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 15(06), pages 1413-1450, November.
- Moritz Baum & Julian Dibbelt & Andreas Gemsa & Dorothea Wagner & Tobias Zündorf, 2019. "Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles," Transportation Science, INFORMS, vol. 53(6), pages 1627-1655, November.
More about this item
Keywords
Shortest path planning; Bounded growth model; Road network dimensions;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:42:y:2021:i:2:d:10.1007_s10878-021-00777-3. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.