IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v94y2016icp1-21.html
   My bibliography  Save this article

Proactive route guidance to avoid congestion

Author

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

Abstract

We propose a proactive route guidance approach that integrates a system perspective: minimizing congestion, and a user perspective: minimizing travel inconvenience. The approach assigns paths to users so as to minimize congestion while not increasing their travel inconvenience too much. A maximum level of travel inconvenience is ensured and a certain level of fairness is maintained by limiting the set of considered paths for each Origin-Destination pair to those whose relative difference with respect to the shortest (least-duration) path, called travel inconvenience, is below a given threshold. The approach hierarchically minimizes the maximum arc utilization and the weighted average experienced travel inconvenience. Minimizing the maximum arc utilization in the network, i.e., the ratio of the number of vehicles entering an arc per time unit and the maximum number of vehicles per time unit at which vehicles can enter the arc and experience no slowdown due to congestion effects, is a system-oriented objective, while minimizing the weighted average experienced travel inconvenience, i.e., the average travel inconvenience over all eligible paths weighted by the number of vehicles per time unit that traverse the path, is a user-oriented objective. By design, to ensure computational efficiency, the approach only solves linear programming models. In a computational study using benchmark instances reflecting a road infrastructure encountered in many cities, we analyze, for different levels of maximum travel inconvenience and, the minimum maximum arc utilization and the weighted average experienced travel inconvenience. We find that accepting relatively small levels of maximum travel inconvenience can result in a significant reduction, or avoiding, of congestion.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:transb:v:94:y:2016:i:c:p:1-21
    DOI: 10.1016/j.trb.2016.08.015
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.trb.2016.08.015?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. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    2. Suvrajeet Sen & Rekha Pillai & Shirish Joshi & Ajay K. Rathi, 2001. "A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems," Transportation Science, INFORMS, vol. 35(1), pages 37-49, February.
    3. 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).
    4. 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.
    5. 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. Zhou, Bo & Song, Qiankun & Zhao, Zhenjiang & Liu, Tangzhi, 2020. "A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    3. Amer, Hayder M. & Al-Kashoash, Hayder & Hawes, Matthew & Chaqfeh, Moumena & Kemp, Andrew & Mihaylova, Lyudmila, 2019. "Centralized simulated annealing for alleviating vehicular congestion in smart cities," Technological Forecasting and Social Change, Elsevier, vol. 142(C), pages 235-248.
    4. Péter Tamás & Sándor Tollár & Béla Illés & Tamás Bányai & Ágota Bányai Tóth & Róbert Skapinyecz, 2020. "Decision Support Simulation Method for Process Improvement of Electronic Product Testing Systems," Sustainability, MDPI, vol. 12(7), pages 1-16, April.
    5. Cui, Nan & Chen, Bokui & Zhang, Kai & Zhang, Yi & Liu, Xiaotong & Zhou, Jun, 2019. "Effects of route guidance strategies on traffic emissions in intelligent transportation systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 32-44.
    6. Ivana Semanjski & Sidharta Gautama, 2019. "A Collaborative Stakeholder Decision-Making Approach for Sustainable Urban Logistics," Sustainability, MDPI, vol. 11(1), pages 1-11, January.
    7. Levy, Nadav & Klein, Ido & Ben-Elia, Eran, 2018. "Emergence of cooperation and a fair system optimum in road networks: A game-theoretic and agent-based modelling approach," Research in Transportation Economics, Elsevier, vol. 68(C), pages 46-55.
    8. 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).
    9. 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.
    10. 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.
    11. Hu, Xiao-Bing & Zhang, Ming-Kong & Zhang, Qi & Liao, Jian-Qin, 2017. "Co-Evolutionary path optimization by Ripple-Spreading algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 411-432.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    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. 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.
    9. 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.
    10. 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.
    11. 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).
    12. 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.
    13. 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.
    14. Goliszek Sławomir, 2022. "The potential accessibility to workplaces and working-age population by means of public and private car transport in Szczecin," Miscellanea Geographica. Regional Studies on Development, Sciendo, vol. 26(1), pages 31-41, January.
    15. Berliant, Marcus, 2017. "Commuting and internet traffic congestion," MPRA Paper 77378, University Library of Munich, Germany.
    16. Jiang, Chenming & Bhat, Chandra R. & Lam, William H.K., 2020. "A bibliometric overview of Transportation Research Part B: Methodological in the past forty years (1979–2019)," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 268-291.
    17. Lam, William H. K. & Yin, Yafeng, 2001. "An activity-based time-dependent traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 549-574, July.
    18. Dell'Orco, Mauro, 2006. "A dynamic network loading model for mesosimulation in transportation systems," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1447-1454, December.
    19. S. Waller & Athanasios Ziliaskopoulos, 2006. "A Combinatorial user optimal dynamic traffic assignment algorithm," Annals of Operations Research, Springer, vol. 144(1), pages 249-261, April.
    20. André de Palma & Mogens Fosgerau, 2011. "Dynamic Traffic Modeling," Chapters, in: André de Palma & Robin Lindsey & Emile Quinet & Roger Vickerman (ed.), A Handbook of Transport Economics, chapter 9, Edward Elgar Publishing.

    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:transb:v:94:y:2016:i:c:p:1-21. 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/wps/find/journaldescription.cws_home/548/description#description .

    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.