Skip to main content

Advertisement

SpringerLink
Log in

The energy-constrained quickest path problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This paper addresses a variant of the quickest path problem in which each arc has an additional parameter associated to it representing the energy consumed during the transmission along the arc while each node is endowed with a limited power to transmit messages. The aim of the energy-constrained quickest path problem is to obtain a quickest path whose nodes are able to support the transmission of a message of a known size. After introducing the problem and proving the main theoretical results, a polynomial algorithm is proposed to solve the problem based on computing shortest paths in a sequence of subnetworks of the original network. In the second part of the paper, the bi-objective variant of this problem is considered in which the objectives are the transmission time and the total energy used. An exact algorithm is proposed to find a complete set of efficient paths. The computational experiments carried out show the performance of both algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Calvete, H., del-Pozo, L.: The quickest path problem with batch constraints. Oper. Res. Lett. 31(4), 277–284 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Calvete, H., del-Pozo, L., Iranzo, J.: Algorithms for the quickest path problem and the reliable quickest path problem. Comput. Manag. Sci. 9(2), 255–272 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, G., Hung, Y.: Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 21, 113–118 (1994)

    Article  MATH  Google Scholar 

  4. Chen, Y.: Finding the \(k\) quickest simple paths in a network. Inf. Process. Lett. 50, 89–92 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen, Y., Chin, Y.: The quickest path problem. Comput. Oper. Res. 17(2), 153–161 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Clímaco, J., Pascoal, M., Craveirinha, J., Captivo, M.: Internet packet routing: application of a k-quickest path algorithm. Eur. J. Oper. Res. 181, 1045–1054 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34(3), 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  8. Hamacher, H., Tjandra, S.: Mathematical modelling of evacuation problems: a state of the art. In: Schreckenberg, M., Sharma, S. (eds.) Pedestrian and Evacuation Dynamics, pp. 227–266. Springer, Berlin (2002)

    Google Scholar 

  9. Klingman, D., Napier, A., Stutz, J.: Netgen: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manag. Sci. 20(5), 814–821 (1974)

    Article  MATH  Google Scholar 

  10. Martins, E., Santos, J.: An algorithm for the quickest path problem. Oper. Res. Lett. 20(4), 195–198 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Moore, M.: On the fastest route for convoy-type traffic in flowrate-constrained networks. Transp. Sci. 10(2), 113–124 (1976)

    Article  MathSciNet  Google Scholar 

  12. Park, C.K., Lee, S., Park, S.: A label-setting algorithm for finding a quickest path. Comput. Oper. Res. 31(14), 2405–2418 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pascoal, M., Captivo, M., Clímaco, J.: An algorithm for ranking quickest simple paths. Comput. Oper. Res. 32(3), 509–521 (2005)

    Article  MATH  Google Scholar 

  14. Pascoal, M., Captivo, M., Clímaco, J.: A comprehensive survey on the quickest path problem. Ann. Oper. Res. 147(1), 5–21 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pascoal, M., Captivo, M., Clímaco, J.: Computational experiments with a lazy version of a \(k\) quickest simple path ranking algorithm. TOP 15(2), 372–382 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Pelegrín, B., Fernández, P.: On the sum-max bicriterion path problem. Comput. Oper. Res. 25(12), 1043–1054 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299–1331 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Rao, N., Grimmell, W., Radhakrishan, S., Bang, Y., Manickam, N.: Quickest paths for different network router mechanisms. In: Proceedings of ninth International Conference on Advanced Computing and Communications (2001)

  19. Rosen, J., Sun, S., Xue, G.: Algorithms for the quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 18(6), 579–584 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  20. Sedeño-Noda, A., González-Barrera, J.: Fast and fine quickest path algorithm. Eur. J. Oper. Res. 238(2), 596–606 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research work has been funded by the Gobierno de Aragón under Grant E58 (FSE) and by UZ-Santander under Grant UZ2012-CIE-07. The authors gratefully acknowledge the anonymous referee for his/her valuable suggestions to improve the presentation of the paper.

Author information

Authors and Affiliations

  1. Dpto. de Métodos Estadísticos, IUMA, Universidad de Zaragoza, Pedro Cerbuna 12, 50009, Zaragoza, Spain

    Herminia I. Calvete & José A. Iranzo

  2. Dpto. de Métodos Estadísticos, Universidad de Zaragoza, Violante de Hungría 23, 50009, Zaragoza, Spain

    Lourdes del-Pozo

Authors
  1. Herminia I. Calvete
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lourdes del-Pozo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José A. Iranzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Herminia I. Calvete.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Calvete, H.I., del-Pozo, L. & Iranzo, J.A. The energy-constrained quickest path problem. Optim Lett 11, 1319–1339 (2017). https://doi.org/10.1007/s11590-016-1073-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1073-x

Keywords

Search

Navigation