IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v33y1999i4p341-353.html
   My bibliography  Save this article

Advances in the Continuous Dynamic Network Loading Problem

Author

Listed:
  • Y. W. Xu

    (Center for Research on Transportation, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montréal, Quebec H3C 3J7, Canada)

  • J. H. Wu

    (Center for Research on Transportation, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montréal, Quebec H3C 3J7, Canada)

  • M. Florian

    (Center for Research on Transportation, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montréal, Quebec H3C 3J7, Canada)

  • P. Marcotte

    (Center for Research on Transportation, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montréal, Quebec H3C 3J7, Canada)

  • D. L. Zhu

    (Center for Research on Transportation, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montréal, Quebec H3C 3J7, Canada)

Abstract

The continuous dynamic network loading problem (CDNLP) consists in determining, on a congested network, time-dependent arc volumes, together with arc and path travel times, given the time-varying path flow departue rates over a finite time horizon. This problem constitutes an intrinsic part of the dynamic traffic assignment problem. In this paper, we present a formulation of the CDNLP where travel delays may be nonlinear functions of arc traffic volumes. We prove, under a boundedness condition, that there exists a unique solution to the problem and propose for its solution a finite-step algorithm. Some computational results are reported for a discretized version of the algorithm.

Suggested Citation

  • Y. W. Xu & J. H. Wu & M. Florian & P. Marcotte & D. L. Zhu, 1999. "Advances in the Continuous Dynamic Network Loading Problem," Transportation Science, INFORMS, vol. 33(4), pages 341-353, November.
    • Handle: RePEc:inm:ortrsc:v:33:y:1999:i:4:p:341-353
    DOI: 10.1287/trsc.33.4.341
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.33.4.341
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.33.4.341?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Terry L. Friesz & David Bernstein & Nihal J. Mehta & Roger L. Tobin & Saiid Ganjalizadeh, 1994. "Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems," Operations Research, INFORMS, vol. 42(6), pages 1120-1136, December.
    3. Anna Nagurney & Ding Zhang, 1997. "Projected Dynamical Systems in the Formulation, Stability Analysis, and Computation of Fixed-Demand Traffic Network Equilibria," Transportation Science, INFORMS, vol. 31(2), pages 147-158, May.
    4. Bin Ran & David E. Boyce & Larry J. LeBlanc, 1993. "A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models," Operations Research, INFORMS, vol. 41(1), pages 192-202, February.
    5. Terry L. Friesz & David Bernstein & Tony E. Smith & Roger L. Tobin & B. W. Wie, 1993. "A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem," Operations Research, INFORMS, vol. 41(1), pages 179-191, February.
    6. D. Zhang & A. Nagurney, 1997. "Formulation, Stability, and Computation of Traffic Network Equilibria as Projected Dynamical Systems," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 417-444, May.
    7. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    8. 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.
    9. 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.
    10. Wu, J. H. & Chen, Y. & Florian, M., 1998. "The continuous dynamic network loading problem: a mathematical formulation and solution method," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 173-187, April.
    11. Daganzo, Carlos F., 1995. "A finite difference approximation of the kinematic wave model of traffic flow," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 261-276, August.
    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. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
    2. 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.
    3. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2005. "A within-day dynamic traffic assignment model for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 39(1), pages 1-29, January.
    4. M Carey, 2009. "A framework for user equilibrium dynamic traffic assignment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(3), pages 395-410, March.
    5. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    6. Zhang, Ding & Nagurney, Anna & Wu, Jiahao, 2001. "On the equivalence between stationary link flow patterns and traffic network equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 731-748, September.
    7. Zhong, R.X. & Xie, X.X. & Luo, J.C. & Pan, T.L. & Lam, W.H.K. & Sumalee, A., 2020. "Modeling double time-scale travel time processes with application to assessing the resilience of transportation systems," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 228-248.
    8. N. Nezamuddin & Stephen Boyles, 2015. "A Continuous DUE Algorithm Using the Link Transmission Model," Networks and Spatial Economics, Springer, vol. 15(3), pages 465-483, September.
    9. Hongbo Ye & Hai Yang, 2017. "Rational Behavior Adjustment Process with Boundedly Rational User Equilibrium," Transportation Science, INFORMS, vol. 51(3), pages 968-980, August.
    10. Han, Sangjin, 2007. "A route-based solution algorithm for dynamic user equilibrium assignments," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1094-1113, December.
    11. 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.
    12. Nie, Xiaojian & Zhang, H.M., 2005. "Delay-function-based link models: their properties and computational issues," Transportation Research Part B: Methodological, Elsevier, vol. 39(8), pages 729-751, September.
    13. Ziyou Gao & Yunchao Qu & Xingang Li & Jiancheng Long & Hai-Jun Huang, 2014. "Simulating the Dynamic Escape Process in Large Public Places," Operations Research, INFORMS, vol. 62(6), pages 1344-1357, December.
    14. Carey, Malachy & Ge, Y. E., 2003. "Comparing whole-link travel time models," Transportation Research Part B: Methodological, Elsevier, vol. 37(10), pages 905-926, December.
    15. Rambha, Tarun & Boyles, Stephen D., 2016. "Dynamic pricing in discrete time stochastic day-to-day route choice models," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 104-118.
    16. Ran, Bin & Hall, Randolph W. & Boyce, David E., 1996. "A link-based variational inequality model for dynamic departure time/route choice," Transportation Research Part B: Methodological, Elsevier, vol. 30(1), pages 31-46, February.
    17. Wen-Long Jin, 2020. "Stable Day-to-Day Dynamics for Departure Time Choice," Transportation Science, INFORMS, vol. 54(1), pages 42-61, January.
    18. 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.
    19. Kumar, Amit & Peeta, Srinivas, 2015. "A day-to-day dynamical model for the evolution of path flows under disequilibrium of traffic networks with fixed demand," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 235-256.
    20. Carey, Malachy & Humphreys, Paul & McHugh, Marie & McIvor, Ronan, 2014. "Extending travel-time based models for dynamic network loading and assignment, to achieve adherence to first-in-first-out and link capacities," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 90-104.

    More about this item

    Statistics

    Access and download statistics

    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:inm:ortrsc:v:33:y:1999:i:4:p:341-353. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.