IDEAS home Printed from https://ideas.repec.org/p/cdl/uctcwp/qt96j6m01h.html
   My bibliography  Save this paper

Robust Dynamic Traffic Assignment under Demand and Capacity Uncertainty

Author

Listed:
  • Calafiore, Giuseppe
  • El Ghaoui, Laurent

Abstract

In this note we discuss the system optimum dynamic traffic assignment (SO-DTA) problem in the presence of time-dependent uncertainty on the demands and link capacities. We start from the deterministic linear programming formulation of the SO-DTA problem introduced by Ziliaskopoulos in [14], and then consider a robust version of the decision problem where the total travel time must be minimized under a worst-case scenario of demand and capacity configurations. When uncertain demands and capacities are modeled as unknown-but-bounded quantities restricted in intervals, the resulting robust decision problem can still be formulated as a linear program and solved at the same computational cost as its nominal counterpart. Worst-case solutions to assignment problems appear to be useful for establishing routing policies that are resilient to possibly large variations of network parameters and for computing lower bounds on network performance in extreme situations.

Suggested Citation

  • Calafiore, Giuseppe & El Ghaoui, Laurent, 2008. "Robust Dynamic Traffic Assignment under Demand and Capacity Uncertainty," University of California Transportation Center, Working Papers qt96j6m01h, University of California Transportation Center.
    • Handle: RePEc:cdl:uctcwp:qt96j6m01h
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/96j6m01h.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Athanasios K. Ziliaskopoulos, 2000. "A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 34(1), pages 37-49, February.
    Full references (including those not matched with items on IDEAS)

    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. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    2. Gentile, Guido & Meschini, Lorenzo & Papola, Natale, 2007. "Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1114-1138, December.
    3. Yildirimoglu, Mehmet & Geroliminis, Nikolas, 2014. "Approximating dynamic equilibrium conditions with macroscopic fundamental diagrams," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 186-200.
    4. Wang, Jiawen & Zou, Linzhi & Zhao, Jing & Wang, Xinwei, 2024. "Dynamic capacity drop propagation in incident-affected networks: Traffic state modeling with SIS-CTM," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 637(C).
    5. Muñoz, Juan Carlos & Laval, Jorge A., 2006. "System optimum dynamic traffic assignment graphical solution method for a congested freeway and one destination," Transportation Research Part B: Methodological, Elsevier, vol. 40(1), pages 1-15, January.
    6. Chen, Xiaoming & Zhou, Xuesong & List, George F., 2011. "Using time-varying tolls to optimize truck arrivals at ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 965-982.
    7. Reilly, Jack & Martin, Sébastien & Payer, Mathias & Bayen, Alexandre M., 2016. "Creating complex congestion patterns via multi-objective optimal freeway traffic control with application to cyber-security," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 366-382.
    8. Ben-Tal, Aharon & Chung, Byung Do & Mandala, Supreet Reddy & Yao, Tao, 2011. "Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1177-1189, September.
    9. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    10. Bretschneider, S. & Kimms, A., 2012. "Pattern-based evacuation planning for urban areas," European Journal of Operational Research, Elsevier, vol. 216(1), pages 57-69.
    11. Jiancheng Long & Wai Yuen Szeto, 2019. "Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks," Operations Research, INFORMS, vol. 67(1), pages 167-182, January.
    12. Wang, Hongping & Fang, Yi-Ping & Zio, Enrico, 2022. "Resilience-oriented optimal post-disruption reconfiguration for coupled traffic-power systems," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
    13. Recker, Will, 2008. "Development of an Adaptive Corridor Traffic Control Model," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt1sq7049f, Institute of Transportation Studies, UC Berkeley.
    14. Lu, Chung-Cheng & Liu, Jiangtao & Qu, Yunchao & Peeta, Srinivas & Rouphail, Nagui M. & Zhou, Xuesong, 2016. "Eco-system optimal time-dependent flow assignment in a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 217-239.
    15. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    16. Cantelmo, Guido & Viti, Francesco, 2019. "Incorporating activity duration and scheduling utility into equilibrium-based Dynamic Traffic Assignment," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 365-390.
    17. Ngoduy, D. & Hoang, N.H. & Vu, H.L. & Watling, D., 2016. "Optimal queue placement in dynamic system optimum solutions for single origin-destination traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 148-169.
    18. Jian Li & Kaan Ozbay, 2015. "Evacuation Planning with Endogenous Transportation Network Degradations: A Stochastic Cell-Based Model and Solution Procedure," Networks and Spatial Economics, Springer, vol. 15(3), pages 677-696, September.
    19. Xinhua Mao & Jianwei Wang & Changwei Yuan & Wei Yu & Jiahua Gan, 2018. "A Dynamic Traffic Assignment Model for the Sustainability of Pavement Performance," Sustainability, MDPI, vol. 11(1), pages 1-19, December.
    20. Schmitt, Marius & Lygeros, John, 2018. "An exact convex relaxation of the freeway network control problem with controlled merging junctions," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 1-25.

    More about this item

    Keywords

    ;

    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:cdl:uctcwp:qt96j6m01h. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucbus.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.