Simulation of Traffic Flow by Cellular Automata and its Control.
Naofumi YAMAMOTO, Shin MORISHITA · TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C · 1999
This paper describes traffic flow simulation by Cellular Automata, where the traffic flow emerges considering just interactions among each vehicle in the flow, and the flow is controlled by optimizing the period of traffic signals with the help of Genetic Algorithm. Cellular Automata are mathematical systems characterized by discreteness, local interactions and an inherently parallel form of evolution All the parameters in analytical space, time and state variables are treated as discrete ones, and the whole phenomena can be emerged considering just local neighbor rules among state variables defined on each divided area called "cell". In the present paper, various types of road module, such as crossing, straight road or T-type intersection were prepared as analytical space for Cellular Automata and the traffic flow was simulated on arbitrarily comPosed road module system. Furthermore, the period of traffic signals on the road system was optimized by Genetic Algorithm so that the number of moving cars might be maximized and at the same time the waiting cars minimized.