IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v36y2002i3p326-336.html
   My bibliography  Save this article

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights

Author

Listed:
  • Ravindra K. Ahuja

    (Department of Industrial and Systems Engineering, University of Florida, Gainsville, Florida)

  • James B. Orlin

    (Sloan School of Management, MIT, Cambridge, Massachusetts)

  • Stefano Pallottino

    (Dipartimento di Informatica, Università di Pisa, Pisa, Italy)

  • Maria Grazia Scutellà

    (Dipartimento di Informatica, Università di Pisa, Pisa, Italy)

Abstract

This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NP-hard. Special, realistic cases which are polynomially solvable are discussed.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:36:y:2002:i:3:p:326-336
    DOI: 10.1287/trsc.36.3.326.7827
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.36.3.326.7827
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.36.3.326.7827?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
    ---><---

    References listed on IDEAS

    as
    1. Desrochers, Martin & Soumis, Francois, 1988. "A reoptimization algorithm for the shortest path problem with time windows," European Journal of Operational Research, Elsevier, vol. 35(2), pages 242-254, May.
    2. Stuart E. Dreyfus, 1969. "An Appraisal of Some Shortest-Path Algorithms," Operations Research, INFORMS, vol. 17(3), pages 395-412, June.
    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. Shen, Liang & Shao, Hu & Wu, Ting & Fainman, Emily Zhu & Lam, William H.K., 2020. "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    2. Arslan, Okan & Yıldız, Barış & Karaşan, Oya Ekin, 2015. "Minimum cost path problem for Plug-in Hybrid Electric Vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 80(C), pages 123-141.
    3. 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.
    4. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.

    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. 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.
    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. Elisabeth Lübbecke & Marco E. Lübbecke & Rolf H. Möhring, 2019. "Ship Traffic Optimization for the Kiel Canal," Operations Research, INFORMS, vol. 67(3), pages 791-812, May.
    4. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
    5. 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.
    6. Ishwar Murthy & Sumit Sarkar, 1998. "Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions," Management Science, INFORMS, vol. 44(11-Part-2), pages 125-136, November.
    7. Belanger, Nicolas & Desaulniers, Guy & Soumis, Francois & Desrosiers, Jacques, 2006. "Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1754-1766, December.
    8. 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.
    9. 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.
    10. Suman, Hemant K. & Bolia, Nomesh B., 2019. "Improvement in direct bus services through route planning," Transport Policy, Elsevier, vol. 81(C), pages 263-274.
    11. Zeighami, Vahid & Saddoune, Mohammed & Soumis, François, 2020. "Alternating Lagrangian decomposition for integrated airline crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 287(1), pages 211-224.
    12. Formaneck, Steven D. & Cozzarin, Brian P., 2013. "Technology adoption and training practices as a constrained shortest path problem," Omega, Elsevier, vol. 41(2), pages 459-472.
    13. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    14. 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.
    15. Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
    16. 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.
    17. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. 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.
    19. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    20. Charlotte Vilhelmsen & Richard M. Lusby & Jesper Larsen, 2017. "Tramp ship routing and scheduling with voyage separation requirements," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 913-943, October.

    More about this item

    Statistics

    Access and download statistics

    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:inm:ortrsc:v:36:y:2002:i:3:p:326-336. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.