Accelerating traffic microsimulations: a parallel discrete-event queue-based approach for speed and scale

Authors:
Sunil Thulasidasan;Stephan Eidenbenz
Affiliations:
Los Alamos National Laboratory, Los Alamos, NM;Los Alamos National Laboratory, Los Alamos, NM
Venue:
Winter Simulation Conference
Year:
2009

Citing 4
Cited 3

Shortest paths in Euclidean graphs

Algorithmica
A systems approach to scalable transportation network modeling

Proceedings of the 38th conference on Winter simulation
Multi-scale integrated information and telecommunications system (MIITS): first results from a large-scale end-to-end network simulator

Proceedings of the 38th conference on Winter simulation
ActivitySim: large-scale agent-based activity generation for infrastructure simulation

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference

Explicit Spatial Scattering for Load Balancing in Conservatively Synchronized Parallel Discrete Event Simulations

PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Heuristic acceleration of routing in transportation simulations using GPUs

Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
On the parallel simulation of scale-free networks

Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present FastTrans -- a parallel, distributed-memory simulator for transportation networks that uses a queue-based event-driven approach to traffic microsimulation. Queue-based simulation models have been shown to be significantly faster than cellular-automata type approaches, sacrificing spatial granularity for speed, while preserving link and intersection dynamics with high fidelity. Significant advances over previous work include the size of the simulated network, support for dynamic responses to congestion and the absence of precomputed routes -- all routing calculations are executed online. We present initial results from a scalability study using a real-world network from the North-East region of the United States comprising over 1.5 million network elements and over 25 million vehicular trips. Simulation of an entire day's worth of realistic vehicular itineraries involving approximately five billion simulated events executes in less than an hour of wall-clock time on a distributed computing cluster. Initial results suggest almost linear speed-ups with cluster size.