Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm

Transportation Research Part B: Methodological

Volumn 45, Issue 7, 2011, Pages 1035-1061

  Zhong, R X ^a   Sumalee, A ^a   Friesz, T L ^b   Lam, William H K ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Dynamic user equilibrium (DUE); Lagrange multiplier; Pontryagin minimum principle; Traffic assignment with side constraint; Traffic management and control; Traffic volume control

Indexed keywords

NONLINEAR PROGRAMMING; OPTIMAL CONTROL SYSTEMS; TRAFFIC CONTROL; VARIATIONAL TECHNIQUES;

DYNAMIC USER-EQUILIBRIUM; PONTRYAGIN MINIMUM PRINCIPLE; SIDE CONSTRAINTS; TRAFFIC MANAGEMENT AND CONTROLS; TRAFFIC VOLUMES;

LAGRANGE MULTIPLIERS;

ALGORITHM; NETWORK ANALYSIS; NUMERICAL MODEL; OPTIMIZATION; THEORETICAL STUDY; TRAFFIC CONGESTION; TRAFFIC MANAGEMENT; TRANSPORTATION PLANNING;

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

References (45)

1. Aboudolas K., Papageorgiou M., Kosmatopoulos E. Store-and-forward based methods for the signal control problem in large-scale congested urban road networks. Transportation Research Part C 2009, 17(2):163-174.
2. Adida E., Perakis G. A nonlinear continuous time optimal control model of dynamic pricing and inventory control with no backorders. Naval Research Logistics 2007, 54(7):767-795.
3. Astarita, V., 1996. A continuous time link model for dynamic network loading based on travel time function. In: Proceedings of 13th International Symposium on Transportation and Traffic Theory, pp. 79-102.
4. Ban X., Liu X., Ferris M., 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.
5. Buskens C., Maurer H. SQP-methods for solving optimal control problems with control and state constraints: adjoint variables, sensitivity analysis and real-time control. Journal of Computational and Applied Mathematics 2000, 120(1):85-108.
6. Carey M., McCartney M. Behaviour of a whole-link travel time model used in dynamic traffic assignment. Transportation Research Part B 2002, 36(1):83-95.
7. Carey M., Ge Y. Comparing whole-link travel time models used in DTA. Transportation Research Part B 2003, 37(10):905-926.
8. Carey M. A framework for user equilibrium dynamic traffic assignment. Journal of the Operational Research Society 2008, 60(3):395-410.
9. Chow A. Dynamic system optimal traffic assignment-a state-dependent control theoretic approach. Transportmetrica 2009, 5(2):85-106.
10. Friesz T., Bernstein D., Smith T., Tobin R., Wie B. A variational inequality formulation of the dynamic networks user equilibrium problem. Operations Research 1993, 41(2):179-191.
11. Friesz T., Bernstein D., Suo Z., Tobin R. Dynamic network user equilibrium with state-dependent time lags. Networks and Spatial Economics 2001, 1(3-4):319-347.
12. Friesz T., Mookherjee R. Solving the dynamic network user equilibrium problem with state-dependent time shifts. Transportation Research Part B 2006, 40(3):207-229.
13. Friesz T., Mookherjee R., Yao T. Securitizing congestion: the congestion call option. Transportation Research Part B 2008, 42(5):407-437.
14. Friesz T. Dynamic Optimization and Differential Games 2010, Springer, New York.
15. Friesz T., Kim T., Kwon C., Rigdon M. Approximate network loading and dual-time-scale dynamic user equilibrium. Transportation Research Part B 2011, 45(1):176-207.
16. Gentile G., Meschini L., Papola N. Macroscopic ARC performance models with capacity constraints for within-day dynamic traffic assignment. Transportation Research Part B 2005, 39(10):319-338.
17. Hartl R., Sethi S., Vickson R. A survey of the maximum principles for optimal control problems with state constraints. SIAM Review 1995, 37(2):181-218.
18. Huang H., Lam W. Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues. Transportation Research Part B 2002, 36(3):253-273.
19. Larsson T., Patriksson M. An augmented lagrangian dual algorithm for link capacity side constrained traffic assignment problems. Transportation Research Part B 1995, 29(6):433-455.
20. Larsson T., Patriksson M. Side constrained traffic equilibrium models-analysis, computation and applications. Transportation Research Part B 1999, 33(4):233-264.
21. Larsson T., Patriksson M., Rydergren C. A column generation procedure for the side constrained traffic equilibrium problem. Transportation Research Part B 2004, 38(1):17-38.
22. Leoni G. A First Course in Sobolev Spaces 2009, American Mathematical Society, Providence.
23. Lindsey R. Existence, uniqueness, and trip cost function properties of user equilibrium in the bottleneck model with multiple user classes. Transportation Science 2004, 38(3):293-314.
24. Lo H.P., Szeto W.Y. A cell-based variational inequality formulation of the dynamic user optimal assignment problem. Transportation Research Part B 2002, 36(5):421-443.
25. Lu C., Mahmassani H., Zhou X. Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem. Transportation Research Part B 2009, 43(3):345-364.
26. Minoux M. Mathematical Programming: Theory and Algorithms 1986, John Wiley, New York.
27. Mun J. Traffic performance models for dynamic traffic assignment: an assessment of existing models. Transport Reviews 2007, 27(2):231-249.
28. Nie X., Zhang H.M. Delay-function-based link models: their properties and computational issues. Transportation Research Part B 2002, 39(8):729-751.
29. Nie X., Zhang H.M. A comparative study of some macroscopic link models used in dynamic traffic assignment. Networks and Spatial Economics 2005, 5(1):89-115.
30. Nie Y., Zhang H.M. Solving the dynamic user optimal assignment problem considering queue spillback. Networks and Spatial Economics 2010, 10(1):49-71.
31. Nie Y. A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem. Transportation Research Part B 2011, 45(2):329-342.
32. Noiri T. On weakly continuous mappings. Proceedings of the American Mathematical Society 1974, 46(1):120-124.
33. Papageorgiou M., Diakaki C., Dinopoulou V., Kotsialos A., Wang Y. Review of road traffic control strategies. Proceedings of the IEEE 2003, 96(12):2043-2067.
34. Roger A., Johnson C. Matrix Analysis 1985, Cambridge University Press, New York.
35. Rose D. Weak continuity and strongly closed sets. International Journal of Mathematics and Mathematical Science 1984, 7(4):809-816.
36. Ross P. Traffic dynamics. Transportation Research Part B 1988, 22(6):421-435.
37. Szeto W.Y., Lo H. Dynamic traffic assignment: properties and extensions. Transportmetrica 2006, 2(1):31-52.
38. Tong C., Wong S. Heuristic algorithms for simulation-based dynamic traffic assignment. Transportmetrica 2010, 6(2):97-120.
39. Wie B., Tobin R., Carey M. The existence, uniqueness and computation of an ARC-based dynamic network user equilibrium formulation. Transportation Research Part B 2002, 36(10):897-918.
40. Xu Y.W., Wu J.H., Florian M., Marcotte P., Zhu D.L. Advances in the continuous dynamic network loading problem. Transportation Science 1999, 33(4):341-353.
41. Yang H., Meng Q. Departure time, route choice and congestion toll in a queuing network with elastic demand. Transportation Research Part B 1998, 32(4):247-260.
42. Yang H., Bell M., Meng Q. Modeling the capacity and level of service of urban transportation networks. Transportation Research Part B 2000, 34(4):255-275.
43. Yang H., Meng Q., Lee D. Trial-and-error implementation of marginal-cost pricing on networks in the absence of demand functions. Transportation Research Part B 2004, 38(6):477-493.
44. Yang H., Huang H. Mathematical and Economic Theory of Road Pricing 2005, Elsevier, Amsterdam.
45. Zhu D., Marcotte P. On the existence of solutions to the dynamic user equilibrium problem. Transportation Science 2000, 34(4):402-414.