238 research outputs found

    Traffic flow modeling and forecasting using cellular automata and neural networks : a thesis presented in partial fulfillment of the requirements for the degree of Master of Science in Computer Science at Massey University, Palmerston North, New Zealand

    Get PDF
    In This thesis fine grids are adopted in Cellular Automata (CA) models. The fine-grid models are able to describe traffic flow in detail allowing position, speed, acceleration and deceleration of vehicles simulated in a more realistic way. For urban straight roads, two types of traffic flow, free and car-following flow, have been simulated. A novel five-stage speed-changing CA model is developed to describe free flow. The 1.5-second headway, based on field data, is used to simulate car-following processes, which corrects the headway of 1 second used in all previous CA models. Novel and realistic CA models, based on the Normal Acceptable Space (NAS) method, are proposed to systematically simulate driver behaviour and interactions between drivers to enter single-lane Two-Way Stop-Controlled (TWSC) intersections and roundabouts. The NAS method is based on the two following Gaussian distributions. Distribution of space required for all drivers to enter intersections or roundabouts is assumed to follow a Gaussian distribution, which corresponds to heterogeneity of driver behaviour. While distribution of space required for a single driver to enter an intersection or roundabout is assumed to follow another Gaussian distribution, which corresponds to inconsistency of driver behavior. The effects of passing lanes on single-lane highway traffic are investigated using fine grids CA. Vehicles entering, exiting from and changing lanes on passing lane sections are discussed in detail. In addition, a Genetic Algorithm-based Neural Network (GANN) method is proposed to predict Short-term Traffic Flow (STF) in urban networks, which is expected to be helpful for traffic control. Prediction accuracy and generalization ability of NN are improved by optimizing the number of neurons in the hidden layer and connection weights of NN using genetic operations such as selection, crossover and mutation

    Characteristics of Vehicular Traffic Flow at a Roundabout

    Full text link
    We construct a stochastic cellular automata model for the description of vehicular traffic at a roundabout designed at the intersection of two perpendicular streets. The vehicular traffic is controlled by a self-organized scheme in which traffic lights are absent. This controlling method incorporates a yield-at-entry strategy for the approaching vehicles to the circulating traffic flow in the roundabout. Vehicular dynamics is simulated within the framework of the probabilistic cellular automata and the delay experienced by the traffic at each individual street is evaluated for specified time intervals. We discuss the impact of the geometrical properties of the roundabout on the total delay. We compare our results with traffic-light signalisation schemes, and obtain the critical traffic volume over which the intersection is optimally controlled through traffic light signalisation schemes.Comment: 10 pages, 17 eps figures. arXiv admin note: text overlap with arXiv:cond-mat/040107

    Efficiency of Roundabouts as Compared to Traffic Light Controlled Intersections in Urban Road Networks

    Get PDF
    Evaluating the performance of a multi-lane intersection is important to identify the best scheme as congestion is becoming a worldwide serious problem. A Multi-stream Minimum Acceptable Space (MMAS) Cellular Automata (CA) model is used for the simulation of vehicular traffic at double-lane roundabouts and cross intersection. Comparison is made between roundabouts with traffic light and without traffic light and signalized intersections on the basis of their performance to simplify traffic congestion. Computer simulations are used to propose critical arrival rates to separate between the three mentioned modes to decrease congestion at intersection points.Keywords: Traffic flow, Roundabout, Throughput, Multi-stream Minimum Acceptable Space, Cellular Automat

    Heterogenous motorised traffic flow modelling using cellular automata

    Get PDF
    Traffic congestion is a major problem in most major cities around the world with few signs that this is diminishing, despite management efforts. In planning traffic management and control strategies at urban and inter urban level, understanding the factors involved in vehicular progression is vital. Most work to date has, however, been restricted to single vehicle-type traffic. Study of heterogeneous traffic movements for urban single and multi-lane roads has been limited, even for developed countries and motorised traffic mix, (with a broader spectrum of vehicle type applicable for cities in the developing world). The aim of the research, presented in this thesis, was thus to propose and develop a model for heterogeneous motorised traffic, applicable to situations, involving common urban and interurban road features in the western or developed world. A further aim of the work was to provide a basis for comparison with current models for homogeneous vehicle type. A two-component cellular automata (2-CA) methodology is used to examine traffic patterns for single-lane, multi-lane controlled and uncontrolled intersections and roundabouts. In this heterogeneous model (binary mix), space mapping rules are used for each vehicle type, namely long (double-unit length) and short (single-unit length) vehicles. Vehicle type is randomly categorised as long (LV) or short (SV) with different fractions considered. Update rules are defined based on given and neighbouring cell states at each time step, on manoeuvre complexity and on acceptable space criteria for different vehicle types. Inclusion of heterogeneous traffic units increases the algorithm complexity as different criteria apply to different cellular elements, but mixed traffic is clearly more reflective of the real-world situation. The impact of vehicle mix on the overall performance of an intersection and roundabout (one-lane one-way, one-lane two-way and two-lane two-way) has been examined. The model for mixed traffic was also compared to similar models for homogeneous vehicle type, with throughput, queue length and other metrics explored. The relationship between arrival rates on the entrance roads and throughput for mixed traffic was studied and it was found that, as for the homogeneous case, critical arrival rates can be identified for various traffic conditions. Investigation of performance metrics for heterogeneous traffic (short and long vehicles), can be shown to reproduce main aspects of real-world configuration performance. This has been validated, using local Dublin traffic data. The 2-CA model can be shown to simulate successfully both homogeneous and heterogeneous traffic over a range of parameter values for arrival, turning rates, different urban configurations and a distribution of vehicle types. The developed model has potential to extend its use to linked transport network elements and can also incorporate further motorised and non-motorised vehicle diversity for various road configurations. It is anticipated that detailed studies, such as those presented here, can support efforts on traffic management and aid in the design of optimisation strategies for traffic flow

    Modelling unsignalised traffic flow with reference to urban and interurban networks

    Get PDF
    A new variant of cellular automata (CA) models is proposed, based on Minimum Acceptable Space (MAP) rules, to study unsignalised traffic flow at two-way stop-controlled (TWSC) intersections and roundabouts in urban and interurban networks. Categorisation of different driver behaviour is possible, based on different space requirements (MAPs), which allow a variety of conditions to be considered. Driver behaviour may be randomly categorised as rational, (when optimum conditions of entry are realised), conservative, urgent and radical, with specified probabilities at each time step. The model can successfully simulate both heterogeneous and inconsistent driver behaviour and interactions at the different road features. The impact of driver behaviour on the overall performance of intersections and roundabouts can be quantified and conditions for gridlock determined. Theorems on roundabout size and throughput are given. The relationship between these measures is clearly non-monotonic. Whereas previous models consider these road features in terms of T-intersections, our approach is new in that each is a unified system. Hence, the relationship between arrival rates on entrance roads can be studied and critical arrival rates can be identified under varied traffic and geometric conditions. The potential for extending the model to entire urban and interurban networks is discussed

    Continuous cellular automata on irregular tessellations : mimicking steady-state heat flow

    Get PDF
    Leaving a few exceptions aside, cellular automata (CA) and the intimately related coupled-map lattices (CML), commonly known as continuous cellular automata (CCA), as well as models that are based upon one of these paradigms, employ a regular tessellation of an Euclidean space in spite of the various drawbacks this kind of tessellation entails such as its inability to cover surfaces with an intricate geometry, or the anisotropy it causes in the simulation results. Recently, a CCA-based model describing steady-state heat flow has been proposed as an alternative to Laplace's equation that is, among other things, commonly used to describe this process, yet, also this model suffers from the aforementioned drawbacks since it is based on the classical CCA paradigm. To overcome these problems, we first conceive CCA on irregular tessellations of an Euclidean space after which we show how the presented approach allows a straightforward simulation of steady-state heat flow on surfaces with an intricate geometry, and, as such, constitutes an full-fledged alternative for the commonly used and easy-to-implement finite difference method, and the more intricate finite element method
    • 

    corecore