B-Dynamic: An efficient algorithm for dynamic user equilibrium assignment in activity-travel networks

Computer-Aided Civil and Infrastructure Engineering

Volumn 26, Issue 4, 2011, Pages 254-269

  Ramadurai, Gitakrishnan ^a   Ukkusuri, Satish ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVITY LOCATIONS; ACTIVITY PARTICIPATION; COMBINED MODEL; DYNAMIC NETWORK; DYNAMIC TRAFFIC ASSIGNMENTS; DYNAMIC USER EQUILIBRIUM; EFFICIENT ALGORITHM; LATE ARRIVAL; LINEAR FUNCTIONS; NUMERICAL EXAMPLE; QUEUE MODELS; ROUTE CHOICE; SCHEDULE DELAY; UTILITY FUNCTIONS;

COMPUTATIONAL COMPLEXITY; DIFFERENTIAL THERMAL ANALYSIS; TRAFFIC CONTROL;

ALGORITHMS;

ALGORITHM; COMPLEXITY; MODEL;

EID: 79952601999     PISSN: 10939687     EISSN: 14678667     Source Type: Journal    
DOI: 10.1111/j.1467-8667.2010.00676.x     Document Type: Article

References (32)

1. Abdelghany, A. F. & Mahmassani, H. S. (2003), Temporal-spatial microassignment and sequencing of travel demand with activity-trip chains, Transportation Research Record, 1831, 89-97.
2. Abdelghany, A. F., Mahmassani, H. S. & Chiu, Y.-C. (2001), Spatial microassignment of travel demand with activity trip chains, Transportation Research Record, 1777, 36-46.
3. Ahuja, R., Magnanti, T. & Orlin, J. (1993), Network Flows, Prentice Hall, Englewood, NJ.
4. Bar-Gera, H. (1999), Origin-Based Algorithms for Transportation Network Modeling, Technical Report 103. NISS, Research Triangle Park, NC.
5. Beckmann, M., McGuire, C. B. & Winsten, C. B. (1955), Studies in the Economics of Transportation, Yale University Press, New Haven, CT, 1956. Also published as Rand-RM-1488-PR, Rand Corporation, Santa Monica, CA.
6. Ben-Akiva, M., Bierlaire, M., Burton, D., Koutsopoulos, H. N. & Mishalani, R. (2001), Network state estimation and prediction for real-time traffic management, Networks and Spatial Economics, 1(3-4), 293-318.
7. Bertsekas, D. (1976), On the Goldstein-Levitin-Polyak gradient projection method, IEEE Transactions on Automatic Control, 21(2), 174-83.
8. Dafermos, S. (1968), Traffic assignment and resource allocation in transportation networks. Ph.D. thesis, Operations Research, Johns Hopkins University, Baltimore, MD.
9. Dafermos, S. & Sparrow, F. T. (1969), The traffic assignment problem for a general network, Journal of Research of the National Bureau of Standards, 73B, 91-118.
10. Daganzo, C. F. (1994), The cell transmission model: a dynamic representation of highway traffic consistent with the hydrodynamic theory, Transportation Research Part B: Methodological, 28, 269-87.
11. Daganzo, C. F. (1995), The cell transmission model. Part II: network traffic, Transportation Research Part B: Methodological, 29, 79-93.
12. Dial, R. (2006), A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration, Transportation Research Part B: Methodological, 40, 917-36.
13. Florian, M., Mahut, M. & Tremblay, N. (2008), Application of a simulation-based dynamic traffic assignment model, European Journal of Operational Research, 189, 1381-92.
14. Friesz, T. L., Bernstein, D., Mehta, J. N., Tobin, R. L. & Ganjalizadeh, S. (1989), Dynamic network traffic assignment considered as a continuous time optimal control problem, Operations Research, 37(6), 893-901.
15. Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L. & Wie, B. W. (1993), A variational inequality formulation of the dynamic network user equilibrium problem, Operations Research, 41, 179-91.
16. Heinitiz, F. M. & Liedtke, G. T. (2010), Principals of constraint consistent activity-based transport modeling, Computer-Aided Civil and Infrastructure Engineering, 25(2), 101-15.
17. Huang, H. J. & Lam, W. H. K. (2002), Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues, Transportation Research Part B: Methodological, 36, 253-73.
18. Jayakrishnan, R., Tsai, W., Prashker, J. & Rajadhyaksha, S. (1994), A faster path-based algorithm for traffic assignment, Transportation Research Record, 1443, 75-83.
19. Lam, W. H. K. & Huang, H.-J. (2003), Combined activity/travel choice models: time-dependent and dynamic versions, Network and Spatial Economics, 3, 323-47.
20. Mahmassani, H. S. (2001), Dynamic network traffic assignment and simulation methodology for advanced system management applications, Networks and Spatial Economics, 1(3-4), 267-92.
21. Nagurney, A. & Zhang, D. (1997), Projected dynamical systems in the formulation, stability analysis, and computation of fixed-demand traffic network equilibria, Transportation Science, 31, 147-58.
22. Peeta, S. & Ziliaskopoulos, A. K. (2001), Foundations of dynamic traffic assignment: the past, the present and the future, Networks and Spatial Economics, 1(3-4), 233-65.
23. Ramadurai, G. (2009), Novel dynamic user equilibrium models: analytical formulations, multi-dimensional choice, and an efficient algorithm, Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, NY.
24. Ramadurai, G. & Ukkusuri, S. (2010), Dynamic user equilibrium model for combined activity-travel choices using activity-travel supernetwork representation, Networks and Spatial Economics, 10(2), 273-92.
25. Ran, B., Hall, R. W. & Boyce, D. (1996), A link-based variational inequality model for dynamic departure time/route choice, Transportation Research Part B: Methodological, 30, 31-46.
26. Sheffi, Y. (1985), Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall Inc., Englewood Cliffs, NJ.
27. Szeto, W. Y. & Lo, H. K. (2004), A cell-based simultaneous route and departure time choice model with elastic demand, Transportation Research Part B: Methodological, 38, 593-612.
28. Varia, H. R. & Dhingra, S. L. (2004), Dynamic optimal traffic assignment and signal time optimization using genetic algorithms, Computer-Aided Civil and Infrastructure Engineering, 19(4), 260-73.
29. Wardrop, J. G. (1952), Some theoretical aspects of road traffic research, Proceedings of the Institute of Civil Engineers, Part II, pp. 325-78.
30. Zhang, X. & Zhang, H. M. (2007), Simultaneous departure time/route choices in queuing networks and a novel paradox, Networks and Spatial Economics, Published Online: 25 July 2007, DOI:.
31. Ziliaskopoulos, A. K. & Kotzinos, D. (2001), A massively parallel time-dependent least-time-path algorithm for intelligent transportation systems applications, Computer-Aided Civil and Infrastructure Engineering, 16(5), 337-46.
32. Ziliaskopoulos, A. K. & Mahmassani, H. S. (1993), A time-dependent shortest path algorithm for real-time intelligent vehicle/highway systems, Transportation Research Record, 1408, 94-104.