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

Updating Paths in Time-Varying Networks Given Arc Weight Changes

Author

Listed:
  • Elise Miller-Hooks

    (Department of Civil and Environmental Engineering, 1173 Glenn Martin Hall, University of Maryland, College Park, Maryland 20742)

  • Baiyu Yang

    (Operations Research and Decision Support, American Airlines, 4333 Amon Carter Boulevard, MD 5358, Fort Worth, Texas 76155)

Abstract

Many transportation applications, including applications in intelligent transportation systems, require the solution of a series of shortest path problems in which only the travel time along a set of arcs of the network change from one problem instance to the next. One could use an existing path algorithm to solve each problem instance independently as it arises. However, significant savings in computation time can often be achieved through the use of a reoptimization algorithm that would begin from the prior solution in determining the updated optimal solution for the given arc travel-time changes. Such quick solution is critical for providing routing instructions to travelers in real time as travel-time information is retrieved from the traffic network. Numerous works have presented reoptimization techniques for use in updating shortest path trees in deterministic and static networks; however, it appears that no reoptimization technique exists in the literature for updating paths where future travel times in time-varying networks change. In this paper, such procedures are proposed. The proposed techniques can provide updated solutions given simultaneous and arbitrary changes (increasing and decreasing in value) in any number of network arcs. Further, this technique can be extended for use in stochastic networks.

Suggested Citation

  • Elise Miller-Hooks & Baiyu Yang, 2005. "Updating Paths in Time-Varying Networks Given Arc Weight Changes," Transportation Science, INFORMS, vol. 39(4), pages 451-464, November.
    • Handle: RePEc:inm:ortrsc:v:39:y:2005:i:4:p:451-464
    DOI: 10.1287/trsc.1040.0112
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1040.0112
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1040.0112?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. 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.
    2. Beroggi, Giampiero E. G., 1994. "A real-time routing model for hazardous materials," European Journal of Operational Research, Elsevier, vol. 75(3), pages 508-520, June.
    3. 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.
    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, Zuo-Jun Max & Pannala, Jyothsna & Rai, Rohit & Tsoi, Tsz Shing, 2008. "Modeling Transportation Networks During Disruptions and Emergency Evacuations," University of California Transportation Center, Working Papers qt1257t9zn, University of California Transportation Center.
    2. Wen, Liang & Çatay, Bülent & Eglese, Richard, 2014. "Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge," European Journal of Operational Research, Elsevier, vol. 236(3), pages 915-923.
    3. Schmidt, Carise E. & Silva, Arinei C.L. & Darvish, Maryam & Coelho, Leandro C., 2019. "The time-dependent location-routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 293-315.

    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. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    2. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    3. Valentina Trozzi & Guido Gentile & Ioannis Kaparias & Michael Bell, 2015. "Effects of Countdown Displays in Public Transport Route Choice Under Severe Overcrowding," Networks and Spatial Economics, Springer, vol. 15(3), pages 823-842, September.
    4. Jiang, Yi & Li, Shuo & Shamo, Daniel E., 2006. "A platoon-based traffic signal timing algorithm for major-minor intersection types," Transportation Research Part B: Methodological, Elsevier, vol. 40(7), pages 543-562, August.
    5. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    6. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
    7. Chai, Huajun, 2019. "Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment," Institute of Transportation Studies, Working Paper Series qt9ng3z8vn, Institute of Transportation Studies, UC Davis.
    8. Yang, Lixing & Zhou, Xuesong, 2014. "Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 22-44.
    9. 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.
    10. Yu Nie & Xing Wu & Tito Homem-de-Mello, 2012. "Optimal Path Problems with Second-Order Stochastic Dominance Constraints," Networks and Spatial Economics, Springer, vol. 12(4), pages 561-587, December.
    11. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    12. López, David & Lozano, Angélica, 2020. "Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 541-559.
    13. Yang, Xuejing & Low, Joyce M.W. & Tang, Loon Ching, 2011. "Analysis of intermodal freight from China to Indian Ocean: A goal programming approach," Journal of Transport Geography, Elsevier, vol. 19(4), pages 515-527.
    14. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
    15. 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).
    16. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    17. Nielsen, Lars Relund & Pretolani, Daniele & Andersen, Kim Allan, 2004. "K shortest paths in stochastic time-dependent networks," CORAL Working Papers L-2004-05, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    18. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    19. Tsung-Sheng Chang & Linda K. Nozick & Mark A. Turnquist, 2005. "Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 39(3), pages 383-399, August.
    20. Arun Prakash, A., 2020. "Algorithms for most reliable routes on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 202-220.

    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:39:y:2005:i:4:p:451-464. 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.