IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v147y2006i1p5-2110.1007-s10479-006-0068-x.html
   My bibliography  Save this article

A comprehensive survey on the quickest path problem

Author

Listed:
  • Marta Pascoal
  • M. Captivo
  • João Clímaco

Abstract

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a new variant of a known K quickest loopless paths algorithm. Finally, applications of quickest path algorithms are mentioned, as well as some comparative empirical results. Copyright Springer Science + Business Media, LLC 2006

Suggested Citation

  • Marta Pascoal & M. Captivo & João Clímaco, 2006. "A comprehensive survey on the quickest path problem," Annals of Operations Research, Springer, vol. 147(1), pages 5-21, October.
    • Handle: RePEc:spr:annopr:v:147:y:2006:i:1:p:5-21:10.1007/s10479-006-0068-x
    DOI: 10.1007/s10479-006-0068-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0068-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0068-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    2. Michael Hart Moore, 1976. "On the Fastest Route for Convoy-Type Traffic in Flowrate-Constrained Networks," Transportation Science, INFORMS, vol. 10(2), pages 113-124, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    2. Yu-Cheng Chou & Po Ting Lin, 2015. "An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(14), pages 2659-2672, October.
    3. Sedeño-Noda, Antonio & González-Barrera, Jonathan D., 2014. "Fast and fine quickest path algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 596-606.
    4. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    5. Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2017. "Efficient continuous contraflow algorithms for evacuation planning problems," Annals of Operations Research, Springer, vol. 254(1), pages 335-364, July.
    6. Urmila Pyakurel & Hari Nandan Nath & Tanka Nath Dhamala, 2019. "Partial contraflow with path reversals for evacuation planning," Annals of Operations Research, Springer, vol. 283(1), pages 591-612, December.
    7. Mehdi Ghiyasvand & Azam Ramezanipour, 2018. "Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(2), pages 217-230, June.
    8. Urmila Pyakurel & Hari Nandan Nath & Stephan Dempe & Tanka Nath Dhamala, 2019. "Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal," Mathematics, MDPI, vol. 7(10), pages 1-29, October.
    9. Calvete, Herminia I. & del-Pozo, Lourdes & Iranzo, José A., 2018. "Dealing with residual energy when transmitting data in energy-constrained capacitated networks," European Journal of Operational Research, Elsevier, vol. 269(2), pages 602-620.
    10. Pyakurel, Urmila & Khanal, Durga Prasad & Dhamala, Tanka Nath, 2023. "Abstract network flow with intermediate storage for evacuation planning," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1178-1193.
    11. Herminia Calvete & Lourdes del-Pozo & José Iranzo, 2012. "Algorithms for the quickest path problem and the reliable quickest path problem," Computational Management Science, Springer, vol. 9(2), pages 255-272, May.

    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.
    1. Herminia Calvete & Lourdes del-Pozo & José Iranzo, 2012. "Algorithms for the quickest path problem and the reliable quickest path problem," Computational Management Science, Springer, vol. 9(2), pages 255-272, May.
    2. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    3. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    4. Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.
    5. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    6. Alessandra Griffa & Mathieu Mach & Julien Dedelley & Daniel Gutierrez-Barragan & Alessandro Gozzi & Gilles Allali & Joanes Grandjean & Dimitri Ville & Enrico Amico, 2023. "Evidence for increased parallel information transmission in human brain networks compared to macaques and male mice," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    7. Qiang Tu & Han He & Xiaomin Lai & Chuan Jiang & Zhanji Zheng, 2024. "Identifying Critical Links in Degradable Road Networks Using a Traffic Demand-Based Indicator," Sustainability, MDPI, vol. 16(18), pages 1-20, September.
    8. Zhou, Bo & Eskandarian, Azim, 2006. "A Non-Deterministic Path Generation Algorithm for Traffic Networks," 47th Annual Transportation Research Forum, New York, New York, March 23-25, 2006 208047, Transportation Research Forum.
    9. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    10. Noruzoliaee, Mohamadhossein & Zou, Bo, 2022. "One-to-many matching and section-based formulation of autonomous ridesharing equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 72-100.
    11. 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.
    12. Mohamad Khattar Awad & Mohammed El‐Shafei & Tassos Dimitriou & Yousef Rafique & Mohammed Baidas & Ammar Alhusaini, 2017. "Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach," International Journal of Network Management, John Wiley & Sons, vol. 27(5), September.
    13. Juanzhu Liang & Shunyi Xie & Jinjian Bao, 2024. "Analysis of a Multiple Traffic Flow Network’s Spatial Organization Pattern Recognition Based on a Network Map," Sustainability, MDPI, vol. 16(3), pages 1-20, February.
    14. Guo, Fang & Yang, Jun & Lu, Jianyi, 2018. "The battery charging station location problem: Impact of users’ range anxiety and distance convenience," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 1-18.
    15. Peter Davison & Bruce Cameron & Edward F. Crawley, 2015. "Technology Portfolio Planning by Weighted Graph Analysis of System Architectures," Systems Engineering, John Wiley & Sons, vol. 18(1), pages 45-58, January.
    16. 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.
    17. Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
    18. Zhang, X. & Miller-Hooks, E. & Denny, K., 2015. "Assessing the role of network topology in transportation network resilience," Journal of Transport Geography, Elsevier, vol. 46(C), pages 35-45.
    19. Sandra Zajac, 2018. "On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem," Journal of Heuristics, Springer, vol. 24(3), pages 515-550, June.
    20. Meng, Qiang & Liu, Zhiyuan & Wang, Shuaian, 2012. "Optimal distance tolls under congestion pricing and continuously distributed value of time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 937-957.

    Corrections

    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:annopr:v:147:y:2006:i:1:p:5-21:10.1007/s10479-006-0068-x. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.