Fast paths in large-scale dynamic road networks
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-008-9172-y
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
- Ahuja, Ravindra & Orlin, James & Pallottino, Stefano & Scutella, Maria, 2003. "Dynamic Shortest Paths Minimizing Travel Times And Costs," Working papers 4390-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Daiane Maria Genaro Chiroli & Sérgio Fernando Mayerle & João Neiva Figueiredo, 2022. "Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints," Journal of Heuristics, Springer, vol. 28(1), pages 23-59, February.
- Leo Liberti, 2015. "Optimization and sustainable development," Computational Management Science, Springer, vol. 12(3), pages 371-395, July.
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.- Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
- Ziliaskopoulos, Athanasios K. & Mandanas, Fotios D. & Mahmassani, Hani S., 2009. "An extension of labeling techniques for finding shortest path trees," European Journal of Operational Research, Elsevier, vol. 198(1), pages 63-72, October.
- Bozhenyuk Alexander & Gerasimenko Evgeniya, 2013. "Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks," Information Technology and Management Science, Sciendo, vol. 16(1), pages 53-59, December.
- Lunce Fu & Maged Dessouky, 2018. "Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem," Journal of Scheduling, Springer, vol. 21(3), pages 367-386, June.
- Antonio Polimeni & Antonino Vitetta, 2013. "Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 805-818, March.
- Hu, Xiao-Bing & Zhang, Ming-Kong & Zhang, Qi & Liao, Jian-Qin, 2017. "Co-Evolutionary path optimization by Ripple-Spreading algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 411-432.
More about this item
Keywords
Shortest paths; Dynamic arc costs; Real-time data; Road networks;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:coopap:v:45:y:2010:i:1:p:143-158. 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.