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

Graphical solution for system optimum dynamic traffic assignment with day-based incentive routing strategies

Author

Listed:
  • Zhao, Chuan-Lin
  • Leclercq, Ludovic

Abstract

This paper analyzes the dynamic traffic assignment problem on a three-alternative network with day-based incentive routing strategies by using graphical solution method. It is assumed that the cumulative count curve of vehicles is known and that the arrival rate is unimodal. The dynamic system optimum (DSO) allocation lines are first drawn based on calculus of variations. Three possible optimal allocation lines are analyzed. A day-based incentive routing strategy is designed and conditions that when and how to implement the incentive scheme to realize DSO are then derived. Extension to general parallel networks is also given. Examples are presented to demonstrate the effectiveness of the scheme.

Suggested Citation

  • Zhao, Chuan-Lin & Leclercq, Ludovic, 2018. "Graphical solution for system optimum dynamic traffic assignment with day-based incentive routing strategies," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 87-100.
    • Handle: RePEc:eee:transb:v:117:y:2018:i:pa:p:87-100
    DOI: 10.1016/j.trb.2018.08.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517304733
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2018.08.018?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. Ian W. H. Parry & Kenneth A. Small, 2009. "Should Urban Transit Subsidies Be Reduced?," American Economic Review, American Economic Association, vol. 99(3), pages 700-724, June.
    2. Carlos F. Daganzo & Reinaldo C. Garcia, 2000. "A Pareto Improving Strategy for the Time-Dependent Morning Commute Problem," Transportation Science, INFORMS, vol. 34(3), pages 303-311, August.
    3. Daganzo, Carlos F. & Cassidy, Michael J., 2008. "Effects of high occupancy vehicle lanes on freeway congestion," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 861-872, December.
    4. 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.
    5. Rouwendal, Jan & Verhoef, Erik T. & Knockaert, Jasper, 2012. "Give or take? Rewards versus charges for a congested bottleneck," Regional Science and Urban Economics, Elsevier, vol. 42(1-2), pages 166-176.
    6. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "Optimality conditions for a dynamic traffic assignment model," LIDAM Reprints CORE 345, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Kuwahara, Masao, 2007. "A theory and implications on dynamic marginal cost," Transportation Research Part A: Policy and Practice, Elsevier, vol. 41(7), pages 627-643, August.
    8. 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.
    9. Shen, Wei & Zhang, H. Michael, 2009. "On the Morning Commute Problem in a Corridor Network with Multiple Bottlenecks: Its System-optimal Traffic Flow Patterns and the Realizing Tolling Scheme," Institute of Transportation Studies, Working Paper Series qt9bs815sq, Institute of Transportation Studies, UC Davis.
    10. Dahlgren, Joy, 2002. "High-occupancy/toll lanes: where should they be implemented?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(3), pages 239-255, March.
    11. Laval, Jorge A., 2009. "Graphical solution and continuum approximation for the single destination dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(1), pages 108-118, January.
    12. Arnott, Richard & de Palma, Andre & Lindsey, Robin, 1990. "Economics of a bottleneck," Journal of Urban Economics, Elsevier, vol. 27(1), pages 111-130, January.
    13. Daganzo, Carlos F. & Laval, Jorge & Munoz, Juan Carlos, 2002. "Ten Strategies for Freeway Congestion Mitigation with Advanced Technologies," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt4kd6v6qf, Institute of Transportation Studies, UC Berkeley.
    14. Yang, Hai & Wang, Xiaolei & Yin, Yafeng, 2012. "The impact of speed limits on traffic equilibrium and system performance in networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1295-1307.
    15. Fosgerau, Mogens, 2011. "How a fast lane may replace a congestion toll," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 845-851, July.
    16. Arnott, R. & de Palma, A. & Lindsey, R., 1990. "Departure time and route choice for the morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 209-228, June.
    17. Carey, Malachy & Watling, David, 2012. "Dynamic traffic assignment approximating the kinematic wave model: System optimum, marginal costs, externalities and tolls," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 634-648.
    18. Terry L. Friesz & Javier Luque & Roger L. Tobin & Byung-Wook Wie, 1989. "Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem," Operations Research, INFORMS, vol. 37(6), pages 893-901, December.
    19. 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).
    20. D'Acierno, Luca & Gallo, Mariano & Montella, Bruno, 2006. "Optimisation models for the urban parking pricing problem," Transport Policy, Elsevier, vol. 13(1), pages 34-48, January.
    21. Lahlou, Salem & Wynter, Laura, 2017. "A Nash equilibrium formulation of a tradable credits scheme for incentivizing transport choices: From next-generation public transport mode choice to HOT lanes," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 185-212.
    22. Wang, Xiaolei & Ye, Hongbo & Yang, Hai, 2015. "Decentralizing Pareto-efficient network flow/speed patterns with hybrid schemes of speed limit and road pricing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 51-64.
    23. Deepak K. Merchant & George L. Nemhauser, 1978. "Optimality Conditions for a Dynamic Traffic Assignment Model," Transportation Science, INFORMS, vol. 12(3), pages 200-207, August.
    24. Nie, Yu (Marco), 2011. "A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 329-342, February.
    25. Basso, Leonardo J. & Jara-Díaz, Sergio R., 2012. "Integrating congestion pricing, transit subsidies and mode choice," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(6), pages 890-900.
    26. Daganzo, Carlos F., 1995. "A pareto optimum congestion reduction scheme," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 139-154, April.
    27. Laval, Jorge A. & Cho, Hyun W. & Muñoz, Juan C. & Yin, Yafeng, 2015. "Real-time congestion pricing strategies for toll facilities," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 19-31.
    28. 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.
    29. Yang, Hai & Wang, Xiaolei, 2011. "Managing network mobility with tradable credits," Transportation Research Part B: Methodological, Elsevier, vol. 45(3), pages 580-594, March.
    30. Ghali, M. O. & Smith, M. J., 1995. "A model for the dynamic system optimum traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 155-170, June.
    31. Shen, Wei & Zhang, H.M., 2009. "On the morning commute problem in a corridor network with multiple bottlenecks: Its system-optimal traffic flow patterns and the realizing tolling scheme," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 267-284, March.
    32. Ma, Rui & Ban, Xuegang (Jeff) & Pang, Jong-Shi, 2014. "Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 98-122.
    33. Daganzo, Carlos F. & Lehe, Lewis J., 2015. "Distance-dependent congestion pricing for downtown zones," Transportation Research Part B: Methodological, Elsevier, vol. 75(C), pages 89-99.
    34. 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. Satsukawa, Koki & Wada, Kentaro & Watling, David, 2022. "Dynamic system optimal traffic assignment with atomic users: Convergence and stability," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 188-209.

    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. Lu, Gongyuan & Nie, Yu(Marco) & Liu, Xiaobo & Li, Denghui, 2019. "Trajectory-based traffic management inside an autonomous vehicle zone," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 76-98.
    2. Zhang, Pinchao & Qian, Sean, 2020. "Path-based system optimal dynamic traffic assignment: A subgradient approach," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 41-63.
    3. Satsukawa, Koki & Wada, Kentaro & Watling, David, 2022. "Dynamic system optimal traffic assignment with atomic users: Convergence and stability," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 188-209.
    4. 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.
    5. 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.
    6. Long, Jiancheng & Wang, Chao & Szeto, W.Y., 2018. "Dynamic system optimum simultaneous route and departure time choice problems: Intersection-movement-based formulations and comparisons," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 166-206.
    7. Nie, Yu (Marco), 2011. "A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 329-342, February.
    8. Shen, Wei & Zhang, H.M., 2009. "On the morning commute problem in a corridor network with multiple bottlenecks: Its system-optimal traffic flow patterns and the realizing tolling scheme," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 267-284, March.
    9. Ma, Rui & Ban, Xuegang (Jeff) & Pang, Jong-Shi, 2014. "Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 98-122.
    10. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun & Gao, Ziyou, 2015. "An intersection-movement-based stochastic dynamic user optimal route choice model for assessing network performance," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 182-217.
    11. Shen, Wei & Zhang, H.M., 2014. "System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 1-17.
    12. 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).
    13. Long, Jiancheng & Szeto, W.Y. & Gao, Ziyou & Huang, Hai-Jun & Shi, Qin, 2016. "The nonlinear equation system approach to solving dynamic user optimal simultaneous route and departure time choice problems," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 179-206.
    14. Islam, Tarikul & Vu, Hai L. & Hoang, Nam H. & Cricenti, Antonio, 2018. "A linear bus rapid transit with transit signal priority formulation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 163-184.
    15. Li, Zhi-Chun & Huang, Hai-Jun & Yang, Hai, 2020. "Fifty years of the bottleneck model: A bibliometric review and future research directions," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 311-342.
    16. Ma, Rui & Ban, Xuegang (Jeff) & Szeto, W.Y., 2017. "Emission modeling and pricing on single-destination dynamic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 255-283.
    17. Long, Jiancheng & Szeto, W.Y. & Du, Jie & Wong, R.C.P., 2017. "A dynamic taxi traffic assignment model: A two-level continuum transportation system approach," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 222-254.
    18. Yu Nie, 2015. "A New Tradable Credit Scheme for the Morning Commute Problem," Networks and Spatial Economics, Springer, vol. 15(3), pages 719-741, September.
    19. 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.
    20. 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.

    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:117:y:2018:i:pa:p:87-100. 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.