The deployment of intelligent transportation systems must be assisted by suitable tools to conduct the feasibility studies required to test the designs and evaluate the expected impacts. Microscopic traffic simulation has proved to be the suitable methodological approach to achieve these goals. One of the most critical aspects of the dynamic simulation of road networks based on a microscopic approach–-namely, how to perform a heuristic dynamic assignment, the implied route choice models, and whether under certain criteria the approach can achieve stochastic user equilibrium–-is discussed.
Get full access to this article
View all access options for this article.
References
1.
FrieszT., BernsteinD., SmithT., TobinR., and WieB.. A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem.Operations Research, Vol. 41, 1993, pp. 179–191.
2.
FlorianM., MahutM., and TremblayN.. A Hybrid Optimization-Mesoscopic Simulation Dynamic Traffic Assignment Model.Proc., 2001 IEEE Intelligent Transport Systems Conference, Oakland, 2001, pp. 120–123.
3.
CascettaE.Transportation Systems Engineering: Theory and Methods.Kluwer Academic Publishers, 2001.
4.
WuJ. 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.
WuJ. H., ChenY., and FlorianM.. The Continuous Dynamic Network Loading Problem: A Mathematical Formulation and Solution Method.Transportation Research, Vol. 32B, No. 3, 1998, pp. 173–187.
6.
WuJ. H., FlorianM., XuY. W., and Rubio-ArdanazJ. M.. 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 (YangZ., WangK. C. P., and MaoB., eds.), American Society of Civil Engineers, New York, 1998.
7.
XuY. W., WuJ. H., and FlorianM.. An Efficient Algorithm for the Continuous Network Loading Problem: A DYNALOAD Implementation. In Transportation Networks: Recent Methodological Advances (BellM. G. H., ed.), Pergamon Press, 1998.
8.
XuY. W., WuJ. H., FlorianM., MarcotteP., and ZhuD. L.. 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.
LiuH. X., MaW., BanJ. X., and MirchandaniP.. 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., FerrerJ. L., GrauR., FlorianM., ChabiniI., and Le SauxE.. A Route Based Variant of the AIMSUN Microsimulation Model.Proc., 2nd World Congress on Intelligent Transport Systems, Yokohama, 1995.
13.
BarcelóJ., FerrerJ. L., GarcíaD., FlorianM., and Le SauxE.. Paral-lelization of Microscopic Traffic Simulation for ATT Systems Analysis. In Equilibrium and Advanced Transportation Modeling (MarcotteP., and NguyenS., eds.), Kluwer Academic Publishers, 1998.
14.
BarcelóJ., and CasasJ.. 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.
CascettaE., NuzzoloA., RussoF., and VitettaA.. 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-AkivaM., and BierlaireM.. Discrete Choice Methods and Their Applications to Short Term Travel Decisions. In Transportation Science Handbook, Kluwer Academic Publishers, 1999.
18.
BellmanR., and KalabaR.. On kth Best Policies.Journal of the Society for Industrial Applied Mathematics, Vol. 8, 1960, pp. 582–588.
19.
DreyfusS. E.An Appraisal of Some Shortest Path Algorithms.Operations Research, Vol. 17, 1969, pp. 395–412.
20.
FoxB. L.Calculating kth Shortest Paths.INFOR—Canadian Journal for Operations Research and Information Processing, Vol. 11, No. 1, 1973, pp. 66–70.
21.
EppsteinD.Finding the k Shortest Paths.Proc., 35th IEEE Symposium FOCS, 1994, pp. 154–165.
22.
EppsteinD.Finding the k Shortest Paths.Society for Industrial Applied Mathematics Journal of Computing, Vol. 28, No. 2, 1999, pp. 652–673.
23.
JiménezV. M., and MarzalA.. 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.
MartinsE. Q. V.An Algorithm for Ranking Paths That May Contain Cycles.European Journal of Operations Research, Vol. 18, 1984, pp. 123–130.
25.
MartinsE. Q. V., and SantosJ. L. E.. A New Shortest Paths Ranking Algorithm.Technical Report. University of Coimbra, Portugal, 1996. http://www.mat.uc.pt/∼eqvm.
26.
JansonB. 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.
