A fast simulation model for traffic flow on the basis of boolean operations

M. Cremer and J. Ludwig

Mathematics and Computers in Simulation (MATCOM), 1986, vol. 28, issue 4, 297-303

Abstract: A fast simulation model for the dynamic process of traffic flow through urban networks is presented. The model simulates the progression of cars on a street by moving 1 bit variables through binary positions of bytes in the storage which are arranged to copy the topology of a specified network. Skillful application of boolean operations enable the model to perform diverse movements of a vehicle like driving at a constant speed, lane changing, passing, decelerating and accelerating, queueing and turning at intersections. The model simulates accurately macroscopic phenomena of traffic flow while at the same time reproducing the main mechanisms of microscopic models. The computational requirements are rather low with respect to both storage and computation time making it possible to simulate large traffic networks on personal computers.

Date: 1986
References: View complete reference list from CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475486900510
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:28:y:1986:i:4:p:297-303

DOI: 10.1016/0378-4754(86)90051-0

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().