Dynamic micro-assignment modeling approach for integrated multimodal urban corridor management

Transportation Research Part C: Emerging Technologies

Volumn 16, Issue 2, 2008, Pages 167-186

  Zhou, Xuesong ^a   Mahmassani, Hani S ^b   Zhang, Kuilin ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Demand management; Departure time dynamics; Dynamic traffic assignment; Integrated corridor management; Intelligent transportation systems; Intermodal shortest paths; Multimodal networks; Supply demand integration; Travel time reliability

Indexed keywords

DECISION THEORY; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMIZATION; STOCHASTIC MODELS; TRANSPORTATION ROUTES;

DYNAMIC TRAFFIC ASSIGNMENT; INTELLIGENT TRANSPORTATION SYSTEM; URBAN CORRIDOR MANAGEMENT;

URBAN PLANNING;

INTELLIGENT TRANSPORTATION SYSTEM; MODELING; STOCHASTICITY; TRAFFIC MANAGEMENT; TRAVEL DEMAND; TRAVEL TIME; URBAN TRANSPORT;

EID: 38849150228     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2007.07.002     Document Type: Article

References (36)

1. Abdelghany, K., 2001. Stochastic dynamic traffic assignment for intermodal transportation networks with consistent information supply strategies. Dissertation, University of Austin.
2. Abdelghany K.F., and Mahmassani H.S. Dynamic trip assignment-simulation model for intermodal transportation networks. Journal of the Transportation Research Board 1771 (2001) 52-60
3. Abdelghany A.F., and Mahmassani H.S. Temporal-spatial micro-assignment and sequencing of travel demand with activity/trip chains. Transportation Research Record 1831 (2003) 89-97
4. Ben-Akiva M., Bierlaire M., Burton D., Koutsopoulos H., and Mishalani R. Network state estimation and prediction for real-time transportation management applications. Networks and Spatial Economics 1 (2001) 293-318
5. Brownstone D., and Small K.A. Valuing time and reliability: assessing the evidence from road pricing demonstrations. Transportation Research Part A 39 (2004) 279-293
6. Chang, E., 2005. Time-varying intermodal person trip assignment. Ph.D. Dissertation, Northwestern University.
7. Chang, E., Ziliaskopoulos, A.K., 2005. A time-dependent intermodal minimum cost path algorithm. Transportation Research Board CD-ROM Paper Preprints (TRB Paper No. 05-2251), National Research Council, Washington, DC.
8. Damberg O., Lundgren J.T., and Patriksson M. An algorithm for the stochastic user equilibrium problem. Transportation Research Part B 30 2 (1996) 115-131
9. Florian, M., Wu, J.H., He, S., 1999. A multi-class multi-mode variable demand network equilibrium model with hierarchical logit structures. Transportation planning methods: Proceedings of Seminar C held at the PTRC Transport and Planning Summer Annual Meeting, University of Sussex, England, vol. 441, pp. 211-224.
10. Hearn D.W., and Florian M. Network equilibrium and pricing. In: Hall R.W. (Ed). Handbook of Transportation Science (1999), Kluwer Academic Publishers 361-393
11. Hendrickson C., and Kocur G. Schedule delay and departure time decisions in a deterministic model. Transportation Science 15 1 (1981) 62-77
12. Hoogendoorn-Lanser S., van Nes R., and Bovy P.H.L. Path size and overlap in multi-modal transport networks: a new interpretation. In: Mahmassani H.S. (Ed). Proceeding of 16th International Symposium on Transportation and Traffic Theory (2005), Elsevier Science
13. Huang H.J., and Lam W.H.K. Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues. Transportation Research 36B (2002) 253-273
14. Lam T., and Small K.A. The value of time and reliability: measurement from a value pricing experiment. Transportation Research Part E 37 (2001) 231-251
15. Lo H.K., and Chen A. Reformulating the general traffic equilibrium problem via a smooth gap function. Mathematical and Computer Modeling 31 (2000) 179-195
16. Lozano C.A., and Storchi G. Shortest viable path algorithm in multimodal networks. Transportation Research Part A 35 (2001) 225-241
17. Lu, C.-C., Mahmassani, H.S., Zhou, X., 2007. Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem. Transportation Research Part B.
18. Mahmassani H.S. Dynamic network traffic assignment and simulation methodology for advanced system management applications. Networks and Spatial Economics 1 (2001) 267-292
19. Mahmassani H.S., and Herman R. Dynamic user equilibrium departure time and route choice on idealized traffic arterials. Transportation Science 18 (1984) 362-384
20. Mahmassani H.S., and Mouskos K. Some numerical results on the diagonalization algorithm for network assignment with asymmetric interactions between cars and trucks. Transportation Research Part B 22 4 (1988) 275-290
21. Marcotte P., and Patriksson M. Traffic equilibrium. In: Barnhart C., and Laporte G. (Eds). Handbooks in OR and Management Science. Transportation vol. 14 (2007), Elsevier 623-713
22. Metropolitan Washington Council of Governments and the National Capital Region Transportation Planning Board, 2002. COG/TPB travel forecasting model, calibration report.
23. Nagurney A. Network economics: a variational inequality approach (1998), Kluwer Academic Publishers, Boston, MA
24. Noland R.B., Small K.A., Koskenoja P.M., and Chu X. Simulating travel reliability. Regional Science and Urban Economics 28 5 (1998) 535-564
25. Pallotino S., and Scutella M. Shortest path algorithms in transportation models: classical and innovative aspects. In: Marcotte P., and Nguyen S. (Eds). Equilibrium and Advanced Transportation Modelling (1998), Kluwer, Amsterdam 245-281
26. Patriksson M. The traffic assignment problem: models and methods (1987), VSP, Utrecht, The Netherlands
27. Small K.A. The scheduling of consumer activities: work trips. American Economic Review 72 3 (1982) 467-479
28. Small K.A. A discrete choice model for ordered alternatives. Econometrica 55 2 (1987) 409-424
29. Smith M.J. A new dynamic traffic model and the existence and calculation of dynamic user equilibrium on congested capacity-constrained road networks. Transportation Research Part B 27 (1993) 49-63
30. Tavana, H., Mahmassani, H.S., 2001. Estimation of dynamic origin-destination flows from sensor data using bi-level optimization method. Transportation Research Board CD-ROM Paper Preprints (TRB Paper No. 01-3241), National Research Council, Washington, DC.
31. Van der Zijpp N.J., and Lindveld C.D.R. Estimation of origin-destination demand for dynamic assignment with simultaneous route and departure time choice. Journal of the Transportation Research Board 1771 (2001) 75-82
32. Zhou X., Qin X., and Mahmassani H.S. Dynamic origin-destination demand estimation using multi-day link traffic counts for planning applications. Journal of the Transportation Research Board 1831 (2003) 30-38
33. Ziliaskopoulos A.K. A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation Science 34 (2000) 37-44
34. Ziliaskopoulos A.K., and Mahmassani H.S. Time-dependent shortest path algorithm for real-time intelligent vehicle highway systems applications. Journal of Transportation Research Board 1408 (1993) 94-100
35. Ziliaskopoulos A.K., and Mahmassani H.S. A note on least time path computation considering delays and prohibitions for intersection movements. Transportation Research Part B 30 4 (1996) 359-367
36. Ziliaskopoulos A.K., and Wardell W. An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. European Journal of Operational Research 125 (2000) 486-502