IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v17y2017i3d10.1007_s11067-017-9346-1.html
   My bibliography  Save this article

A Path-Based Solution Algorithm for Dynamic Traffic Assignment

Author

Listed:
  • Caixia Li

    (UNSW@ADFA)

  • Sreenatha Gopalarao Anavatti

    (UNSW@ADFA)

  • Tapabrata Ray

    (UNSW@ADFA)

Abstract

The approximation of the traversal cost is a critical component of dynamic traffic assignment model. In link based traffic assignment, it assumes that the constraints sets are linear or convex and it is not realistic in general traffic networks. Comparing with the link based model, the path cost in the objective function of the path based traffic assignment model is implicitly nonlinear or non-convex, which is difficult to solve. In this paper, a path based traffic assignment model combining the generalized expansion method in M/G/c/c model with the point queue model is proposed to extend the link traversal cost to the travel cost along the path. Comparing with the link based model without considering intersection effects, this proposed path based model can take into account queuing delays between intersections and it is easy to implement. In order to validate the proposed path based model, a comparative experiment is implemented by comparing with the traditional travel cost models in Sydney traffic networks. Taking into account travel flow changes and blocking time, the proposed path based model is more effective for travellers from the uncongested traffic to congested traffic networks. In addition, the results from traffic assignment model show that the proposed model can achieve feasible results.

Suggested Citation

  • Caixia Li & Sreenatha Gopalarao Anavatti & Tapabrata Ray, 2017. "A Path-Based Solution Algorithm for Dynamic Traffic Assignment," Networks and Spatial Economics, Springer, vol. 17(3), pages 841-860, September.
    • Handle: RePEc:kap:netspa:v:17:y:2017:i:3:d:10.1007_s11067-017-9346-1
    DOI: 10.1007/s11067-017-9346-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-017-9346-1
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-017-9346-1?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. Prashker, Joseph N. & Bekhor, Shlomo, 2000. "Some observations on stochastic user equilibrium and system optimum of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 277-291, May.
    2. Malachy Carey, 1987. "Optimal Time-Varying Flows on Congested Networks," Operations Research, INFORMS, vol. 35(1), pages 58-69, February.
    3. Satish Ukkusuri & S. Waller, 2008. "Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions," Networks and Spatial Economics, Springer, vol. 8(4), pages 383-406, December.
    4. Vickrey, William S, 1969. "Congestion Theory and Transport Investment," American Economic Review, American Economic Association, vol. 59(2), pages 251-260, May.
    5. Carey, Malachy & Subrahmanian, Eswaran, 2000. "An approach to modelling time-varying flows on congested networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(3), pages 157-183, April.
    6. Ceylan, Halim & Bell, Michael G. H., 2005. "Genetic algorithm solution for the stochastic equilibrium transportation networks under congestion," Transportation Research Part B: Methodological, Elsevier, vol. 39(2), pages 169-185, February.
    7. Smith, M. J., 1993. "A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 27(1), pages 49-63, February.
    8. 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.
    9. Kuwahara, Masao & Akamatsu, Takashi, 1997. "Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern," Transportation Research Part B: Methodological, Elsevier, vol. 31(1), pages 1-10, February.
    10. Malachy Carey & Y. Ge, 2012. "Comparison of Methods for Path Flow Reassignment for Dynamic User Equilibrium," Networks and Spatial Economics, Springer, vol. 12(3), pages 337-376, September.
    11. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    12. Cruz, F.R.B. & van Woensel, T. & MacGregor Smith, J. & Lieckens, K., 2010. "On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks," European Journal of Operational Research, Elsevier, vol. 201(1), pages 183-193, February.
    13. 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.
    14. Yu Nie & H. Zhang, 2010. "Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback," Networks and Spatial Economics, Springer, vol. 10(1), pages 49-71, March.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Ukkusuri, Satish V. & Han, Lanshan & Doan, Kien, 2012. "Dynamic user equilibrium with a path based cell transmission model for general traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1657-1684.
    6. Han, Ke & Friesz, Terry L. & Yao, Tao, 2013. "A partial differential equation formulation of Vickrey’s bottleneck model, part II: Numerical analysis and computation," Transportation Research Part B: Methodological, Elsevier, vol. 49(C), pages 75-93.
    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. 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. 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.
    10. 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.
    11. Ban, Xuegang (Jeff) & Pang, Jong-Shi & Liu, Henry X. & Ma, Rui, 2012. "Continuous-time point-queue models in dynamic network loading," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 360-380.
    12. 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.
    13. 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.
    14. 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.
    15. Han, Lanshan & Ukkusuri, Satish & Doan, Kien, 2011. "Complementarity formulations for the cell transmission model based dynamic user equilibrium with departure time choice, elastic demand and user heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1749-1767.
    16. 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.
    17. 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.
    18. 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).
    19. Babak Javani & Abbas Babazadeh, 2020. "Path-Based Dynamic User Equilibrium Model with Applications to Strategic Transportation Planning," Networks and Spatial Economics, Springer, vol. 20(2), pages 329-366, June.
    20. 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.

    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:kap:netspa:v:17:y:2017:i:3:d:10.1007_s11067-017-9346-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.