Abstract
In a multi-agent transportation simulation, each traveler is represented individually. Such a simulation consists of at least the following modules: (i) Activity generation. (ii) Modal and route choice. (iii) The traffic simulation itself. (iv) Learning and feedback. In order to find solutions which are consistent between the modules, a relaxation technique is used. This technique has similarities to day-to-day human learning.
Using advanced computational methods, in particular parallel computing, it is now possible to run such a system for large metropolitan areas with 10 million inhabitants or more. This paper reports on such a simulation system for all of Switzerland. Our focus is on a computationally efficient implementation of the agent-based representation, which means that in fact each agent is represented with an individual set of plans as explained above. A database is used to store the agents' strategies, which are loaded into the simulation modules as required; the modules then feed back individual performance measures into the database. This approach allows that additional modules can be coupled easily, and without degrading computational performance.
The set-up was tested for Swiss morning peak traffic. Hourly demand matrices were taken from work with the VISUM assignment package and converted to our needs. Routes were assigned via feedback learning using the agent data base. In other words, the current implementation uses a car-only versions of the modules (ii), (iii), and (iv). Resulting flow volumes are compared to the VISUM assignment results, and to field data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barrett, C.L., R. Jacob, and M.V. Marathe. (2000). “Formal-Language-Constrained Path Problems.” SLAM J COMPUT 30(3), 809–837.
Beckman, R.J., K.A. Baggerly, and M.D. McKay. (1996). “Creating Synthetic Base-Line Populations.” Transportion Research Part A—Policy and Practice 30(6), 415–429.
Bierlaire, M. (2002). “The Network GEV Model.” In Proceedings of Swiss Transport Research Conference (STRC), Monte Verita, CH. See www.strc.ch.
Bottom, J.A. (2000). “Consistent Anticipatory Route Guidance.” PhD Thesis, Massachusetts Institute of Technology, Cambridge, MA.
Bowman, J.L. (1998). “The Day Activity Schedule Approach to Travel Demand Analysis.” PhD Thesis, Massachusetts Institute of Technology, Cambridge, MA.
Bundesamt für Statistik und Dienst für Gesamtverkehrsfragen. Verkehrsverhalten in der Schweiz 1994. Mikrozensus Verkehr 1994, Bern, 1996. See also http: //www.statistik.admin.ch/news/archiv96/dp96036.htm.
Bundesamt für Strassen. (2000). Automatische Strassenverkehrszählung 1999. Bern, Switzerland.
Cantarella, C. and E. Cascetta. (1995). “Dynamic Process and Equilibrium in Transportation Network: Towards a Unifying Theory.” Transportation Science A 25(4), 305–329.
Cetin, N. and K. Nagel. (2003). “Parallel Queue Model Approach to Traffic Microsimulations.” Paper 03-4272, Transportation Research Board Annual Meeting, Washington, D.C. Also see sim.inf.ethz.ch/papers.
DYNAMIT. Massachusetts Institute of Technology, Cambridge, Massachusetts. See its.mit.edu. Also see dynamictrafficassignment. org.
DYNASMART. See www.dynasmart.com. Also see dynamictrafficassignment.org.
Esser, J. and K. Nagel. (2001). “Iterative Demand Generation for Transportation Simulations.” In D. Hensher and J. King (Eds.), The Leading Edge of Travel Behavior Research, Pergamon, pp. 659–681.
Gawron, C. (1998). “An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model.” International Journal of Modern Physics C 9(3), 393–407.
Gloor, Chr. (2001). “Modelling of Autonomous Agents in a Realistic Road Network (in German).” Diplomarbeit, Swiss Federal Institute of Technology ETH, Zürich, Switzerland.
Hofbauer, J. and K. Sigmund. (1998). Evolutionary Games and Replicator Dynamics.” Cambridge University Press.
Jacob, R.R., M.V. Marathe, and K. Nagel. (1999). “A Computational Study of Routing Algorithms for Realistic Transportation Networks.” ACM Journal of Experimental Algorithms 4 (1999es, Article No. 6).
Kaufman, David E., Karl E. Wunderlich, and Robert L. Smith. (1991). “An Iterative Routing/Assignment Method for Anticipatory Real-Time Route Guidance.” Technical Report IVHS Technical Report 91-02, University of Michigan Department of Industrial and Operations Engineering, Ann Arbor MI 48109.
MPI. MPI: Message Passing Interface. See www-unix.mcs.anl.gov/mpi/mpich.
Nagel, K. (1994/95). “High-Speed Microsimulations of Traffic Flow.” PhD Thesis, University of Cologne. See www.inf.ethz.ch/~nagel/papers.
Palmer, R. (1989). “Broken Ergodicity.” In D.L. Stein (Ed.), Lectures in the Sciences of Complexity, volume I of Santa Fe Institute Studies in the Sciences of Complexity, Addison-Wesley, pp. 275–300.
Park, D. and L.R. Rilett. (1997). “Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach.” Transportation Research Records 1607, 31–37.
PTV—Planung Transport Verkehr. See www.ptv.de.
Raney, B. and K. Nagel. (2002). “Iterative Route Planning for Modular Transportation Simulation.” In Proceedings of the Swiss Transport Research Conference, Monte Verita, Switzerland. See www.strc.ch.
Raney, B. and K. Nagel. (2003). “Truly Agent-Based Strategy Selection for Transportation Simulations.” Paper 03-4258, Transportation Research Board Annual Meeting, Washington, D.C., 2003. lso see sim.inf.ethz. ch/papers.
Rickert, M. (1998). “Traffic Simulation on Distributed Memory Computers.” PhD Thesis, University of Cologne, Germany. See www.zpr.uni-koeln.de/~mr/dissertation.
Schwerdtfeger, T. (1987). “Makroskopisches Simulationsmodell für Schnellstraßennetze mit Berücksichtigung von Einzelfahrzeugen (DYNEMO).” PhD Thesis, University of Karsruhe, Germany.
Sheffi, Y. (1985). Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, NJ, USA.
Vaughn, K.M., P. Speckman, and E.I. Pas. (1997). “Generating Household Activity-Travel Patterns (HATPs) for Synthetic Populations.” TRANSIMS internal report.
Vrtic, M., R. Koblo, and M. Vödisch. (1999). Entwicklung Bimodales Personenverkehrsmodell als Grundlage fr Bahn2000, 2. Etappe, Auftrag 1. Report to the Swiss National Railway and to the Dienst für Gesamtverkehrsfragen, Prognos AG, Basel. See www.ivt.baug.ethz.ch/vrp/ab115.pdf for a related report.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Raney, B., Cetin, N., Völlmy, A. et al. An Agent-Based Microsimulation Model of Swiss Travel: First Results. Networks and Spatial Economics 3, 23–41 (2003). https://doi.org/10.1023/A:1022096916806
Issue Date:
DOI: https://doi.org/10.1023/A:1022096916806