Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions

Networks and Spatial Economics

Volumn 8, Issue 4, 2008, Pages 383-406

  Ukkusuri, Satish V ^a   Waller, S Travis ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

Dynamic traffic assignment; Equilibrium; Linear programming; Network design; Recourse; Stochastic programming; Transportation networks

Indexed keywords

CELL TRANSMISSION MODEL; DYNAMIC SYSTEM OPTIMAL; DYNAMIC TRAFFIC ASSIGNMENTS; DYNAMIC USER EQUILIBRIUM; LINEAR PROGRAMMING MODELS; NETWORK DESIGN; RECOURSE; TRANSPORTATION NETWORK;

OPTIMIZATION; PHASE EQUILIBRIA; STOCHASTIC PROGRAMMING; TRAFFIC CONTROL;

LINEAR PROGRAMMING;

EID: 53349141490     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-007-9019-6     Document Type: Article

References (29)

1. Abdulaal M, LeBlanc LJ (1979) Continuous equilibrium network design models. Transp Res 13B:19-32
2. Birge JR, Ho JK (1993) Optimal flows in stochastic dynamic networks with congestion. Oper Res 41:203-216
3. Birge JR, Louveaux K (1997) Introduction to stochastic programming. Springer, Berlin Heidelberg New York
4. Daganzo CF (1994) The cell transmission model: A simple dynamic representation of highway traffic consistent with the hydrodynamic theory. Transp Res 28B(4):269-287
5. Daganzo CF (1995) The cell transmission model, part II: Network traffic. Transp Res 29B(2):79-93
6. Davis GA (1994) Exact local solution of the continuous network design problem via stochastic user equilibrium assignment. Transp Res 28B:61-75
7. Friesz T, Cho H, Mehta N, Tobin R, Anandalingam G (1992) A simulated annealing approach to the network design problem with variational inequality constraints. Transp Sci 26:18-25
8. Golani H, Waller ST (2004) A combinatorial approach for multi-destination dynamic traffic assignment. Transp Res Rec no. 1882 and Journal of the Transportation Research Board 70-78
9. Heydecker B (2002) Dynamic equilibrium network design. In: Taylor MP (ed) Proc. 15th ISTTT conference. Pergamon, Adelaide, pp 349-369
10. Higle JL, Sen S (1999) An introductory tutorial on stochastic linear programming models. Interfaces 29:33-61
11. Janson BN (1995) Network design effects of dynamic traffic assignment. J Transp Eng 121(1):1-13
12. Jeon K, Ukkusuri SV, Waller ST (2006) Selectorecombinative genetic algorithm to relax computational complexity of discrete network design problem. Journal of the Transportation Research Board, no. 1964. Transportation Research Board of the National Academies, Washington, D.C., pp 91-103
13. Karoonsoontawong A, Waller ST (2006) A comparison of system- and user-optimal stochastic dynamic network design models using Monte Carlo bounding techniques. Journal of Transportation Research Board 91-102
14. LeBlanc LJ, Boyce D (1986) A bi-level programming algorithm for the exact solution of the network design problem with user-optimal traffic flows. Transp Res 20B:259-265
15. Li Y, Waller ST, Ziliaskopoulos AK (2003) A decomposition method for system-optimal dynamic traffic assignment. Networks and Spatial Economics 3(4):441-456
16. Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18:1-55
17. Mahmassani HS (1984) Uncertainty in transportation system evaluation: issues and approaches. Transp Plan Technol 9(1):1-12
18. Mahmassani HS, Peeta S, Hu TY, Ziliaskopoulos AK (1993) Dynamic traffic assignment with multiple user classes for real-time ATIS/ATMS applications. Proc. advanced traffic management conference. FHWA, US DOT, Washington DC, pp 91-114
19. Marcotte P (1983) Network optimization with continuous control parameters. Transp Sci 17:181-197
20. Mouskos K (1992) A taboo-search based approach for network design. Ph.D. Dissertation, The University of Texas at Austin, Austin, TX
21. Nguyen S, Dupis C (1984) An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transp Sci 18:185-202
22. Peeta S, Ziliaskopoulos A (2001) Foundations of dynamic traffic assignment: The past, the present and the future. Networks and Spatial Economics 1(3/4):233-266
23. Suwansirikul C, Friesz TL, Tobin RL (1987) Equilibrium decomposed optimization: A heuristic for the continuous equilibrium network design problem. Transp Sci 21:254-263
24. Tzeng GH, Tsaur (1997) Application of multiple criteria decision making for network improvement plan model. J Adv Transp 31:48-74
25. Ukkusuri S (2002) Linear programs for user optimal dynamic traffic assignment problem. Master's thesis, University of Illinois at Urbana Champaign
26. Waller ST, Ziliaskopoulos AK (2001) A dynamic and stochastic approach to network design. Journal of the Transportation Research Board, no. 1771, 106-114
27. Waller ST, Ziliaskopoulos A (2006) A combinatorial user optimal dynamic traffic assignment algorithm. Ann Oper Res ISSN: 0254-5330, 1572-9338
28. Yang H, Bell MGH (1998) Models and algorithms for road network design: A review and some new developments. Transp Rev 18:257-278
29. Ziliaskopoulos AK (2000) A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transp Sci 34(1):37-49