IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v17y1969i3p395-412.html
   My bibliography  Save this item

An Appraisal of Some Shortest-Path Algorithms

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Fu, Liping, 2001. "An adaptive routing algorithm for in-vehicle route guidance systems with real-time information," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 749-765, September.
  2. Wu, Shanhua & Yang, Zhongzhen, 2018. "Locating manufacturing industries by flow-capturing location model – Case of Chinese steel industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 112(C), pages 1-11.
  3. Davies, Cedric & Lingras, Pawan, 2003. "Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks," European Journal of Operational Research, Elsevier, vol. 144(1), pages 27-38, January.
  4. Edward Lam & Pascal Van Hentenryck & Phil Kilby, 2020. "Joint Vehicle and Crew Routing and Scheduling," Transportation Science, INFORMS, vol. 54(2), pages 488-511, March.
  5. Volgenant, A., 2002. "Solving some lexicographic multi-objective combinatorial problems," European Journal of Operational Research, Elsevier, vol. 139(3), pages 578-584, June.
  6. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
  7. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
  8. Castro de Andrade, Rafael, 2016. "New formulations for the elementary shortest-path problem visiting a given set of nodes," European Journal of Operational Research, Elsevier, vol. 254(3), pages 755-768.
  9. Alex A. Kurzhanskiy, 2022. "A Methodology for Estimating Vehicle Route Choice from Sparse Flow Measurements in a Traffic Network," Mathematics, MDPI, vol. 10(3), pages 1-11, February.
  10. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
  11. Suman, Hemant K. & Bolia, Nomesh B., 2019. "Improvement in direct bus services through route planning," Transport Policy, Elsevier, vol. 81(C), pages 263-274.
  12. Daniel Delling & Giacomo Nannicini, 2012. "Core Routing on Dynamic Time-Dependent Road Networks," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 187-201, May.
  13. Azar Sadeghnejad-Barkousaraie & Rajan Batta & Moises Sudit, 2017. "Convoy movement problem: a civilian perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 14-33, January.
  14. Yan Zheng & Yanran Li & Chung-Ming Own & Zhaopeng Meng & Mengya Gao, 2018. "Real-time predication and navigation on traffic congestion model with equilibrium Markov chain," International Journal of Distributed Sensor Networks, , vol. 14(4), pages 15501477187, April.
  15. Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
  16. Irina S. Dolinskaya, 2012. "Optimal path finding in direction, location, and time dependent environments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(5), pages 325-339, August.
  17. Steven K. Peterson & Richard L. Church, 2008. "A Framework for Modeling Rail Transport Vulnerability," Growth and Change, Wiley Blackwell, vol. 39(4), pages 617-641, December.
  18. Francesca Guerriero & Roberto Musmanno & Valerio Lacagnina & Antonio Pecorella, 2001. "A Class of Label-Correcting Methods for the K Shortest Paths Problem," Operations Research, INFORMS, vol. 49(3), pages 423-429, June.
  19. Daniel Selva & Bruce Cameron & Ed Crawley, 2016. "Patterns in System Architecture Decisions," Systems Engineering, John Wiley & Sons, vol. 19(6), pages 477-497, November.
  20. Ravindra K. Ahuja & James B. Orlin & Stefano Pallottino & Maria Grazia Scutellà, 2002. "Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights," Transportation Science, INFORMS, vol. 36(3), pages 326-336, August.
  21. Redmond, Michael & Campbell, Ann Melissa & Ehmke, Jan Fabian, 2022. "Reliability in public transit networks considering backup itineraries," European Journal of Operational Research, Elsevier, vol. 300(3), pages 852-864.
  22. Sylvain M. R. Fournier & Eduardo Otte Hülse & Éder Vasco Pinheiro, 2021. "A*-guided heuristic for a multi-objective bus passenger Trip Planning Problem," Public Transport, Springer, vol. 13(3), pages 557-578, October.
  23. S. Ardizzoni & L. Consolini & M. Laurini & M. Locatelli, 2022. "Shortest path with acceleration constraints: complexity and approximation algorithms," Computational Optimization and Applications, Springer, vol. 83(2), pages 555-592, November.
  24. Eiji Mizutani & Kevin Alexander Sánchez Galeano, 2023. "A note on a single-shift days-off scheduling problem with sequence-dependent labor costs," Journal of Scheduling, Springer, vol. 26(3), pages 315-329, June.
  25. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
  26. Fu, Liping & Rilett, L. R., 1998. "Expected shortest paths in dynamic and stochastic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(7), pages 499-516, September.
  27. Yang, Jinling & Chen, Zhiwei & Criado, Regino & Zhang, Shenggui, 2024. "A mathematical framework for shortest path length computation in multi-layer networks with inter-edge weighting and dynamic inter-edge weighting: The case of the Beijing bus network, China," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
  28. Santos, Luis & Coutinho-Rodrigues, João & Current, John R., 2007. "An improved solution algorithm for the constrained shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 756-771, August.
  29. Irina S. Dolinskaya & Marina A. Epelman & Esra Şişikoğlu Sir & Robert L. Smith, 2016. "Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 631-655, May.
  30. Maren Martens & Martin Skutella, 2009. "Flows with unit path capacities and related packing and covering problems," Journal of Combinatorial Optimization, Springer, vol. 18(3), pages 272-293, October.
  31. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
  32. 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.
  33. Delafield, Gemma & Smith, Greg S. & Day, Brett & Holland, Robert A. & Donnison, Caspar & Hastings, Astley & Taylor, Gail & Owen, Nathan & Lovett, Andrew, 2024. "Spatial context matters: Assessing how future renewable energy pathways will impact nature and society," Renewable Energy, Elsevier, vol. 220(C).
  34. Eric Daniel Fournier, 2016. "MOGADOR revisited: Improving a genetic approach to multi-objective corridor search," Environment and Planning B, , vol. 43(4), pages 663-680, July.
  35. 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.
  36. Bradley Casey & Ashish Bhaskar & Hao Guo & Edward Chung, 2014. "Critical Review of Time-Dependent Shortest Path Algorithms: A Multimodal Trip Planner Perspective," Transport Reviews, Taylor & Francis Journals, vol. 34(4), pages 522-539, July.
  37. Rolando Quintero & Esteban Mendiola & Giovanni Guzmán & Miguel Torres-Ruiz & Carlos Guzmán Sánchez-Mejorada, 2023. "Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs," Mathematics, MDPI, vol. 11(23), pages 1-30, November.
  38. Sullivan, Edward C., 1973. "A Transportation Analysis Technique for National Resource Management," Transportation Research Forum Proceedings 1970s 318288, Transportation Research Forum.
  39. Luigi Di Puglia Pugliese & Francesca Guerriero, 2016. "On the shortest path problem with negative cost cycles," Computational Optimization and Applications, Springer, vol. 63(2), pages 559-583, March.
  40. Trotter, Philipp A. & Cooper, Nathanial J. & Wilson, Peter R., 2019. "A multi-criteria, long-term energy planning optimisation model with integrated on-grid and off-grid electrification – The case of Uganda," Applied Energy, Elsevier, vol. 243(C), pages 288-312.
  41. Pijls, Wim & Post, Henk, 2009. "A new bidirectional search algorithm with shortened postprocessing," European Journal of Operational Research, Elsevier, vol. 198(2), pages 363-369, October.
  42. Stern, R.E. & Song, J. & Work, D.B., 2017. "Accelerated Monte Carlo system reliability analysis through machine-learning-based surrogate models of network connectivity," Reliability Engineering and System Safety, Elsevier, vol. 164(C), pages 1-9.
  43. Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.
  44. Dimitri P. Bertsekas, 2019. "Robust shortest path planning and semicontractive dynamic programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 15-37, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.