A Temporal Domain Decomposition Algorithmic Scheme for Large-Scale Dynamic Traffic Assignment

International Journal of Transportation Science and Technology

Volumn 1, Issue 1, 2012, Pages 1-24

  Nava, Eric J ^a   Chiu, Yi Chang ^a  

^a University of Arizona   (United States)

Author keywords

computational efficiency; dynamic traffic assignment; large scale; method of isochronal vehicle assignment; simulation

Indexed keywords

EID: 84893146721     PISSN: 20460430     EISSN: 20460449     Source Type: Journal    
DOI: 10.1260/2046-0430.1.1.1     Document Type: Article

References (33)

1. Baker, K.R., “An Experimental Study of the Effectiveness of Rolling Schedules in Production Planning.”. Decision Sciences 8:1 (1977), 19–27.
2. Borst, J., B. Preneel, et al. (1998). On the time-memory tradeoff between exhaustive key search and table precomputation. 19th Symposium on Information Theory, Beneluxz.
3. Chabini, I., Ganugapati, S., “Parallel Algorithms for Dynamic Shortest Path Problems.”. International Transactions in Operational Research 9 (2002), 279–302.
4. Chiu, Y.-C., Bottom, J., et al. A Primer for Dynamic Traffic Assignment, 2010, Transportation Research Board, Washington, D. C. http://www.nextrans.org/ADB30/index.php?option=com_content&view=article&id=28&Itemid=33.
5. Chiu, Y.-C., Nava, E., et al. DynusT User's Manual. http://dynust.net/wikibin/doku.php, 2010.
6. Chronopoulos, A.T., Johnston, C.M., “A Real-Time Traffic Simulation System.”. IEEE Transactions on Vehicular Technology 47:1 (1998), 321–331.
7. Gallo, G. (1986). Reoptimization Procedures in Shortest Path Problems. Shortest Path Methods: A Unifying Approach - Mathematical Programming Study 26. G. a. Pallottino: 38-64.
8. Habbal, M.B., Koutsopoulos, H.N., et al. “A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures.”. Transportation Science 28:4 (1994), 292–308.
9. Hellman, M., “A cryptanalytic time-memory tradeoff.”. IEEE Transactions on Information Theory 26 (1980), 401–406.
10. Hribar, M., Taylor, V.E., et al. “Implementing Parallel Shortest Path for Parallel Transportation Applications.”. Parallel Computing 27 (2001), 1537–1568.
11. Hribar, M.R., Parallel Traffic Equilibirum Applications. Computer Engineering, 1997, Northwestern University, Evanston, Illinois, 204 Doctor of Philosophy.
12. Kiesling, T., Luthi, J., Towards Time-Parallel Road Traffic Simulation. Workshop on Principles of Advanced and Distributed Simulation, 2005.
13. Kiesling, T. and S. Pohl (2004). Time-Parallel Simulation with Approximative State Matching. 8th Workshop on Parallel and Distributed Simulation, Kufstein, Austria.
14. Lee, D.-H., Chandrasekar, P., “A Framework for Parallel Traffic Simulation Using Multiple Instancing of a Simulation Program.”. Intelligent Tranpsortation Systems Journal 7:3-4 (2002), 279–294.
15. Liu, H. X., W. Ma, et al. (2005). Distributed Large-scale Network Modeling with Paramics Implementation. 8th International IEEE Conference on Intelligent Transportatino Systems, Vienna, Austria.
16. Merchant, D.K., Nehmauser, G.L., “A model and an Algorithm for the Dynamic Traffic Assignment Problems.”. Transportation Science 12:3 (1978), 183–199.
17. Merchant, D.K., Nehmauser, G.L., “Optimality Conditions for a Dynamic Traffic Assignment Model.”. Transportation Science 12:3 (1978), 200–207.
18. Miller-Hooks, E., Yang, B., “Updating Paths in Time-Varying Networks Given Arc Weight Changes.”. Transportation Science 39:4 (2005), 451–464.
19. Nagel, K., Rickert, M., “Parallel Implementation of the TRANSIMS Micro-simulation.”. Parallel Computing 27:12 (2001), 1611–1639.
20. Newell, G.F., “The Rolling Horizon Scheme of Traffic Signal Control.”. Transportation Research Part A: Policy and Practice 32 (1998), 39–44.
21. Nokel, K., Schmidt, M., “Parallel DYNEMO: Meso-Scopic Traffic Flow Simulation on Large Networks.”. Networks and Spatial Economics 2 (2002), 387–403.
22. O'Cearbhaill, E.A., O'Mahony, M., “Parallel implementation of a transportation network model.”. Journal of Parallel and Distributed Computing 65:1 (2005), 1–14.
23. Ovacik, I.M., Uzsoy, R., “Rolling Horizon Algorithms for a Single-Machine Dynamic Scheduling Problem with Sequence-Dependent Setup Times.”. International Journal of Production Research 32:6 (1994), 1243–1263.
24. Pallottino, S., Scutellí, M., “A new algorithm for reoptimizing shortest paths when the arc costs change.”. Operations Research Letters 31 (2003), 149–160.
25. Peeta, S., Chen, S.-C., “A Distributed Computing Environment for Dynamic Traffic Operations.”. Computer-Aided Civil and Infrastructure Engineering 14 (1999), 257–271.
26. Peeta, S., Mahmassani, H.S., “Multiple User Classes Real-Time Traffic Assignment for Online Operations: A Rolling Horizon Solution Framework.”. Transportation Research Part C: Emerging Technologies 3:2 (1995), 83–98.
27. Ran, B., Lee, D.-H., et al. “Dynamic Traffic Assignment with Rolling Horizon Implementation.”. Journal of Transportation Engineering 128:4 (2002), 314–322.
28. Romeijn, H.E., Smith, R.L., “Parallel Algorithm for Solving Aggregated Shortest Path Problems.”. Computers and Operations Research, Special Issue on Aggregation 26:10-11 (1997), 941–953.
29. Sethi, S., Sorger, G., “A Theory of Rolling Horizon Decision Making.”. Annals of Operations Research 29 (1991), 387–416.
30. Wisten, M.B., Smith, M.J., “Distributed Computation of Dynamic Traffic Equilibria.”. Transportation Research Part C: Emerging Technologies 5:2 (1997), 77–93.
31. Ziliaskopoulos, A., Kotzinos, D., et al. “Design and Implementation of Parallel Time-Dependent Least Time Path Algorithm for Intelligent Transportation Systems Applications.”. Transportation Research Part C: Emerging Technologies 5:2 (1997), 95–107.
32. Junchaya, T., Chang, G.-L., “Exploring Real-Time Traffic Simulation with Massively Parallel Computing Architecture.”. Transpn. Res. C 1:1 (1993), 57–76.
33. Klefstad, R., Y. Zhang, et al. (2005). A Distributed, Scalable, and Synchronized Framework for Large-Scale Microscopic Traffic Simulation. 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria.