Dynamic user equilibrium with a path based cell transmission model for general traffic networks

Transportation Research Part B: Methodological

Volumn 46, Issue 10, 2012, Pages 1657-1684

  Ukkusuri, Satish V ^a   Han, Lanshan ^a   Doan, Kien ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Cell transmission model; Departure time choice; Dynamic user equilibrium; Holding back; Projection method; Variational inequality

Indexed keywords

NUMERICAL ANALYSIS; TRANSPORTATION;

CELL TRANSMISSION MODEL; DEPARTURE TIME CHOICE; DYNAMIC USER EQUILIBRIUM; HOLDING BACKS; PROJECTION METHOD; VARIATIONAL INEQUALITIES;

VARIATIONAL TECHNIQUES;

ALGORITHM; NUMERICAL MODEL; TRAFFIC CONGESTION; TRANSPORTATION SYSTEM; VARIANCE ANALYSIS;

EID: 84868230122     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2012.07.010     Document Type: Article

References (32)

1. ADB30, T., 2010. A Primer for Dynamic Traffic Assignment. Transportation Network Modeling Committee.
2. Alecsandru, C., Quddus, A., 2011. An Assessment of the Cell-Transmission Traffic Flow Paradigm: Development and Applications. In: Submitted for presentation at Transportation Research Board 90th Annual Meeting.
3. Arnott R., de Palma A., Lindsey R. A structural model of peak-period congestion: a traffic bottleneck with elastic demand. The American Economic Review 1993, 83(1):161-179.
4. Arnott R., de Palma A., Lindsey R. A welfare congestion tolls with heterogenous commuters. Journal of Transportation Economics and Policy 1994, 28(2):139-161.
5. Ban X.J., Liu H.X., Ferris M.C., Ran B. A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations. Transportation Research Part B 2008, 42(9):823-842.
6. Carey M. Optimal time varying flows on congested network. Operation Research 1987, 35(1):58-69.
7. Carey M. Nonconvexity of the dynamic traffic assignment problem. Transportation Research Part B 1992, 26(2):127-133.
8. Daganzo C.F. The cell transmission model: a simple dynamic representation of highway traffic. Transportation Research Part B 1994, 28(4):269-287.
9. Daganzo C.F. The cell transmission model, part ii: network traffic. Transportation Research Part B 1995, 29(2):79-93.
10. Doan, K., Ukkusuri, S.V., 2012. On the holding-back problem in the cell transmission based dynamic traffic assignment models. Transportation Research Part B, http://dx.doi.org/10.1016/j.trb.2012.05.001.
11. Doan K., Ukkusuri S., Han L. On the existence of pricing strategies in the discrete time heterogeneous single bottleneck model. Transportation Research Part B 2011, 45(9):1483-1500.
12. Facchinei F., Pang J.-S. Finite-Dimensional Variational Inequalities and Complementarity Problems 2003, Springer-Verlag, New York.
13. Fang S., Perterson E. Generalized variational inequalities. Journal of Optimization Theory and Applications 1982, 38(3):363-383.
14. Friesz T.L., Luque J., Tobin R.L., Wie B.-W. Dynamic network traffic assignment considered as a continuous time optimal control problem. Operations Research 1989, 37(6):893-901.
15. Han L., Ukkusuri S.V., Doan K. Complementarity formulations for the cell transmission model based dynamic user equilibrium with departure time choice, elastic demand and user heterogeneity. Transportation Research Part B 2011, 45(10):1749-1767.
16. Hendrickson C., Kocur G. Schedule delay and departure time decisions in a deterministic model. Transportation Science 1981, 15(1):62-77.
17. Lo H.K., Szeto W. A cell-based dynamic traffic assignment model-formulation and properties. Mathematical and Computer Modeling 2002, 35(7-8):849-865.
18. Lo H.K., Szeto W. A cell-based variational inequality formulation of the dynamic user optimal assignment problem. Transportation Research Part B 2002, 36(5):421-443.
19. Merchant D.K., Nemhauser G.L. A model and an algorithm for the dynamic traffic assignment problems. Transportation Science 1978, 12(3):183-199.
20. Newell G. The morning commute for nonidentical travellers. Transportation Science 1987, 21(2):74-88.
21. Nguyen S., Dupuis C. An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transportation Science 1984, 18(2):120-185.
22. Nie Y.M. A cell-based merchantnemhauser model for the system optimum dynamic traffic assignment problem. Transportation Research Part B 2011, 45(2):329-342.
23. Nie Y.M., Zhang H.M. Solving the dynamic user optimal assignment problem considering queue spillback. Net 2010, 10(1):49-71.
24. Ramadurai, G., 2009. Novel dynamic user equilibrium models: analytical formulations, multi-dimensional choice, and an efficient algorithm. Ph.D. thesis. Department of civil and environmental engineering, Rensselaer Polytechnic Institute, Troy, NY.
25. Ramadurai G., Ukkusuri S.V., Zhao S., Pang J.-S. Linear complementarity formulation for single bottleneck model with heterogeneous commuters. Transportation Research Part B 2010, 44(2):193-214.
26. Ran B., Boyce D.E., LeBlanc L.J. A new class of instantaneous dynamic user-optimal traffic assignment models. Operations Research 1993, 41(1):192-202.
27. Szeto W., Lo H.K. A cell-based simultaneous route and departure time choice model with elastic demand. Transportation Research Part B 2004, 38(7):593-612.
28. Ukkusuri S.V., Waller S.T. Linear programming models for the user optimal and system optimal network design problem: formulations, comparisons and extensions. Networks and Spatial Economics 2008, 8(4):383-406.
29. Verhoef E.T., Small K.A. Product differentiation on roads: constrained congestion pricing with heterogeneous users. Journal of Transport Economics and Policy 2004, 38(1):127-156.
30. Vickrey W.S. Congestion theory and transport investment. The American Economic Review 1969, 59(2):251-261.
31. Wu J.H., Chen Y., Florian M. The continuous dynamic network loading problem: a mathematical formulation and solution method. Transportation Research Part B 1998, 32(3):173-187.
32. Ziliaskopoulos A.K. A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation Science 2000, 34(1):37-49.