Stochastic heuristic dynamic assignment based on AIMSUN microscopic traffic simulator

Transportation Research Record

Volumn , Issue 1964, 2006, Pages 70-80

  Barceló, Jaime ^a   Casas, Jordi ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF VIC CENTRAL UNIVERSITY OF CATALONIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMOBILE SIMULATORS; COMPUTER SIMULATION; HEURISTIC METHODS; RANDOM PROCESSES; ROADS AND STREETS;

MICROSCOPIC TRAFFIC SIMULATORS; ROAD NETWORKS; STOCHASTIC USER EQUILIBRIUM; TRAFFIC SIMULATORS;

INTELLIGENT VEHICLE HIGHWAY SYSTEMS;

EID: 33846883547     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1964-09     Document Type: Conference Paper

References (27)

1. Friesz, T., D. Bernstein, T. Smith, R. Tobin, and B. Wie. A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem. Operations Research, Vol.41, 1993, pp. 179-191.
2. Florian, M., M. Mahut, and N. Tremblay. A Hybrid Optimization-Mesoscopic Simulation Dynamic Traffic Assignment Model. Proc., 2001 IEEE Intelligent Transport Systems Conference, Oakland, 2001, pp. 120-123.
3. Cascetta, E. Transportation Systems Engineering: Theory and Methods. Kluwer Academic Publishers, 2001.
4. Wu, J. H. A Study of Monotone Variational Inequalities and Their Application to Network Equilibrium Problems. Ph.D. thesis. Publication 801. Centre de Recherche sur les Transports, Université de Montréal, Canada, 1991.
5. Wu, J. H., Y. Chen, and M. Florian. The Continuous Dynamic Network Loading Problem: A Mathematical Formulation and Solution Method. Transportation Research, Vol. 32B, No. 3, 1998, pp. 173-187.
6. Wu, J. H., M. Florian, Y. W. Xu, and J. M. Rubio-Ardanaz. A Projection Algorithm for the Dynamic Network Equilibrium Problem. Traffic and Transportation Studies: Proceedings of the International Conference on Transportation and Traffic Studies, ICTTS'98 (Z. Yang, K. C. P. Wang, and B. Mao, eds.), American Society of Civil Engineers, New York, 1998.
7. Xu, Y. W., J. H. Wu, and M. Florian. An Efficient Algorithm for the Continuous Network Loading Problem: A DYNALOAD Implementation. In Transportation Networks: Recent Methodological Advances (M. G. H. Bell, ed.), Pergamon Press, 1998.
8. Xu, Y. W., J. H. Wu, M. Florian, P. Marcotte, and D. L. Zhu. Advances in the Continuous Dynamic Network Problem. Transportation Science, Vol. 33, No. 4, 1999, pp. 341-353.
9. Barceló, J. Dynamic Network Simulation with AIMSUN. Proc., International Symposium on Transport Simulation, Yokohama, Aug. 2002, Kluwer Academic Publishers, 2005.
10. Liu, H. X, W. Ma, J. X. Ban, and P. Mirchandani. Dynamic Equilibrium Assignment with Microscopic Traffic Simulation. Presented at the 8th International Conference on Intelligent Transportation Systems, IEEE, 2005.
11. AIMSUN and TEDI Version 4.2 User's Manual. TSS-Transport Simulation Systems, Barcelona, Spain, 2003.
12. Barceló, J., J. L. Ferrer, R. Grau, M. Florian, I. Chabini, and E. Le Saux. A Route Based Variant of the AIMSUN Microsimulation Model. Proc., 2nd World Congress on Intelligent Transport Systems, Yokohama, 1995.
13. Barceló, J., J. L. Ferrer, D. Garcia, M. Florian, and E. Le Saux. Parallelization of Microscopic Traffic Simulation for ATT Systems Analysis. In Equilibrium and Advanced Transportation Modeling (P. Marcotte and S. Nguyen, eds.), Kluwer Academic Publishers, 1998.
14. Barceló, J., and J. Casas. Heuristic Dynamic Assignment Based on Microscopic Traffic Simulation. Proc., 9th Meeting of the Euro Working Group on Transportation, Bari, Italy, 2002.
15. Barceló, J. Methodological Notes on Calibration and Validation of Microscopic Simulation Models. Presented at the 83rd Annual Meeting of the Transportation Research Board, Washington, D.C., 2004.
16. Cascetta, E., A. Nuzzolo, F. Russo, and A. Vitetta. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems. Proc., 13th International Symposium on Transportation and Traffic Flow Theory, Pergamon Press, 1996.
17. Ben-Akiva, M., and M. Bierlaire. Discrete Choice Methods and Their Applications to Short Term Travel Decisions. In Transportation Science Handbook, Kluwer Academic Publishers, 1999.
18. Bellman, R., and R. Kalaba. On kth Best Policies. Journal of the Society for Industrial Applied Mathematics, Vol. 8, 1960, pp. 582-588.
19. Dreyfus, S. E. An Appraisal of Some Shortest Path Algorithms. Operations Research, Vol. 17, 1969, pp. 395-412.
20. Fox, B. L. Calculating kth Shortest Paths. INFOR-Canadian Journal for Operations Research and Information Processing, Vol. 11, No. 1, 1973, pp. 66-70.
21. Eppstein, D. Finding the k Shortest Paths. Proc., 35th IEEE Symposium FOCS, 1994, pp. 154-165.
22. Eppstein, D. Finding the k Shortest Paths. Society for Industrial Applied Mathematics Journal of Computing, Vol. 28, No. 2, 1999, pp. 652-673.
23. Jiménez, V. M., and A. Marzal. Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison. Proc., Third International Workshop on Algorithm Engineering, WAE'99, London, July 1999.
24. Martins, E. Q. V. An Algorithm for Ranking Paths That May Contain Cycles. European Journal of Operations Research, Vol. 18, 1984, pp. 123-130.
25. Martins, E. Q. V., and J. L. E. Santos. A New Shortest Paths Ranking Algorithm. Technical Report. University of Coimbra, Portugal, 1996. http://www.mat.uc.pt/~eqvm.
26. Janson, B. N. Dynamic Assignment for Urban Road Networks. Transportation Research, Vol. 25B, Nos. 2/3, 1991, pp. 143-161.
27. Guidelines for Applying Traffic Microsimulation Modeling Software, Vol. III. Publ. FHWA-HRT-04-040. FHWA, U.S. Department of Transportation, June 2004.