IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v293y2021i3p863-879.html
   My bibliography  Save this article

System optimal routing of traffic flows with user constraints using linear programming

Author

Listed:
  • Angelelli, E.
  • Morandi, V.
  • Savelsbergh, M.
  • Speranza, M.G.

Abstract

For static traffic assignment problems, it is well known that (1) for some users the experienced travel time in a system optimum assignment can be substantially higher than the experienced travel time in a user equilibrium assignment, and (2) the total travel time in user equilibrium can be substantially higher than the total travel time in system optimum. By seeking system optimal traffic flows subject to user constraints, a compromise assignment can be obtained that balances system and user objectives. To this aim, a linear model and an efficient heuristic algorithm are proposed in this paper. A computational study shows that the proposed model, along with the heuristic algorithm, is able to provide fair solutions with near-optimal total travel time within very short computational time.

Suggested Citation

  • Angelelli, E. & Morandi, V. & Savelsbergh, M. & Speranza, M.G., 2021. "System optimal routing of traffic flows with user constraints using linear programming," European Journal of Operational Research, Elsevier, vol. 293(3), pages 863-879.
  • Handle: RePEc:eee:ejores:v:293:y:2021:i:3:p:863-879
    DOI: 10.1016/j.ejor.2020.12.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720310894
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2020.12.043?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    2. Angelelli, E. & Arsik, I. & Morandi, V. & Savelsbergh, M. & Speranza, M.G., 2016. "Proactive route guidance to avoid congestion," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 1-21.
    3. Fagnant, Daniel J. & Kockelman, Kara, 2015. "Preparing a nation for autonomous vehicles: opportunities, barriers and policy recommendations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 167-181.
    4. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    5. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
    6. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2007. "Fast, Fair, and Efficient Flows in Networks," Operations Research, INFORMS, vol. 55(2), pages 215-225, April.
    7. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "A model and an algorithm for the dynamic traffic assignment problems," LIDAM Reprints CORE 346, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Papageorgiou, Markos, 1990. "Dynamic modeling, assignment, and route guidance in traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 471-495, December.
    9. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
    10. Deepak K. Merchant & George L. Nemhauser, 1978. "A Model and an Algorithm for the Dynamic Traffic Assignment Problems," Transportation Science, INFORMS, vol. 12(3), pages 183-199, August.
    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. Eikenbroek, Oskar A.L. & Still, Georg J. & van Berkum, Eric C., 2022. "Improving the performance of a traffic system by fair rerouting of travelers," European Journal of Operational Research, Elsevier, vol. 299(1), pages 195-207.
    2. Joanna Szkutnik-Rogoż & Jarosław Ziółkowski & Jerzy Małachowski & Mateusz Oszczypała, 2021. "Mathematical Programming and Solution Approaches for Transportation Optimisation in Supply Network," Energies, MDPI, vol. 14(21), pages 1-32, October.
    3. Sui Ye & Ziqiang Li & Jianchao Xi, 2024. "A Model for Estimating the Tourism Carrying Capacity of a Tourism Corridor: A Case Study of the Qinghai–Tibet Plateau," Sustainability, MDPI, vol. 16(13), pages 1-19, June.
    4. Fei Han & Jian Wang & Lingli Huang & Yan Li & Liu He, 2023. "Modeling Impacts of Implementation Policies of Tradable Credit Schemes on Traffic Congestion in the Context of Traveler’s Cognitive Illusion," Sustainability, MDPI, vol. 15(15), pages 1-18, July.
    5. Jarosław Ziółkowski & Aleksandra Lęgas & Elżbieta Szymczyk & Jerzy Małachowski & Mateusz Oszczypała & Joanna Szkutnik-Rogoż, 2022. "Optimization of the Delivery Time within the Distribution Network, Taking into Account Fuel Consumption and the Level of Carbon Dioxide Emissions into the Atmosphere," Energies, MDPI, vol. 15(14), pages 1-22, July.

    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. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    2. Sheu, Jiuh-Biing, 2006. "A composite traffic flow modeling approach for incident-responsive network traffic assignment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 461-478.
    3. Lam, William H. K. & Huang, Hai-Jun, 1995. "Dynamic user optimal traffic assignment model for many to one travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 243-259, August.
    4. Jin, Wen-Long, 2012. "A kinematic wave theory of multi-commodity network traffic flow," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1000-1022.
    5. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    6. S H Melouk & B B Keskin & C Armbrester & M Anderson, 2011. "A simulation optimization-based decision support tool for mitigating traffic congestion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1971-1982, November.
    7. B. G. Heydecker & J. D. Addison, 2005. "Analysis of Dynamic Traffic Equilibrium with Departure Time Choice," Transportation Science, INFORMS, vol. 39(1), pages 39-57, February.
    8. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    9. Correia, Gonçalo Homem de Almeida & van Arem, Bart, 2016. "Solving the User Optimum Privately Owned Automated Vehicles Assignment Problem (UO-POAVAP): A model to explore the impacts of self-driving vehicles on urban mobility," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 64-88.
    10. 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.
    11. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    12. Angelelli, E. & Arsik, I. & Morandi, V. & Savelsbergh, M. & Speranza, M.G., 2016. "Proactive route guidance to avoid congestion," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 1-21.
    13. Collins, Mor & Etzioni, Shelly & Ben-Elia, Eran, 2024. "Travel behavior and system dynamics in a simple gamified automated multimodal network," Transportation Research Part A: Policy and Practice, Elsevier, vol. 183(C).
    14. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    15. Fatemeh Nourmohammadi & Mohammadhadi Mansourianfar & Sajjad Shafiei & Ziyuan Gu & Meead Saberi, 2021. "An Open GMNS Dataset of a Dynamic Multi-Modal Transportation Network Model of Melbourne, Australia," Data, MDPI, vol. 6(2), pages 1-9, February.
    16. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    17. 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).
    18. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    19. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    20. Hemant Gehlot & Arif M. Sadri & Satish V. Ukkusuri, 2019. "Joint modeling of evacuation departure and travel times in hurricanes," Transportation, Springer, vol. 46(6), pages 2419-2440, December.

    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:eee:ejores:v:293:y:2021:i:3:p:863-879. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.