๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by M. Cremer; J. Ludwig


Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
677 KB
Volume
28
Category
Article
ISSN
0378-4754

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


Numerical algorithms for simulations of
โœ G. Bretti; R. Natalini; B. Piccoli ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 158 KB

We introduce a simulation algorithm based on a fluid-dynamic model for traffic flows on road networks, which are considered as graphs composed by arcs that meet at some junctions. The approximation of scalar conservation laws along arcs is made by three velocities Kinetic schemes with suitable bound

A wavelet-Galerkin method for the kinema
โœ Wong, G. C. K. ;Wong, S. C. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 178 KB ๐Ÿ‘ 1 views

In this paper, a wavelet-Galerkin formulation with domain transformation is applied to solve the kinematic wave model of tra$c #ow. A domain transformation method is employed to resolve the constraints imposed on the solution variables. This avoids the problem of generating invalid solution of tra$c