A Simplified Cellular Automaton Model for City Traffic
Patrice Simon, Kai Nagel
TL;DR
This paper explores how different blockage scheduling schemes affect traffic flow in a cellular automaton model, revealing non-linear relationships and enabling efficient traffic simulation for Dallas.
Contribution
It introduces a simplified cellular automaton model considering various blockage scheduling schemes and applies it to real-world Dallas traffic simulation.
Findings
No linear relationship between green time fraction and throughput.
Different scheduling schemes significantly impact traffic flow.
Efficient traffic simulation method for Dallas developed.
Abstract
We systematically investigate the effect of blockage sites in a cellular automaton model for traffic flow. Different scheduling schemes for the blockage sites are considered. None of them returns a linear relationship between the fraction of ``green'' time and the throughput. We use this information for a fast implementation of traffic in Dallas.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.