Skip to main content
SpringerLink
Log in

Simultaneous Departure Time/Route Choices in Queuing Networks and a Novel Paradox

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

In this paper, we establish an exact expression of the dynamic traffic assignment (DTA) problem with simultaneous departure time and route (SDR) choices in transportation networks with bottlenecks, where both link and path capacities are time-dependent. Using this expression, closed form of dynamic user equilibrium solutions can be obtained in some special networks. Furthermore, we investigate the DTA-SDR problem in the classical Braess’s network with closed form equilibrium solutions. The explicit results show that an inappropriately added new link could deteriorate the existing network in terms of the increase of individual and system travel costs. The mechanism of this new paradox is quite different from that of the previously discovered ones, and it is the first paradox caused by the simultaneous departure time/route competitions among individuals.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Akamatsu T (2000) A dynamic traffic equilibrium assignment paradox. Transp Res 34B:515–531

    Article  Google Scholar 

  • Akamatsu T (2001) An efficient algorithm for dynamic traffic equilibrium assignment with queues. Transp Sci 35:389–404

    Article  Google Scholar 

  • Arnott R, Small K (1994) The economics of traffic congestion. Am Sci 82:446–455

    Google Scholar 

  • Arnott R, Palma AD, Lindsey R (1993) Properties of dynamic traffic equilibrium involving bottlenecks, including a paradox and metering. Transp Sci 27:148–160

    Article  Google Scholar 

  • Ben-Akiva M, Bierlaire M, Koutsopoulos H, Mishalani R (1998) Dynamit: a simulation-based system for traffic prediction. Paper presented at the DACCORD short-term forecasting workshop, Delft, The Netherlands

  • Braess D (1968) Uber ein paradoxen der verkehrsplaning. Unternehmensforschung 12:258–268

    Article  Google Scholar 

  • Carey M (1986) A constraint qualification for a dynamic traffic assignment model. Transp Sci 20:55–58

    Article  Google Scholar 

  • Carey M (1987) Optimal time-varying flows on congested networks. Oper Res 35:58–69

    Article  Google Scholar 

  • Chen H-K, Hsueh C-F (1998) A model and an algorithm for the dynamic user optimal route choice problem. Transp Res 32B:219–234

    Article  Google Scholar 

  • Daganzo C (1996) Two paradoxes of traffic flow on networks with physical queues. II Symposium Ingenieria de los Transportes. Madrid, 22–24 May 1996, pp 55–62

  • Daganzo C (1998) Queue spillovers in transportation networks with a route choice. Transp Sci 32:3–11

    Article  Google Scholar 

  • Friesz TL, Bernstein D, Smith TE, Tobin RL, Wie BW (1993) A variational inequality formulation of the dynamic network user equilibrium problem. Oper Res 41:179–191

    Article  Google Scholar 

  • Heydecker BG, Addison JD (1996) An exact expression of dynamic traffic equilibrium. In Lesort J-B (ed) Proceeding of 13th international. Symposium on transportation and traffic theory. Elsevier, pp 359–383

  • Heydecker BG, Addison JD (2005) Analysis of dynamic traffic equilibrium with departure time choice. Transp Sci 39(1):39–57

    Article  Google Scholar 

  • Huang HJ, Lam WHK (2002) Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues. Transp Res 36B:253–273

    Article  Google Scholar 

  • Hurdle VF (1974) The effect of queuing on traffic assignment in a simple road network. In Proceedings of the 6th international symposium on transportation and traffic theory, Elsevier Science, Amsterdam, The Netherlands, pp 519–540

  • Janson BN (1991) Dynamic traffic assignment for urban road networks. Transp Res 25B:143–161

    Article  Google Scholar 

  • Janson BN, Robles J (1995) A quasi-continuous dynamic traffic assignment model. Transp Res Rec 1493:199–206

    Google Scholar 

  • Jayakrishnan R, Hu HSMTU (1994) An evaluation tool for advanced traffic information and management systems in urban networks. Transp Res 2C:129–147

    Google Scholar 

  • Lo HK, Szeto WY (2002) A cell-based variational inequality formulation of the dynamic user optimal assignment problem. Transp Res 36B:421–443

    Article  Google Scholar 

  • Luque FJ, Friesz TL (1980) Dynamic traffic assignment considered as a continuous time optimal control problem. In: Paper presented at the TIMS/ORSA Joint National Meeting. May 5–7

  • Mahmassani H, Sbayti H, Chiu Y (2002) Dynasmart-p version 0.930.0 user’s guide, Technical report, Maryland Transportation Initiative, University of Maryland

  • Merchant DK, Nemhauser GL (1978a) A model and an algorithm for the dynamic traffic assignment problems. Transp Sci 12:183–199

    Article  Google Scholar 

  • Merchant DK, Nemhauser GL (1978b) Optimality conditions for a dynamic traffic assignment model. Transp Sci 12:200–207

    Article  Google Scholar 

  • Pas EI, Principio SL (1997) Braess’s paradox: some new insights. Transp Res 31B:265–276

    Article  Google Scholar 

  • Penchina CM (1997) Braess paradox: maximum penalty in a minimal critical network. Transp Res 31A:379–388

    Google Scholar 

  • Ran B, Boyce D (1996) A link-based variational inequality formulation of ideal dynamic user optimal route choice problem. Transp Res 4C:1–12

    Google Scholar 

  • Ran B, Hall RW, Boyce D (1996) A link-based variational inequality model for dynamic departure time/route choice. Transp Res 30B:31–46

    Article  Google Scholar 

  • Small KA (1982) The scheduling of consumer activities: work trips. Am Econ Rev 72:467–479

    Google Scholar 

  • Smith MJ (1993) A new dynamic traffic model and the existence and calculation of dynamic user equilibrium on congested capacity-constrained road networks. Transp Res 27B:49–63

    Article  Google Scholar 

  • Szeto WY, Lo HK (2004) A cell-based simultaneous route and departure time choice model with elastic demand. Transp Res 38B:593–612

    Article  Google Scholar 

  • Wie BW, Friesz TL, Tobin RL (1990) Dynamic user optimal traffic assignment on congested multi-destination networks. Transp Res 24B:431–442

    Article  Google Scholar 

  • Wie BW, Tobin RL, Carey M (2002) The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation. Transp Res 36B:897–918

    Article  Google Scholar 

  • Yagar S (1970) Analysis of the Peak Period Travel in a Freeway-Arterial Corridor. Ph.D. Dissertation, University of California, Berkeley

  • Yagar S (1971) Dynamic traffic assignment by individual path minimization and queueing. Transp Res 5:179–196

    Article  Google Scholar 

  • Yagar S (1974) Emulation of dynamic equilibrium in traffic networks. In Florian MA (ed) Traffic equilibrium methods, Lecture notes in economics and mathematical systems, volume 118, Springer-Verlag

  • Yang H (1997) Sensitivity analysis for the elastic-demand network equilibrium problem with applications. Transp Res 31B:55–70

    Article  Google Scholar 

  • Yang H, Bell MGH (1998) A capacity paradox in network design and how to avoid it. Transp Res 32A:539–545

    Google Scholar 

  • Zhang XN, Zhang HM (2005) Paradoxes of network expansion considering dynamic user response. Transportation research board 84th annual meeting. Washington D.C., 12–16 January 2005

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai, 200092, People’s Republic of China

    Xiaoning Zhang & H. M. Zhang

  2. Department of Civil and Environment Engineering, University of California, Davis, CA, 95616, USA

    H. M. Zhang

Authors
  1. Xiaoning Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. M. Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoning Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, X., Zhang, H.M. Simultaneous Departure Time/Route Choices in Queuing Networks and a Novel Paradox. Netw Spat Econ 10, 93–112 (2010). https://doi.org/10.1007/s11067-007-9026-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-007-9026-7

Keywords

Search

Navigation