zbMATH — the first resource for mathematics

A continuous DUE algorithm using the link transmission model. (English) Zbl 1338.90114
Summary: This paper describes a continuous-flow, continuous-time model for which a dynamic Wardrop equilibrium provably exists. This formulation is general, but is particularly designed to include the link and node models of Yperman’s Link Transmission Model as a special case. Rather than using path flows to describe route choice, travelers are aggregated by destination and node-specific routing parameters are used to reduce the number of control variables needed. Furthermore, this formulation allows efficient solution methods from static traffic assignment, such as Linear User Cost Equilibrium (LUCE), to be applied in a fairly straightforward manner. Demonstrations on a small network verify the effectiveness of this dynamic LUCE algorithm in our model, showing favorable performance comapred to the method of successive averages.

90B20 Traffic problems in operations research
91A80 Applications of game theory
91A43 Games involving graphs
Full Text: DOI
[1] Astarita, V; Lesort, J-B (ed.), A continuous link time model for dynamic network loading based on travel time function, 79-102, (1996), Oxford
[2] Ban, XJ; Liu, HX; Ferris, MC; Ran, B, A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations, Transp Res B, 42, 823-842, (2008)
[3] Ban, XJ; Pang, J-S; Liu, HX; Ma, R, Modeling and solving continuous-time instantaneous dynamic user equilibria: a differential complementarity systems approach, Transp Res B, 46, 389-408, (2012)
[4] Bar-Gera, H, Continuous and discrete trajectory models for dynamic traffic assignment, Netw Spat Econ, 5, 41-70, (2005) · Zbl 1081.90007
[5] Bar-Gera, H; Boyce, D, Solving a non-convex combined travel forecasting model by the method of successive averages with constant step sizes, Transp Res B, 40, 351-367, (2006)
[6] Bliemer, MCJ; Bovy, PHL, Quasi-variational inequality formulation of the multiclass dynamic traffic assignment problem, Transp Res B, 37, 501-519, (2003)
[7] Blumberg, M; Bar-Gera, H, Consistent node arrival order in dynamic network loading models, Transp Res B, 43, 285-300, (2009)
[8] Carey, M, Nonconvexity of the dynamic assignment problem, Transp Res B, 26, 127-133, (1992)
[9] Chiu Y-C, Bottom J, Mahut M, Paz A, Balakrishna R, Waller T, Hicks J (2010) A primer for dynamic traffic assignment. Prepared by the Transportation Network Modeling Committee of the Transportation Research Board (ADB30)
[10] Daganzo, CF, The cell transmission model: a dynamic representation of highway traffic consistent with the hydrodynamic theory, Transp Res B, 28, 269-287, (1994)
[11] Daganzo, CF, The cell transmission model, part II: network traffic, Transp Res B, 29, 79-93, (1995)
[12] Fan, K, Fixed-point and minimax theorems in locally convex topological linear spaces, Proc Natl Acad Sci USA, 38, 121-126, (1952) · Zbl 0047.35103
[13] Friesz, T; Bernstein, D; Smith, TE; Tobin, RL; Wie, BW, A variational inequality formulation of the dynamic network user equilibrium problem, Oper Res, 41, 179-191, (1993) · Zbl 0771.90037
[14] Friesz, T; Luque, J; Tobin, R; Wie, B, Dynamic network traffic assignment considered as a continuous time optimal control problem, Oper Res, 37, 893-901, (1989) · Zbl 0691.49029
[15] Friesz, TL; Han, K; Neto, PA; Meimand, A; Yao, T, Dynamic user equilibrium based on a hydrodynamic model, Transp Res B, 47, 102-126, (2013)
[16] Friesz, TL; Kim, T; Kwon, C; Rigdon, MA, Approximate network loading and dual-time-scale dynamic user equilibrium., Transp Res B, 45, 176-207, (2011)
[17] Gentile G (2009) Linear User Cost Equilibrium: a new algorithm for traffic assignment. Working paper
[18] Gentile G (2010) The general link transmission model for dynamic network loading and a comparison with the DUE algorithm. In: Immers LGH, Tampere CMJ, Viti F (eds)New developments in transport planning advances in dynamic traffic assignment. Edward Elgar Publishing · Zbl 0046.12103
[19] Glicksberg, IL, A further generalization of the Kakutani fixed point theorem, with application to Nash equilibrium, Proc Am Math Soc, 3, 170-174, (1952) · Zbl 0046.12103
[20] Iryo T (2013) Investigating factors for existence of multiple equilibria in dynamic traffic network. Accepted for publication in Networks and Spatial Economics. http://link.springer.com/article/10.1007/s11067-013-9206-6
[21] Janson, BN; Robles, J, Quasi-continuous dynamic traffic assignment model, Transp Res Rec, 1493, 199-206, (1995)
[22] Kakutani, S, A generalization of brouwer’s fixed point theorem, Duke Math J, 8, 457-459, (1941) · Zbl 0061.40304
[23] Lighthill, MJ; Whitham, GB, On kinematic waves II. A theory of traffic flow on long crowded roads, Proc R Soc A, 229, 314-345, (1955) · Zbl 0064.20906
[24] Long, J; Huang, H-J; Gao, Z; Szeto, WY, An intersection-movement-based dynamic user optimal route choice problem, Oper Res, 61, 1134-1147, (2011) · Zbl 1291.90038
[25] Merchant, D; Nemhauser, G, A model and an algorithm for the dynamic traffic assignment problems, Transp Sci, 12, 183-199, (1978)
[26] Merchant, D; Nemhauser, G, Optimality conditions for a dynamic traffic assignment model, Transp Sci, 12, 200-207, (1978)
[27] Mounce, R, Convergence in a continuous dynamic queueing model for traffic networks, Transp Res B, 40, 779-791, (2006)
[28] Newell, GF, A simplified theory of kinematic waves in highway traffic, part I: general theory, Transp Res B, 27, 281-287, (1993)
[29] Newell, GF, A simplified theory of kinematic waves in highway traffic, part II: queueing at freeway bottlenecks, Transp Res B, 27, 289-303, (1993)
[30] Newell, GF, A simplified theory of kinematic waves in highway traffic, part III: multi-destination flows, Transp Res B, 27, 305-313, (1993)
[31] Nezamuddin (2011) Improving the efficiency of dynamic traffic assignment through computational methods based on combinatorial algorithm. Ph.D. thesis, The University of Texas at Austin
[32] Nie, Y, A note on bar-gera’s algorithm for the origin-based traffic assignment problem, Transp Sci, 46, 27-38, (2012)
[33] Nie, YM, Equilibrium analysis of macroscopic traffic oscillations, Transp Res B, 44, 62-72, (2010)
[34] Peeta, S; Ziliaskopoulos, AK, Foundations of dynamic traffic assignment: the past, the present, and the future, Netw Spat Econ, 1, 233-265, (2001)
[35] Qian, Z(S); Zhang, HM, A hybrid route choice model for dynamic traffic assignment, Netw Spat Econ, 13, 183-203, (2013) · Zbl 1332.90068
[36] Ramadurai, G; Ukkusuri, SV, B-dynamic: an efficient algorithm for dynamic user equilibrium assignment in activity-travel networks, Comput Aided Civ Infrastruct Eng, 26, 254-269, (2011)
[37] Ran, B; Boyce, DE, A link-based variational inequality formulation of ideal dynamic user-optimal route choice problem, Transp Res C, 4, 1-12, (1996)
[38] Ran, B; Boyce, DE; LeBlanc, LJ, A new class of instantaneous dynamic user-optimal traffic assignment models, Oper Res, 41, 192-202, (1993) · Zbl 0771.90039
[39] Ran, B; Hall, RW; Boyce, DE, A link-based variational inequality model for dynamic departure time/route choice, Transp Res B, 30, 31-46, (1996)
[40] Tampère, CMJ; Corthout, R; Cattrysse, D; Immers, LH, A generic class of first order node models for dynamic macroscopic simulation of traffic flows, Transp Res B, 45, 289-309, (2011)
[41] Waller, ST; Fajardo, D; Duell, M; Dixit, V, Linear programming formulation for strategic dynamic traffic assignment, Netw Spat Econ, 13, 427-443, (2013) · Zbl 1332.90161
[42] Wie BW (1991) Dynamic analysis of user optimized network flows with elastic travel demand. Presented at the 70th Annual Meeting of the Transportation Research Board, Washington, DC · Zbl 0771.90039
[43] Wie, B-W; Tobin, RL; Carey, M, The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation, Transp Res B, 36, 897-918, (2002)
[44] Yperman I (2007) The link transmission model for dynamic newtork loading. Ph.D. thesis, Katholieke Universiteit Leuven, Belgium · Zbl 1332.90068
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.