Fuzzy cellular model for on-line traffic simulation

This paper introduces a fuzzy cellular model of road traffic that was intended for on-line applications in traffic control. The presented model uses fuzzy sets theory to deal with uncertainty of both input data and simulation results. Vehicles are modelled individually, thus various classes of them can be taken into consideration. In the proposed approach, all parameters of vehicles are described by means of fuzzy numbers. The model was implemented in a simulation of vehicles queue discharge process. Changes of the queue length were analysed in this experiment and compared to the results of NaSch cellular automata model.Comment: The original publication is available at http://www.springerlink.co

Cellular Automata Models of Road Traffic

In this paper, we give an elaborate and understandable review of traffic cellular automata (TCA) models, which are a class of computationally efficient microscopic traffic flow models. TCA models arise from the physics discipline of statistical mechanics, having the goal of reproducing the correct macroscopic behaviour based on a minimal description of microscopic interactions. After giving an overview of cellular automata (CA) models, their background and physical setup, we introduce the mathematical notations, show how to perform measurements on a TCA model's lattice of cells, as well as how to convert these quantities into real-world units and vice versa. The majority of this paper then relays an extensive account of the behavioural aspects of several TCA models encountered in literature. Already, several reviews of TCA models exist, but none of them consider all the models exclusively from the behavioural point of view. In this respect, our overview fills this void, as it focusses on the behaviour of the TCA models, by means of time-space and phase-space diagrams, and histograms showing the distributions of vehicles' speeds, space, and time gaps. In the report, we subsequently give a concise overview of TCA models that are employed in a multi-lane setting, and some of the TCA models used to describe city traffic as a two-dimensional grid of cells, or as a road network with explicitly modelled intersections. The final part of the paper illustrates some of the more common analytical approximations to single-cell TCA models.Comment: Accepted for publication in "Physics Reports". A version of this paper with high-quality images can be found at: http://phdsven.dyns.cx (go to "Papers written"

A CELLULAR AUTOMATA MODELS OF EVOLUTION OF TRANSPORTATION NETWORKS

We present a new approach to modelling o f transportation networks. Supply o f resources and their influence on the evolution o f the consuming environment is a principal problem considered. We present two concepts, which are based on cellular automata paradigm. In thefirst model SCAMAN {Simple CellularAutomata Model ofAnastomosing NetWork), the system is represented by a 2D mesh o f elementary cells. The rules o f interaction between them are introducedfor modelling of the waterflow and other phenomena connected with anastomosing river. Due to limitations o f SCAMAN model, we introduce a supplementary model. The MANGraCA {Model o fAnastomosing NetWork with Graph o f Cellular Automa ta) model beside the classical mesh o f automata, introduces an additional structure: the graph o f cellular automata, which represents the network pattern. Finally we discuss the prospective applications of the models. The concepts offuturę implementation are also presented

The asymmetric exclusion process: Comparison of update procedures

The asymmetric exclusion process (ASEP) has attracted a lot of interest not only because its many applications, e.g. in the context of the kinetics of biopolymerization and traffic flow theory, but also because it is a paradigmatic model for nonequilibrium systems. Here we study the ASEP for different types of updates, namely random-sequential, sequential, sublattice-parallel and parallel. In order to compare the effects of the different update procedures on the properties of the stationary state, we use large-scale Monte Carlo simulations and analytical methods, especially the so-called matrix-product Ansatz (MPA). We present in detail the exact solution for the model with sublattice-parallel and sequential updates using the MPA. For the case of parallel update, which is important for applications like traffic flow theory, we determine the phase diagram, the current, and density profiles based on Monte Carlo simulations. We furthermore suggest a MPA for that case and derive the corresponding matrix algebra.Comment: 47 pages (11 PostScript figures included), LATEX, Two misprints in equations correcte

A comparative analysis of parallel processing and super-individual methods for improving the computational performance of a large individual-based model

Individual-based modelling approaches are being used to simulate larger complex spatial systems in ecology and in other fields of research. Several novel model development issues now face researchers: in particular how to simulate large numbers of individuals with high levels of complexity, given finite computing resources. A case study of a spatially-explicit simulation of aphid population dynamics was used to assess two strategies for coping with a large number of individuals: the use of ‘super-individuals’ and parallel computing. Parallelisation of the model maintained the model structure and thus the simulation results were comparable to the original model. However, the super-individual implementation of the model caused significant changes to the model dynamics, both spatially and temporally. When super-individuals represented more than around 10 individuals it became evident that aggregate statistics generated from a super-individual model can hide more detailed deviations from an individual-level model. Improvements in memory use and model speed were perceived with both approaches. For the parallel approach, significant speed-up was only achieved when more than five processors were used and memory availability was only increased once five or more processors were used. The super-individual approach has potential to improve model speed and memory use dramatically, however this paper cautions the use of this approach for a density-dependent spatially-explicit model, unless individual variability is better taken into account

A Cellular Automata Agent-Based Hybrid Simulation Tool to Analyze the Deployment of Electric Vehicle Charging Stations

We present a hybrid model combining cellular automata (CA) and agent-based modeling (ABM) to analyze the deployment of electric vehicle charging stations through microscopic traffic simulations. This model is implemented in a simulation tool called SIMTRAVEL, which allows combining electric vehicles (EVs) and internal combustion engine vehicles (ICEVs) that navigate in a city composed of streets, avenues, intersections, roundabouts, and including charging stations (CSs). Each EV is modeled as an agent that incorporates complex behaviors, such as decisions about the route to destination or CS, when to drive to a CS, or which CS to choose. We studied three different CS arrangements for a synthetic city: a single large central CS, four medium sized distributed CSs or multiple small distributed CSs, with diverse amounts of traffic and proportions of EVs. The simulator output is found to be robust and meaningful and allows one to extract a first useful conclusion: traffic conditions that create bottlenecks around the CSs play a crucial role, leading to a deadlock in the city when the traffic density is above a certain critical level. Our results show that the best disposition is a distributed network, but it is fundamental to introduce smart routing measures to balance the distribution of EVs among CSs.Ministerio de Ciencia e Innovación TIN2017-89842PMinisterio de Ciencia e Innovación PID2019-110455GB-I0

Decentralized and adaptive sensor data routing

Wireless sensor network (WSN) has been attracting research efforts due to the rapidly increasing applications in military and civilian fields. An important issue in wireless sensor network is how to send information in an efficient and adaptive way. Information can be directly sent back to the base station or through a sequence of intermediate nodes. In the later case, it becomes the problem of routing. Current routing protocols can be categorized into two groups, namely table-drive (proactive) routing protocols and source-initiated on-demand (reactive) routing. For ad hoc wireless sensor network, routing protocols must deal with some unique constraints such as energy conservation, low bandwidth, high error rate and unpredictable topology, of which wired network might not possess. Thus, a routing protocol, which is energy efficient, self-adaptive and error tolerant is highly demanded. A new peer to peer (P2P) routing notion based on the theory of cellular automata has been put forward to solve this problem. We proposed two different models, namely Spin Glass (Physics) inspired model and Multi-fractal (Chemistry) inspired model. Our new routing models are distributed in computation and self-adaptive to topological disturbance. All these merits can not only save significant amount of communication and computation cost but also well adapt to the highly volatile environment of ad hoc WSN. With the cellular automata Cantor modeling tool, we implemented two dynamic link libraries (DLL) in C++ and the corresponding graphic display procedures in Tcl/tk. Results of each model’s routing ability are discussed and hopefully it will lead to new peer to peer algorithms, which can combine the advantages of current models

Traffic Prediction Based on a Local Exchange of Information

We propose a decentralized method for traffic monitoring, fully distributed over the vehicles. An algorithm is provided, specifying which information should be tracked to reconstruct an instantaneous map of traffic flow. We test the accuracy of our method in a simple cellular automata traffic simulation model, for which the traffic condition can be controlled and analyzed theoretically. We show how local communication parameters affect the method accuracy