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

A model and an algorithm for the dynamic user-optimal route choice problem

Author

Listed:
  • Chen, Huey-Kuo
  • Hsueh, Che-Fu

Abstract

This paper formulates a discrete-time, link-based dynamic user-optimal route choice problem using the variational inequality approach. The proposed model complies with the dynamic user-optimal equilibrium condition in which for each origin-destination pair, the actual travel time experienced by travelers departing during the same interval is equal and minimal. A nested diagonalization procedure is then proposed and demonstrated with a numerical example.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:32:y:1998:i:3:p:219-234
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(97)00026-X
    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. Byung-Wook Wie & Roger L. Tobin & Terry L. Friesz, 1994. "The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time," Transportation Science, INFORMS, vol. 28(3), pages 204-220, August.
    2. 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.
    3. Wie, Byung-Wook & Friesz, Terry L. & Tobin, Roger L., 1990. "Dynamic user optimal traffic assignment on congested multidestination networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 431-442, December.
    4. Carey, Malachy, 1992. "Nonconvexity of the dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 26(2), pages 127-133, April.
    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. 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).
    7. Janson, Bruce N., 1991. "Dynamic traffic assignment for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 25(2-3), pages 143-161.
    8. 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).
    9. 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.
    10. 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.
    11. Malachy Carey, 1986. "A Constraint Qualification for a Dynamic Traffic Assignment Model," Transportation Science, INFORMS, vol. 20(1), pages 55-58, February.
    12. 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)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Ran, Bin & Boyce, David E., 1995. "Ideal Dynamic User-Optimal Route Choice: A Link-Based Variational Inequality Formulation," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3t4686x6, Institute of Transportation Studies, UC Berkeley.
    6. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.
    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. 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.
    9. 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.
    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. 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.
    12. Friesz, Terry L. & Kim, Taeil & Kwon, Changhyun & Rigdon, Matthew A., 2011. "Approximate network loading and dual-time-scale dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 176-207, January.
    13. Li, Jun & Fujiwara, Okitsugu & Kawakami, Shogo, 2000. "A reactive dynamic user equilibrium model in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 605-624, November.
    14. 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.
    15. 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.
    16. 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).
    17. 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.
    18. Li, Xue-yan & Li, Xue-mei & Yang, Lingrun & Li, Jing, 2018. "Dynamic route and departure time choice model based on self-adaptive reference point and reinforcement learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 77-92.
    19. 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.
    20. 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.

    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:eee:transb:v:32:y:1998:i:3:p:219-234. 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.