Dynamic user equilibrium traffic assignment on congested multidestination network

Journal of Transportation Engineering

Volumn 130, Issue 2, 2004, Pages 211-221

  Varia, H R ^a   Dhingra, S L ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Equilibrium; Simulation; Traffic assignment; Traffic congestion; Transportation networks

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATHEMATICAL MODELS; ROADS AND STREETS;

DYNAMIC USER EQUILIBRIUM (DUE); TRAFFIC FLOWS;

TRAFFIC SURVEYS;

ROAD TRANSPORT;

EID: 1842532260     PISSN: 0733947X     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-947X(2004)130:2(211)     Document Type: Article

References (31)

1. Abdelfatah, A. S., and Mahmassani, H. S. (1998). "System optimal time-dependent path assignment and signal timing in traffic network." Transportation Research Record 1645, Transportation Research Board, Washington, D.C., 185-193.
2. Ben-Akiva, M., Palma, A., and Kanaroglou, P. (1986). "Dynamic model of peak period traffic congestion with elastic arrival rates." Transp. Sci., 20, 164-181.
3. Breheret, L., Hounsell, N. B., and McDonald, M. (1990). "The simulation of route guidance and traffic incidents." Proc., 22nd Annual Universities Transport Studies Group Conf., Universities Transport Studies Group, Hatfield, U.K.
4. Carey, M. (1986). "A constraint qualification for a dynamic traffic assignment model." Transp. Sci., 20, 55-58.
5. Carey, M. (1987). "Optimal time-varying flows on congested networks." Oper. Res., 35, 58-69.
6. Chabini, I. (2001). "Analytical dynamic network loading problem-formulation, solution algorithms, and computer implementations." Transportation Research Record 1771, Transportation Research Board, Washington, D.C., 191-200.
7. Friesz, T. L., Bernstain, D., Smith, T. E., Tobin, R. L., and Wie, B. W. (1993). "A variational inequality formulation of the dynamic network user equilibrium problem." Oper. Res., 41, 179-191.
8. Friesz, T. L., Luque, J., Tobin, R. L., and Wie, B. W. (1989). "Dynamic network traffic assignment considered as a continuous time optimal control problem." Oper. Res., 37, 893-901.
9. Goldberg, D. E. (1989). Genetic algorithm in search, optimization, and machine learning, Addison-Wesley, Reading, Mass.
10. Ha, D. I., Jung, J. H., and Baik, H. (1994). "An application of the simulation model to evaluate dynamic route guidance systems." Proc., 1994 Korea-SA Symposium on IVHS and GIS-T, Seoul, Korea.
11. Hounsell, N. B., McDonald, M., and Breheret, L. (1991). "Models and strategies for dynamic route guidance." Advanced telematics in road transport, Elsevier, Brussels, Belgium, 89-98.
12. Janson, B. N. (1991). "Dynamic traffic assignment for urban road networks." Transp. Res. Part B: Methodol., 25, 143-161.
13. Jaykrishnan, R., Tsai, W. K., and Chen, A. (1995). "A dynamic traffic assignment model with traffic-flow relationships." Transp. Res. Part C, 3(1), 51-72.
14. Lam, W. H. K., and Huang, H. J. (1995). "Dynamic user optimal traffic assignment model for many to one travel demand." Transp. Res. Part B: Methodol., 29, 243-259.
15. Leonard, D. R., Gower, P., and Taylor, N. B. (1989). "CONTRAM: structure of the model." Rep. RR178, Transport and Road Research Laboratory, Crowthorne, U.K.
16. Lo, H. K., and Szeto, W. Y. (2002). "A cell-based variational inequality formulation of the dynamic user optimal assignment problem." Transp. Res. Part B: Methodol., 36, 421-443.
17. Mahmassani, H. S., Hu, T. Y., and Jayakrishnan, R. (1992). "Dynamic traffic assignment and simulation for advanced network informatics (DYNASMART)." Proc., 2nd Int. Capri Seminar on Urban Traffic Networks, Capri, Italy.
18. Merchant, D. K., and Nemhauser, G. L. (1978a). "A model and an algorithm for the dynamic traffic assignment problems." Transp. Sci., 12, 183-199.
19. Merchant, D. K., and Nemhauser, G. L. (1978b). "Optimality conditions for a dynamic traffic assignment model." Transp. Sci., 12, 200-207.
20. Mumbai Metro Planning Group (MMPG). (1997). "Techno-economic feasibility study of construction of Mumbai metro study." Draft Rep. Prepared for Government of Maharashtra, Mumbai, India.
21. Peeta, S., and Ziliaskopoulos, A. K. (2001). "Foundations of dynamic traffic assignment: the past, the present, and the future." Netw. Spatial Econ., 1(3-4), 233-265.
22. Ran, B., Hall, R. W., and Boyce, D. E. (1996). "A link-based variational inequality model for dynamic departure time/path choice." Transp. Res. Part B: Methodol., 30, 31-46.
23. Sadek, A. W., Smith, B. L., and Demetsky, M. (1998). "Dynamic traffic assignment-genetic algorithms approach." Transportation Research Record 1588, Transportation Research Board, Washington, D.C., 95-103.
24. Sheffi, Y. (1985). Urban transportation networks: equilibrium analysis with mathematical programming methods, Prentice-Hall, Englewood Cliffs, N.J.
25. Smith, M. J., and Ghali, M. O. (1989). "New dynamic model to evaluate the performance of urban traffic control systems and route guidance strategies." Transportation Research Record 1306, Transportation Research Board, Washington, D.C., 33-39.
26. Taylor, N. B. (1990). "CONTRAM 5: An enhanced traffic assignment model." Rep. RR 249, Transport and Road Research Laboratory, Crowthorne, U.K.
27. Tong, C. O., and Wong, S. C. (2000). "A predictive dynamic traffic assignment model in congested capacity-constrained road networks." Transp. Res. Part B: Methodol., 34, 625-644.
28. Van Aerde, M., and Yagar, S. (1988). "Dynamic integrated freeway/traffic signal networks: a routing-based modelling approach." Transp. Res. Part A, 22, 445-453.
29. Wardrop, J. G. (1952). "Some theoretical aspects of road traffic research." Proc., Inst. Civ. Eng., 2(1), 325-378.
30. Wie, B. W., Friesz, T. L., and Tobin, R. L. (1990). "Dynamic user optimal traffic assignment on congested multidestination networks." Transp. Res. Part B: Methodol., 24, 431-442.
31. Wie, B. W., Tobin, R. L., Friesz, T. L., and Bernstain, D. (1995). "A discrete time, nested cost operator approach to the dynamic network user equilibrium problem." Transp. Sci., 29(1),