Modeling user responses to pricing simultaneous route and departure time network equilibrium with heterogeneous users

Transportation Research Record

Volumn , Issue 2085, 2008, Pages 124-135

  Lu, Chung Cheng ^a   Mahmassani, Hani S ^b  

^a NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

^b Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COSTS; LINEAR PROGRAMMING; TRAFFIC CONTROL; VARIATIONAL TECHNIQUES;

BEHAVIORAL CHARACTERISTICS; DEPARTURE TIME; GENERALISATION; HETEROGENEOUS USERS; MULTI-CRITERION; NETWORK EQUILIBRIUM; ROUTE CHOICE; SCHEDULE DELAY; USER HETEROGENEITY; VALUE OF TIME;

TRAVEL TIME;

EID: 63849111810     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2085-14     Document Type: Article

References (26)

1. Lu, C.-C., H. S. Mahmassani, and X. Zhou. A Bicriterion Dynamic User Equilibrium Traffic Assignment Model and Solution Algorithm for Evaluating Dynamic Road Pricing Strategies. Transportation Research, Part C, forthcoming.
2. Arnott, R., A. de Palma, and R. Lindsey. Departure Time and Route Choice for the Morning Commute. Transportation Research, Vol. 24B, No. 3, 1990, pp. 209-228.
3. Mahmassani, H. S., and R. Herman. Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials. Transportation Science, Vol. 18, No. 4, 1984, pp. 362-384.
4. Friesz, T. L., D. Bernstein, T. E. Smith, R. L. Tobin, and B. W. Wie. A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem. Operations Research, Vol. 41, No. 1, 1993, pp. 179-191.
5. Janson, B. N., and J. Robles. Dynamic Traffic Assignment with Arrival Time Costs. In Proceedings of the 12th International Symposium on Transportation and Traffic Theory (C. F. Daganzo, ed.), Elsevier, 1993, pp. 127-146.
6. Wie, B.-W., R. L. Tobin, T. L. Friesz, and D. Bernstein. A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem. Transportation Science, Vol. 29, No. 1, 1995, pp. 79-92.
7. Ziliaskopoulos, A. K., and L. Rao. A Simultaneous Route and Departure Time Choice Equilibrium Model for Dynamic Networks. International Transactions in Operational Research, Vol. 6, No. 1, 1999, pp. 21-37.
8. Huang, H.-J., and W. H. K. Lam. Modeling and Solving the Dynamic User Equilibrium Route and Departure Time Choice Problem in Network with Queues. Transportation Research, Vol. 36B, No. 3, 2002, pp. 253-273.
9. Szeto, W. Y., and H. K. Lo. A Cell-Based Simultaneous Route and Departure Time Choice with Elastic Demand. Transportation Research, Vol. 38B, No. 7, 2004, pp. 593-612.
10. Jayakrishnan, R., H. S. Mahmassani, and T.-Y. Hu. An Evaluation Tool for Advanced Traffic Information and Management Systems in Urban Networks. Transportation Research, Vol. 2C, No. 3, 1994, pp. 129-147.
11. Small, K. A., C. Winston, and J. Yan. Uncovering the Distribution of Motorists' Preferences for Travel Time and Reliability. Econometrica, Vol. 73, No. 4, 2005, pp. 1367-1382.
12. Liu, H. X., W. Recker, and A. Chen. Uncovering the Contribution of Travel Time Reliability to Dynamic Route Choice Using Real-Time Loop Data. Transportation Research, Vol. 38A, No. 6, 2004, pp. 435-453.
13. Small, K. A. The Scheduling of Consumer Activities: Work Trips. American Economic Review, Vol. 72, No. 3, 1982, pp. 467-479.
14. Wardrop, J. G. Some Theoretical Aspects of Road Traffic Research. Proceedings of the Institute of Civil Engineers, Vol. II, No. 1, 1952, pp. 325-378.
15. Marcotte, P., and D. L. Zhu. Equilibria with Infinitely Many Differential Classes of Customers. In Complementarity and Variational Problems: State of the Art, Proceedings of the 13th International Conference on Complementarity Problems (J.-S. Pang and M. Ferris, eds.), SIAM, Philadelphia, Pa., 1997, pp. 234-258.
16. Larsson, T., and M. Patriksson. Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem. Transportation Science, Vol. 26, No. 1, 1992, pp. 4-17.
17. Dial, R. B. Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms. Transportation Science, Vol. 30, No. 2, 1996, pp. 93-110.
18. Mahmassani, H. S., X. Zhou, and C.-C. Lu. Toll Pricing and Heterogeneous Users: Approximation Algorithms for Finding Bicriterion Time-Dependent Efficient Paths in Large-Scale Traffic Networks. In Transportation Research Record: Journal of the Transportation Research Board, No. 1923, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 28-36.
19. Lu, C.-C. Multi-Criterion Dynamic Traffic Assignment Models and Algorithms for Road Pricing with Heterogeneous Users. PhD dissertation. University of Maryland, College Park, 2007.
20. Patriksson, M. The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, Netherlands, 1994.
21. Smith, M. J., and M. B. Wisten. A Continuous Day-to-Day Traffic Assignment Model and the Existence of a Continuous Dynamic User Equilibrium. Annals of Operations Research, Vol. 60, 1995, pp. 59-79.
22. Cybis, H. B. B. A Dynamic User Equilibrium Assignment Model: A Rigorous Formulation. In Urban Traffic Networks: Dynamic Flow Modeling and Control (N. H. Gartner and G. Improta, eds.), Springer, Berlin, 1995, pp. 233-250.
23. Szeto, W. Y., and H. K. Lo. Non-Equilibrium Dynamic Traffic Assignment. In Transportation and Traffic Theory: Flow, Dynamics, and Human Interaction: Proceedings of the 16th International Symposium on Transportation and Traffic Theory (H. S. Mahmassani, ed.), Elsevier Science, 2005, pp. 427-445.
24. Peeta, S., and H. S. Mahmassani. System Optimal and User Equilibrium Time-Dependent Traffic Assignment in Congested Networks. Annals of Operations Research, Vol. 60, 1995, pp. 81-113.
25. Lam, T. C., and K. A. Small. The Value of Time and Reliability: Measurement from a Value Pricing Experiment. Transportation Research, Vol. 37E, No. 2/3, 2001, pp. 231-251.
26. Brownstone, D., and K. A. Small. Valuing Time and Reliability: Assessing the Evidence from Road Pricing Demonstrations. Transportation Research, Vol. 39A, No. 4, 2005, pp. 279-293.