IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v238y2014i2p596-606.html
   My bibliography  Save this article

Fast and fine quickest path algorithm

Author

Listed:
  • Sedeño-Noda, Antonio
  • González-Barrera, Jonathan D.

Abstract

We address the quickest path problem proposing a new algorithm based on the fact that its optimal solution corresponds to a supported non-dominated point in the objective space of the minsum–maxmin bicriteria path problem. This result allows us to design a label setting algorithm which improves all existing algorithms in the state-of-the-art, as it is shown in the extensive experiments carried out considering synthetic and real networks.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:238:y:2014:i:2:p:596-606
    DOI: 10.1016/j.ejor.2014.04.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714003701
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.04.028?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. 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.
    2. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    3. 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.
    4. M. Pascoal & M. Captivo & J. Clímaco, 2007. "Computational experiments with a lazy version of a K quickest simple path ranking algorithm," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 372-382, December.
    5. 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.
    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. 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.
    2. Forghani-elahabad, Majid & Mahdavi-Amiri, Nezam, 2015. "An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint," Reliability Engineering and System Safety, Elsevier, vol. 142(C), pages 472-481.

    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. 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.
    2. 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.
    3. 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.
    4. Ashutosh Sharma & Rajiv Kumar & Manar Wasif Abu Talib & Saurabh Srivastava & Razi Iqbal, 2019. "Network modelling and computation of quickest path for service-level agreements using bi-objective optimization," International Journal of Distributed Sensor Networks, , vol. 15(10), pages 15501477198, October.
    5. 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.
    6. Forghani-elahabad, Majid & Mahdavi-Amiri, Nezam, 2015. "An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint," Reliability Engineering and System Safety, Elsevier, vol. 142(C), pages 472-481.
    7. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    8. Festa, P. & Guerriero, F. & Laganà, D. & Musmanno, R., 2013. "Solving the shortest path tour problem," European Journal of Operational Research, Elsevier, vol. 230(3), pages 464-474.
    9. R. Fourer & H. Gassmann & J. Ma & R. Martin, 2009. "An XML-based schema for stochastic programs," Annals of Operations Research, Springer, vol. 166(1), pages 313-337, February.
    10. Mongeau, Marcel & Sartenaer, Annick, 1995. "Automatic decrease of the penalty parameter in exact penalty function methods," European Journal of Operational Research, Elsevier, vol. 83(3), pages 686-699, June.
    11. Moreno, Alfredo & Munari, Pedro & Alem, Douglas, 2019. "A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration," European Journal of Operational Research, Elsevier, vol. 275(1), pages 16-34.
    12. 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.
    13. P. Beraldi & F. Guerriero & R. Musmanno, 1997. "Efficient Parallel Algorithms for the Minimum Cost Flow Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(3), pages 501-530, December.
    14. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1992. "Use of representative operation counts in computational testings of algorithms," Working papers 3459-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    16. X-Y Li & Y P Aneja & F Baki, 2010. "An ant colony optimization metaheuristic for single-path multicommodity network flow problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1340-1355, September.
    17. Avinash Unnikrishnan & Varunraj Valsaraj & Steven Waller, 2009. "Stochastic and Dynamic Shipper Carrier Network Design Problem," Networks and Spatial Economics, Springer, vol. 9(4), pages 525-550, December.
    18. 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.
    19. 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.
    20. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.

    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:eee:ejores:v:238:y:2014:i:2:p:596-606. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.