On the holding-back problem in the cell transmission based dynamic traffic assignment models

Transportation Research Part B: Methodological

Volumn 46, Issue 9, 2012, Pages 1218-1238

  Doan, Kien ^a   Ukkusuri, Satish V ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Cell transmission model; Dynamic traffic assignment; Holding back; Network modeling; System optimal

Indexed keywords

RESEARCH; TRANSPORTATION;

CELL TRANSMISSION MODEL; DYNAMIC TRAFFIC ASSIGNMENTS; HOLDING BACKS; NETWORK MODELING; SYSTEM-OPTIMAL;

TRAFFIC CONTROL;

NUMERICAL MODEL; TRAFFIC MANAGEMENT; TRANSPORTATION SYSTEM;

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

References (28)

1. Beard C., Ziliaskopoulos A.K. System optimal signal optimization formulation. Transportation Research Record 2006, 1978:102-112.
2. Carey M., Subrahmanian E. An approach to modeling time-varying flows on congested networks. Transportation Research Part B 2000, 34(3):157-183.
3. Daganzo C.F. The cell transmission model: a simple dynamic representation of highway traffic. Transportation Research Part B 1994, 28(4):269-287.
4. Daganzo C.F. The cell transmission model, part II: network traffic. Transportation Research Part B 1995, 29(2):79-93.
5. Fletcher R., Leyffer S. Solving mathematical programs with complementarity constraints as nonlinear programs. Optimization Methods and Software 2004, 19(1):15-40.
6. 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.
7. Ho J.K. A successive linear optimization approach to the dynamic traffic assignment problem. Transportation Science 1980, 14(4):295-305.
8. Karoonsoontawong A., Waller S.T. Robust dynamic continuous network design problem. Transportation Research Record 2007, 2029:58-71.
9. Karoonsoontawong A., Waller S.T. Integrated network capacity expansion and traffic signal optimization problem: robust bi-level dynamic formulation. Networks and Spatial Economics 2010, 10(4):525-550.
10. Li Y., Ziliaskopoulos A.K., Waller S.T. Linear programming formulations for system optimum dynamic traffic assignment with arrival time-based and departure time-based demands. Transportation Research Record 1999, 1667:52-59.
11. Lin W.-H., Wang C. An enhanced 0-1 mixed-integer LP formulation for traffic signal control. IEEE Transactions on Intelligent Transportation Systems 2004, 5(4):238-245.
12. Liu Y., Lai X., Chang G.-L. Cell-based network optimization model for staged evacuation planning under emergencies. Transportation Research Record 2006, 1964:127-135.
13. Merchant D.K., Nemhauser G.L. A model and an algorithm for the dynamic traffic assignment problems. Transportation Science 1976, 12(3):183-199.
14. Nie Y.M. A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem. Transportation Research Part B 2011, 45(2):329-342.
15. Pavlis Y., Recker W. A mathematical logic approach for the transformation of the linear conditional piecewise functions of dispersion-and-store and cell transmission traffic flow models into linear mixed-integer form. Transportation Science 2009, 43(1):98-116.
16. Peeta S., Ziliaskopoulos A.K. Foundations of dynamic traffic assignment: the past, the present and the future. Network and Spatial Economics 2001, 1(3-4):233-265.
17. 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.
18. 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.
19. Scholtes S., Stohr M. How stringent is the linear independence assumption for mathematical programs with complementarity constraints?. Mathematics of Operations Research 2001, 26(4):851-863.
20. Shen W., Nie Y.M., Zhang H. Dynamic network simplex method for designing emergency evacuation plans. Transportation Research Record 2007, 2022:83-93.
21. Su, C.-L., 2005. Equilibrium problems with equilibrium constraints: stationarities, algorithm, and applications. Ph.D. thesis, Stanford University.
22. Ukkusuri S., Ramadurai G., Patil G. A robust transportation signal control problem accounting for traffic dynamics. Computers and Operations Research 2010, 37(5):869-879.
23. Ukkusuri S., 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.
24. Waller S.T., Mouskos K.C., Kamaryiannis D., Ziliaskopoulos A.K. A linear model for the continuous network design problem. Computer-aided Civil and Infrastructure Engineering 2006, 21(5):334-345.
25. Waller S.T., Ziliaskopoulos A.K. A chance-constrained based stochastic dynamic traffic assignment model: analysis, formulation and solution algorithms. Transportation Research Part C 2006, 14(6):418-427.
26. Zhang L., Yin Y., Lou Y. Robust signal timing for arterials under day-to-day demand variations. Transportation Research Record 2010, 2192:156-166.
27. Zheng H., Chiu Y.-C. A network flow algorithm for the cell-based single-destination system optimal dynamic traffic assignment problem. Transportation Science 2011, 45(1):121-137.
28. Ziliaskopoulos A.K. A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation Science 2000, 34(1):37-49.