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

A cell-based simultaneous route and departure time choice model with elastic demand

Author

Listed:
  • Szeto, W. Y.
  • Lo, Hong K.

Abstract

This paper develops a cell-based formulation for the simultaneous route and departure time choice problem with elastic demands through a variational inequality problem (VIP). This formulation follows the ideal Dynamic User Optimal (DUO) route and departure time choice principle and encapsulates a network version of the cell transmission model to improve the accuracy of dynamic traffic modeling. To solve the formulation, we adopt a descent method developed for co-coercive VIP. Two numerical studies are set up to demonstrate the quality of the solutions. The results show that the formulation correctly determines the DUO solution even in the presence of queue spillback and junction blockage. In the analysis, we prove that the origin-destination (OD) first-in-first-out (FIFO) property is only maintained under certain conditions of the travel time and schedule delay costs. These conditions on the cost parameters are, interestingly, consistent with the empirical results. Thus, the theoretical analyses together with the empirical results indicate that OD FIFO should hold in reality. This finding is a reasonable reflection of our experience, which shows that OD FIFO generally holds subject to overtaking not occurring commonly.

Suggested Citation

  • Szeto, W. Y. & Lo, Hong K., 2004. "A cell-based simultaneous route and departure time choice model with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 593-612, August.
  • Handle: RePEc:eee:transb:v:38:y:2004:i:7:p:593-612
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(03)00092-4
    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. 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. Lo, Hong K. & Szeto, W. Y., 2002. "A cell-based variational inequality formulation of the dynamic user optimal assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 36(5), pages 421-443, June.
    3. 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.
    4. Wie, Byung-Wook & Tobin, Roger L. & Carey, Malachy, 2002. "The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 897-918, December.
    5. Small, Kenneth A, 1982. "The Scheduling of Consumer Activities: Work Trips," American Economic Review, American Economic Association, vol. 72(3), pages 467-479, June.
    6. Yang, Hai & Meng, Qiang, 1998. "Departure time, route choice and congestion toll in a queuing network with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 32(4), pages 247-260, May.
    7. Braid, Ralph M., 1989. "Uniform versus peak-load pricing of a bottleneck with elastic demand," Journal of Urban Economics, Elsevier, vol. 26(3), pages 320-327, November.
    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. Sang Nguyen & Clermont Dupuis, 1984. "An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs," Transportation Science, INFORMS, vol. 18(2), pages 185-202, May.
    10. Byung-Wook Wie & Roger L. Tobin & Terry L. Friesz & David Bernstein, 1995. "A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem," Transportation Science, INFORMS, vol. 29(1), pages 79-92, February.
    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. Han, Ke & Friesz, Terry L. & Szeto, W.Y. & Liu, Hongcheng, 2015. "Elastic demand dynamic network user equilibrium: Formulation, existence and computation," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 183-209.
    2. Jang, Wonjae & Ran, Bin & Choi, Keechoo, 2005. "A discrete time dynamic flow model and a formulation and solution method for dynamic route choice," Transportation Research Part B: Methodological, Elsevier, vol. 39(7), pages 593-620, August.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Zhi-Yang Lin & S. C. Wong & Peng Zhang & Keechoo Choi, 2018. "A Predictive Continuum Dynamic User-Optimal Model for the Simultaneous Departure Time and Route Choice Problem in a Polycentric City," Service Science, INFORMS, vol. 52(6), pages 1496-1508, December.
    8. Han, Ke & Szeto, W.Y. & Friesz, Terry L., 2015. "Formulation, existence, and computation of boundedly rational dynamic user equilibrium with fixed or endogenous user tolerance," Transportation Research Part B: Methodological, Elsevier, vol. 79(C), pages 16-49.
    9. Ke Han & Gabriel Eve & Terry L. Friesz, 2019. "Computing Dynamic User Equilibria on Large-Scale Networks with Software Implementation," Networks and Spatial Economics, Springer, vol. 19(3), pages 869-902, September.
    10. Zhong, R.X. & Sumalee, A. & Friesz, T.L. & Lam, William H.K., 2011. "Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1035-1061, August.
    11. 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.
    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. 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.
    14. 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.
    15. 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.
    16. Qipeng Zheng & Ashwin Arulselvan, 2011. "Discrete time dynamic traffic assignment models and solution algorithm for managed lanes," Journal of Global Optimization, Springer, vol. 51(1), pages 47-68, September.
    17. 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.
    18. 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.
    19. Rui Ma & Xuegang (Jeff) Ban & Jong-Shi Pang, 2018. "A Link-Based Differential Complementarity System Formulation for Continuous-Time Dynamic User Equilibria with Queue Spillbacks," Transportation Science, INFORMS, vol. 52(3), pages 564-592, June.
    20. 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.

    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:38:y:2004:i:7:p:593-612. 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.