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

Dynamic system optimal traffic assignment with atomic users: Convergence and stability

Author

Listed:
  • Satsukawa, Koki
  • Wada, Kentaro
  • Watling, David

Abstract

In this study, we analyse the convergence and stability of dynamic system optimal (DSO) traffic assignment with fixed departure times. We first formulate the DSO traffic assignment problem as a strategic game wherein atomic users select routes that minimise their marginal social costs, called a ‘DSO game’. By utilising the fact that the DSO game is a potential game, we prove that a globally optimal state is a stochastically stable state under the logit response dynamics, and the better/best response dynamics converges to a locally optimal state. Furthermore, as an application of DSO assignment, we examine characteristics of the evolutionary implementation scheme of marginal cost pricing. Through theoretical comparison with a fixed pricing scheme, we found the following properties of the evolutionary implementation scheme: (i) the total travel time decreases smoother to an efficient traffic state as congestion externalities are perfectly internalised; (ii) a traffic state would reach a more efficient state as the globally optimal state is stabilised. Numerical experiments also suggest that these properties make the evolutionary scheme robust in the sense that they prevent a traffic state from going to worse traffic states with high total travel times.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:155:y:2022:i:c:p:188-209
    DOI: 10.1016/j.trb.2021.11.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261521002071
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2021.11.001?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. Sandholm, William H., 2007. "Pigouvian pricing and stochastic evolutionary implementation," Journal of Economic Theory, Elsevier, vol. 132(1), pages 367-382, January.
    2. Malachy Carey & Y. E. Ge & Mark McCartney, 2003. "A Whole-Link Travel-Time Model with Desirable Properties," Transportation Science, INFORMS, vol. 37(1), pages 83-96, February.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. William H. Sandholm, 2005. "Negative Externalities and Evolutionary Implementation," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 72(3), pages 885-915.
    8. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2019. "Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 229-247.
    9. William H. Sandholm, 2002. "Evolutionary Implementation and Congestion Pricing," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 69(3), pages 667-689.
    10. Daganzo, Carlos F., 1995. "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 79-93, April.
    11. Akamatsu, Takashi & Wada, Kentaro & Hayashi, Shunsuke, 2015. "The corridor problem with discrete multiple bottlenecks," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 808-829.
    12. Tampère, Chris M.J. & Corthout, Ruben & Cattrysse, Dirk & Immers, Lambertus H., 2011. "A generic class of first order node models for dynamic macroscopic simulation of traffic flows," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 289-309, January.
    13. Smits, Erik-Sander & Bliemer, Michiel C.J. & Pel, Adam J. & van Arem, Bart, 2015. "A family of macroscopic node models," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 20-39.
    14. 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.
    15. Blume Lawrence E., 1993. "The Statistical Mechanics of Strategic Interaction," Games and Economic Behavior, Elsevier, vol. 5(3), pages 387-424, July.
    16. Zhang, H.M. & Shen, Wei, 2010. "Access control policies without inside queues: Their properties and public policy implications," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1132-1147, September.
    17. Marden, Jason R. & Shamma, Jeff S., 2012. "Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation," Games and Economic Behavior, Elsevier, vol. 75(2), pages 788-808.
    18. 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.
    19. Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
    20. 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.
    21. Young, H. Peyton, 2004. "Strategic Learning and its Limits," OUP Catalogue, Oxford University Press, number 9780199269181.
    22. 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.
    23. Carey, Malachy, 1992. "Nonconvexity of the dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 26(2), pages 127-133, April.
    24. 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).
    25. Wada, Kentaro & Satsukawa, Koki & Smith, Mike & Akamatsu, Takashi, 2019. "Network throughput under dynamic user equilibrium: Queue spillback, paradox and traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 391-413.
    26. Daganzo, Carlos F., 1994. "The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory," Transportation Research Part B: Methodological, Elsevier, vol. 28(4), pages 269-287, August.
    27. 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.
    28. 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.
    29. Newell, G. F., 2002. "A simplified car-following theory: a lower order model," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 195-205, March.
    30. Malachy Carey & Ashok Srinivasan, 1993. "Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows," Operations Research, INFORMS, vol. 41(1), pages 217-231, February.
    31. Garcia, Alfredo & Reaume, Daniel & Smith, Robert L., 2000. "Fictitious play for finding system optimal routings in dynamic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 147-156, February.
    32. 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.
    33. 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.
    34. 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).
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    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. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2020. "Reprint of “Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach”," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 117-135.
    16. 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.
    17. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2019. "Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 229-247.
    18. 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.
    19. Carey, Malachy, 2021. "The cell transmission model with free-flow speeds varying over time or space," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 245-257.
    20. Samitha Samaranayake & Walid Krichene & Jack Reilly & Maria Laura Delle Monache & Paola Goatin & Alexandre Bayen, 2018. "Discrete-Time System Optimal Dynamic Traffic Assignment (SO-DTA) with Partial Control for Physical Queuing Networks," Transportation Science, INFORMS, vol. 52(4), pages 982-1001, 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:155:y:2022:i:c:p:188-209. 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.