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

Time-Dependent, Label-Constrained Shortest Path Problems with Applications

Author

Listed:
  • Hanif D. Sherali

    (Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061)

  • Antoine G. Hobeika

    (Department of Civil and Environmental Engineering (0105), Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061)

  • Sasikul Kangwalklai

    (Accenture, One Market, Spear Street Tower, Suite 3700, San Francisco, California 94105)

Abstract

In this paper, we consider a variant of shortest path problems where, in addition to congestion related time-dependent link travel times on a given transportation network, we also have specific labels for each arc denoting particular modes of travel. The problem then involves finding a time-dependent shortest path from an origin node to a destination node that also conforms with some admissible string of labels. This problem arises in the Route Planner Module of Transportation Analysis Simulation System (TRANSIMS), which is developed by the Los Alamos National Laboratory and is part of a multitrack Travel Model Improvement Program sponsored by the U.S. Department of Transportation (DOT) and the Environmental Protection Agency (EPA). We propose an effective algorithm for this problem by adapting efficient existing partitioned shortest path algorithmic schemes to handle time dependency along with the label constraints. We also develop several heuristics to curtail the search based on various route restrictions, indicators of progress, and projected travel times to complete the trip. The proposed methodology is applied to solve some real multimodal test problems related to the Portland, Oregon, transportation system. Computational results for both the exact method and the heuristic curtailing schemes are provided.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:37:y:2003:i:3:p:278-293
    DOI: 10.1287/trsc.37.3.278.16042
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.37.3.278.16042
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.37.3.278.16042?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. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
    2. F. Glover & D. Klingman & N. Phillips, 1985. "A New Polynomially Bounded Shortest Path Algorithm," Operations Research, INFORMS, vol. 33(1), pages 65-73, February.
    3. Fred Glover & Darwin D. Klingman & Nancy V. Phillips & Robert F. Schneider, 1985. "New Polynomial Shortest Path Algorithms and Their Computational Attributes," Management Science, INFORMS, vol. 31(9), pages 1106-1128, September.
    4. 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. Qian Ye & Hyun Kim, 2019. "Partial Node Failure in Shortest Path Network Problems," Sustainability, MDPI, vol. 11(22), pages 1-21, November.
    2. Yannick Kergosien & Antoine Giret & Emmanuel Néron & Gaël Sauvanet, 2022. "An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 76-92, January.

    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. 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.
    2. 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).
    3. 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.
    4. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    5. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    6. 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.
    7. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    8. Salim, V., 1997. "A comparison of shortest path algorithms in urban traffic assignment," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 43(3), pages 545-551.
    9. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    10. 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.
    11. William Costa & Britaldo Soares-Filho & Rodrigo Nobrega, 2022. "Can the Brazilian National Logistics Plan Induce Port Competitiveness by Reshaping the Port Service Areas?," Sustainability, MDPI, vol. 14(21), pages 1-18, November.
    12. Boaz Golany & Moshe Kress & Michal Penn & Uriel G. Rothblum, 2012. "Network Optimization Models for Resource Allocation in Developing Military Countermeasures," Operations Research, INFORMS, vol. 60(1), pages 48-63, February.
    13. 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.
    14. 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.
    15. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    16. 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.
    17. Daniel Selva & Bruce Cameron & Ed Crawley, 2016. "Patterns in System Architecture Decisions," Systems Engineering, John Wiley & Sons, vol. 19(6), pages 477-497, November.
    18. 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.
    19. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh, 2011. "Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 105-119, February.
    20. 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.

    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:37:y:2003:i:3:p:278-293. 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.