Traditional microscopic transport simulation approaches usually separate the supply from the demand forecasting by modeling travel demand and the transportation network separately. This approach generally leads to a sizeable calibration task, especially when nested multiscale simulations must be conducted. A generic approach is proposed to model a virtual urban environment in a way that combines data about the population, transportation network, and locations. A scale-independent approach for modeling such an urban environment is presented, along with its application to the Quebec City, Canada, metropolitan region. Some initial results from the TransNetSIM mesoscopic simulator and some computational challenges that were addressed are presented and discussed.
Get full access to this article
View all access options for this article.
References
1.
RaneyB., VoellmyA., CetinN., VrticM., and NagelK.Towards a Microscopic Traffic Simulation of All of Switzerland. In Proc., International Conference on Computational Science: Part I (April 21–24, 2002): Lecture Notes in Computer Science, Vol. 2329. Springer-Verlag, London, 2002, pp. 371–380.
2.
CharyparD., AxhausenK. W., and NagelK.Event-Driven Queue-Based Traffic Flow Microsimulation. In Transportation Research Record: Journal of the Transportation Research Board, No. 2003, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 35–40.
3.
BattyM.Agents, Cells, and Cities: New Representational Models for Simulating Multiscale Urban Dynamics. In Environment and Planning A, Vol. 37, 2005, pp. 1373–1394.
4.
BourrelE., and LesortJ.-B.Mixing Microscopic and Macroscopic Representations of Traffic Flow: Hybrid Model Based on Lighthill–Whitham–Richards Theory. In Transportation Research Record: Journal of the Transportation Research Board, No. 1852, Transportation Research Board of the National Academies, Washington, D.C., 2003, pp. 193–200.
5.
MammarS., LebaqueJ.-P., and Haj-SalemH.Hybrid Model Based on a Second-Order Traffic Model. In TRB 85th Annual Meeting Compendium of Papers(CD-ROM), Transportation Research Board of the National Academies, Washington, D.C., 2006.
BarceloJ., CasasJ., GarciaD., and PerarnuaJ.Methodological Notes on Combining Macro, Meso and Micro Models for Transportation Analysis. Presented at Workshop on Traffic Modeling: Simulation Models—From the Labs to the Trenches, Sedona, Ariz., 2005.
8.
JakovljevicG., and BaschD.Implementing Multiscale Traffic Simulators Using Agents. In Proc., 26th International Conference on Information Technology Interfaces, Vol. 1, June 7–10, 2004, Cavtat, Croatia, IEEE, Washington, D.C., pp. 519–524.
9.
BurghoutW., and WahlstedtJ.Hybrid Traffic Simulation With Adaptive Signal Control. In Transportation Research Record: Journal of the Transportation Research Board, No. 1999, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 191–197.
10.
BurghoutW., KoutsopoulosH. N., and AndreassonI.Hybrid Mesoscopic–Microscopic Traffic Simulation. In Transportation Research Record: Journal of the Transportation Research Board, No. 1934, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 218–225.
11.
MathisP.(Ed.). Graphs and Networks. ISTE, Newport Beach, Calif., 2007.
12.
ChakerW., MoulinB., and ThériaultM.Modeling Transport Networks With Design Pattern: Application to Hybrid Traffic Simulations. In Proc., 19th IASTED International Conference on Modelling and Simulation, Special Session: Simulation and Modeling of Transportation Systems, Montreal, Quebec, Canada, 2007.
13.
WilliamsonP., BirkinM., and ReesP.The Estimation of Population Microdata by Using Data From Small Area Statistics and Samples of Anonymous Records. Environment and Planning A, Vol. 30, 1998, pp. 785–816.
14.
GoldbergA. V.An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. Journal of Algorithms, Vol. 22, No. 1, 1997, pp. 1–29.
15.
KrajzewiczD., HertkornG., RösselC., and WagnerP.SUMO (Simulation of Urban MObility): An Open-Source Traffic Simulation. In Proc., 4th Middle East Symposium on Simulation and Modelling (MESM2002).SCS European Publishing House, Erlangen, Germany, 2002, pp. 183–187.
16.
DijkstraE. W.A Note on Two Problems in Connection With Graphs. Numerische Mathematik, Vol. 1, 1959, pp. 269–271.
17.
FredmanM. L., and TarjanR. E.Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. Journal of the ACM, Vol. 34, No. 3, 1987, pp. 596–615.
18.
SeidelR.On the All-Pairs-Shortest-Path Problem. In Proc., 24th Annual ACM Symposium on Theory of Computing.ACM Press, New York, 1992, pp. 745–749.
19.
ThériaultM., VandersmissenM.-H., Lee-GosselinM., and LerouxD.Modelling Commuters’ Trips Length And Duration Within GIS: Application to an O-D Survey. Journal of Geographic Information and Decision Analysis, Vol. 3, 1999, pp. 41–55.
20.
MUSCAMAGS Project Website. muscamags.ift.ulaval.ca. Accessed July 26, 2007.
21.
ScottD. M.Approaches to Generating Constrained Destination Choice Sets Using GIS. Presented at Computers in Urban Management and Urban Planning (CUPUM) 2005, London, June 29–July 1, 2005.
22.
BarrettC. L., and BeckmanR. J.TransIMS, Vol. 3. Los Alamos Unclassified Reports 00-1725 and 00-1767. Los Alamos National Laboratory, Los Alamos, N. Mex., August 2004.
23.
JacobR., MaratheM. V., and NagelK.Computational Study of Routing Algorithms for Realistic Transportation Networks. Journal of Experimental Algorithmics, Vol. 4, No. 6, 1999, 6 pp.
24.
RieserM., NagelK., BeuckU., BalmerM., and RümenappJ.Agent-Oriented Coupling of Activity-Based Demand Generation with Multi-agent Traffic Simulation. In Transportation Research Record: Journal of the Transportation Research Board, No. 2021, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 10–17.
25.
BeckmanR. J., BaggerlyK. A., and McKayM. D.Creating Synthetic Baseline Populations. Transportation Research, Part A: Policy and Practice, Vol. 30, No. 6, 1996, pp. 415–429.
26.
QuinlanJ. R.C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Mateo, Calif., 1993.
27.
WegenerI.Complexity Theory: Exploring the Limits of Efficient Algorithms.Springer, New York, 2004.
