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

Consistent objectives and solution of dynamic user equilibrium models*

* This paper is a replication of an original study

Author

Listed:
  • Han, S.
  • Heydecker, B.G.

Abstract

The aim of this paper is to establish that there exist suitable objective functions for mathematical programming formulations of dynamic user equilibrium assignment in the sense of Wardrop (1952). Recently, Lin and Lo (2000) showed that we cannot necessarily calculate a dynamic user equilibrium assignment by minimising the integral over time of Beckmann's objective function that is widely used to solve for static user equilibrium assignment. In the present paper, two distinct objective functions are presented that result from formulations of assignment either as a variational inequality or as an infinitesimal optimisation: each of these formulations can be solved as a forward dynamic programme. With these formulations and solution approaches, we solve an example based upon Lin and Lo's one correctly.

Suggested Citation

  • Han, S. & Heydecker, B.G., 2006. "Consistent objectives and solution of dynamic user equilibrium models," Transportation Research Part B: Methodological, Elsevier, vol. 40(1), pages 16-34, January.
  • Handle: RePEc:eee:transb:v:40:y:2006:i:1:p:16-34
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(05)00008-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Chen, Huey-Kuo & Hsueh, Che-Fu, 1998. "A model and an algorithm for the dynamic user-optimal route choice problem," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 219-234, April.
    2. 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.
    3. Janson, Bruce N., 1991. "Dynamic traffic assignment for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 25(2-3), pages 143-161.
    4. Wie, Byung-Wook & Tobin, Roger L., 1998. "Dynamic congestion pricing models for general traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(5), pages 313-327, June.
    5. Stella Dafermos, 1982. "Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem," Transportation Science, INFORMS, vol. 16(2), pages 231-240, May.
    6. Daganzo, Carlos F., 1995. "Properties of link travel time functions under dynamic loads," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 95-98, April.
    7. 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.
    8. 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.
    9. Yang, Hai & Hai-Jun, Huang, 1997. "Analysis of the time-varying pricing of a bottleneck with elastic demand using optimal control theory," Transportation Research Part B: Methodological, Elsevier, vol. 31(6), pages 425-440, November.
    10. Han, Sangjin, 2003. "Dynamic traffic modelling and dynamic stochastic user equilibrium assignment for general road networks," Transportation Research Part B: Methodological, Elsevier, vol. 37(3), pages 225-249, March.
    11. Lin, Wei-Hua & Lo, Hong K., 2000. "Are the objective and solutions of dynamic user-equilibrium models always consistent?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 34(2), pages 137-144, February.
    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. 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.
    2. Bates, John, 2007. "Practical modelling of trip re-scheduling under congested conditions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 41(9), pages 788-801, November.
    3. Ban, Xuegang (Jeff) & Liu, Henry X. & Ferris, Michael C. & Ran, Bin, 2008. "A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations," Transportation Research Part B: Methodological, Elsevier, vol. 42(9), pages 823-842, November.

    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. 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.
    2. Li-Jun Tian & Hai-Jun Huang & Zi-You Gao, 2012. "A Cumulative Perceived Value-Based Dynamic User Equilibrium Model Considering the Travelers’ Risk Evaluation on Arrival Time," Networks and Spatial Economics, Springer, vol. 12(4), pages 589-608, December.
    3. 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.
    4. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.
    5. 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.
    6. Vo, Khoa D. & Lam, William H.K. & Chen, Anthony & Shao, Hu, 2020. "A household optimum utility approach for modeling joint activity-travel choices in congested road networks," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 93-125.
    7. Ban, Xuegang (Jeff) & Liu, Henry X. & Ferris, Michael C. & Ran, Bin, 2008. "A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations," Transportation Research Part B: Methodological, Elsevier, vol. 42(9), pages 823-842, November.
    8. 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.
    9. Wang, Yi & Szeto, W.Y. & Han, Ke & Friesz, Terry L., 2018. "Dynamic traffic assignment: A review of the methodological advances for environmentally sustainable road transportation applications," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 370-394.
    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. 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.
    12. Kachani, Soulaymane & Perakis, Georgia, 2006. "Fluid dynamics models and their applications in transportation and pricing," European Journal of Operational Research, Elsevier, vol. 170(2), pages 496-517, April.
    13. 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.
    14. Qixiu Cheng & Zhiyuan Liu & Feifei Liu & Ruo Jia, 2017. "Urban dynamic congestion pricing: an overview and emerging research needs," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 21(0), pages 3-18, August.
    15. Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.
    16. Xiaoning Zhang & H. Zhang, 2010. "Simultaneous Departure Time/Route Choices in Queuing Networks and a Novel Paradox," Networks and Spatial Economics, Springer, vol. 10(1), pages 93-112, March.
    17. Liu, Yang & Nie, Yu (Marco) & Hall, Jonathan, 2015. "A semi-analytical approach for solving the bottleneck model with general user heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 56-70.
    18. 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.
    19. 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.
    20. 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.

    Replication

    This item is a replication of:

    More about this item

    Lists

    This item is featured on the following reading lists, Wikipedia, or ReplicationWiki pages:
    1. Consistent objectives and solution of dynamic user equilibrium models (Transportation Research Part B: Methodological 2006) in ReplicationWiki

    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:eee:transb:v:40:y:2006:i:1:p:16-34. 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.