Models for dynamic network loading and algorithms for traffic signal synchronization

The effectiveness of optimization strongly relies on the underlying model of the phenomenon. According to this, a considerable effort has been spent in improving the General Link Transmission Model (Gentile, 2008) to address urban networks, intersection and lane modelling and multimodal simulation. A genetic algorithm with a formulation tailored on the signal coordination problem has been integrated with the simulation engine. So, a practical and effective multi-objective optimization tool for traffic signal coordination is here presented

Models for dynamic network loading and algorithms for traffic signal synchronization

The effectiveness of optimization strongly relies on the underlying model of the phenomenon. According to this, a considerable effort has been spent in improving the General Link Transmission Model (Gentile, 2008) to address urban networks, intersection and lane modelling and multimodal simulation. A genetic algorithm with a formulation tailored on the signal coordination problem has been integrated with the simulation engine. So, a practical and effective multi-objective optimization tool for traffic signal coordination is here presented

Road network equilibrium approaches to environmental sustainability

Environmental sustainability is closely related to transportation, especially to the road network, because vehicle emissions and noise damage the environment and have adverse effects on human health. It is, therefore, important to take their effect into account when designing and managing road networks. Road network equilibrium approaches have been used to estimate this impact and to design and manage road networks accordingly. However, no comprehensive review has summarized the applications of these approaches to the design and management of road networks that explicitly address environmental concerns. More importantly, it is necessary to identify this gap in the literature so that future research can improve the existing methodologies. Hence, this paper summarizes these applications and identifies potential future research directions in terms of theories, modelling approaches, algorithms, analyses, and applications.postprin

A mesoscopic whole link continuous vehicle bunch model for multiclass traffic flow simulation on motorway networks

Modeling of heterogeneous driver behaviour is vital to understanding of dynamic traffic phenomenon taking place on motorway networks. In this research, we present a mesoscopic whole link continuous vehicle bunch model for multiclass traffic flow simulation on motorway networks. Two main attributes of traffic flow classification have been used are: (i) vehicle type, specifying in turn a vehicle length and, together with type of a preceding vehicle, time headway; and, (ii) desired speed, defining together with the speeds of the neighbouring vehicles, the vehicle acceleration/deceleration mode. It is assumed that vehicles in uncongested to moderate congested flow move in bunches dividing the drivers into the two main groups: (i) independent “free” drivers which usually manifest themselves as leaders of bunches; and, (ii) followers, or drivers which adapt their speed to the leader’s speed and follow each other at constrained headways specified by predecessor/successor pairs. The model proposes a solution to arbitrary traffic queries involving a motion in bunches having various speed and size by assuming the rate of driver arrivals follows semi-Poisson distribution and proportion of free drivers is predefined. The solution, assuming limited overtaking possibilities for all drivers, involves formation of longer queue behind bunches moving with slower speed and transformation of some of the “leaders” into “followers” because of adjustment their speed to the speed of the preceding slow-moving bunches. The present solution considers both stochastic and deterministic features of traffic flow and, therefore, may be easily extended to a specific uncertainty level

Vehicle class wise speed-volume models for heterogeneous traffic

Link performance functions commonly used for traffic assignment are often based on Volume Delay Functions (VDF) developed for homogeneous traffic. However, VDFs relating stream speed to the volume of traffic based on homogeneous lane-based traffic are not adequate for traffic assignment in developing countries due to the heterogeneous nature of traffic that is characterized by a mix of a wide range of vehicle classes with significant differences in static and dynamic characteristics and an imperfect lane discipline. Unfortunately, the use of VDFs similar to those for homogeneous traffic flow situations imposes strong restrictions considering two respects: 1) travel times at path and link levels can be obtained for an aggregated stream but not for individual vehicle types; 2) the effect of varying composition and asymmetric interactions is captured only to a limited extent by converting all vehicles into equivalent Passenger Car Unit (PCU). Hence, this paper proposes the development of VDFs specific to different classes of heterogeneous traffic, as it is more realistic in traffic assignment than the use of the same VDF for all classes of vehicles in a link. This study is aimed at developing models to determine the speed of each vehicle class as a function of flow and composition for six lane roads with heterogeneous traffic based on data obtained from Chennai city, India. Heterogeneity in this study mainly refers to differences in vehicle types (two-wheeler, car, bus, etc.) participating in mixed traffic. To develop multiple user class VDFs, the speed and flow of each vehicle class for a wide range of traffic flow conditions need to be recorded. As this is not possible using field measurements, an established micro-simulation model (HETEROSIM) is used for determining speeds for each vehicle type by systematically varying the volume and composition levels over a range of values that represent relevant and practical traffic conditions observed in six lane divided roads in Chennai city. The proposed delay functions are different from standard single user class VDFs in three key respects: first, they enable more realistic behaviour by modelling differences in class wise speeds at a given volume and composition level; second, they allow for capturing asymmetric interactions of different vehicle types on an average speed of a given vehicle class. Finally, speed-flow relationships for each class are also allowed to vary across volume levels which enable the representation of differential interactions at different levels of congestion in mixed traffic. The need for homogenizing the volumes in terms of a single class is obviated. The models significantly outperformed single class VDFs in both calibration and validation datasets. Further, the proposed models are used for analyzing heterogeneous traffic characteristics. Empirical evidence of asymmetric interactions and the impact of composition on classwise performance are also found and quantified. Finally, two applications of the proposed models are demonstrated for the level of service analysis of different classes and impact analysis of excluding some classes. The proposed models may have applications such as determining class wise road user costs and performance measures (e.g. emissions) that depend on class-specific speeds

A mesoscopic traffic simulation based dynamic traffic assignment

XII Premio Abertis en gestión de infraestructuras de Transporte en la modalidad de tesis doctoral, 2014In terms of sustainability, traffic is currently a significant challenge for urban areas, where the pollution, congestion and accidents are negative externalities which have strongly impacted the health and economy of cities. The increasing use of private vehicles has further exacerbated these problems. In this context, the development of new strategies and policies for sustainable urban transport has made transport planning more relevant than ever before. Mathematical models have helped greatly in identifying solutions, as well as in enriching the process of making decisions and planning. In particular, dynamic network models provide a means for representing dynamic traffic behavior; in other words, they provide a temporally coherent means for measuring the interactions between travel decisions, traffic flows, travel time and travel cost. This thesis focuses on dynamic traffic assignment (DTA) models. DTA has been studied extensively for decades, but much more so in the last twenty years since the emergence of Intelligent Transport Systems (ITS). The objective of this research is to study and analyze the prospects for improving this problem. In an operational context, the objective of DTA models is to represent the evolution of traffic on a road network as conditions change. They seek to describe the assignment of the demand on different paths which connect every OD pair in a state of equilibrium. The behaviour following each individual decision during a trip is a time-dependent generalization of Wardrop's First Principle, the Dynamic User Equilibrium (DUE). This hypothesis is based on the following idea: When current travel times are equal and minimal for vehicles that depart within the same time interval , the dynamic traffic flow through the network is in a DUE state based on travel times for each OD pair at each instant of time ([ran-1996]). This work begins with the time-continuous variational inequalities model proposed by [friesz-1993] for solving the DUE problem. Different solutions can be used on the proposed DUE formulation. On the one hand, there are the so-called analytical approaches which use known mathematical optimization techniques for solving the problem directly. On the other hand, there are simulation-based formulations that approximate heuristic solutions at a reasonable computational cost. While analytical models concentrate mainly on deriving theoretical insights, simulation-based models focus on trying to build practical models for deployment in real networks. Thus, because the simulation-based formulation holds the most promise, we work on that approach in this thesis. In the field of simulation-based DTA models, significant progress has been made by many researchers in recent decades. Our simulation-based formulation separates the proposed iterative process into two main components: - A method for determining the new time dependent path flows by using the travel times on these paths experienced in the previous iteration. - A dynamic network loading (DNL) method, which determines how these paths flow propagate along the corresponding paths. However, it is important to note that not all computer implementations based on this algorithmic framework provide solutions that obtain DUE. Therefore, while we analyze both proposals in this thesis we focus on the preventive methods of flow reassignment because only those can guarantee DUE solutions. Our proposed simulation-based DTA method requires a DNL component that can reproduce different vehicle classes, traffic light controls and lane changes. Therefore, this thesis develops a new multilane multiclass mesoscopic simulation model with these characteristics, which is embedded into the proposed DUE framework. Finally, the developed mesoscopic simulation-based DTA approach is validated accordingly. The results obtained from the computational experiments demonstrate that the developed methods perform well.En los últimos tiempos, el problema del tráfi co urbano ha situado a las áreas metropolitanas en una difícil situación en cuanto a sostenibilidad se refi ere (en términos de la congestión, los accidentes y la contaminación). Este problema se ha visto acentuado por la creciente movilidad promovida por el aumento del uso del vehículo privado. Además, debido a que la mayor parte del trá fico es canalizada a través de los modos de carretera, el tiempo perdido por los usuarios al realizar sus viajes tiene un importante efecto económico sobre las ciudades. En este contexto, la plani cación de transporte se vuelve relevante a través del desarrollo de nuevas estrategias y políticas para conseguir un transporte urbano sostenible. Los modelos matemáticos son de gran ayuda ya que enriquecen las decisiones de los gestores de trá fico en el proceso de plani ficación. En particular podemos considerar los modelos de trá fico para la predicción, como por ejemplo los modelos de asignación dinámica de tráfi co (ADT), los cuales proveen de una representación temporal coherente de las interacciones entre elecciones de trá fico, fl ujos de trá fico y medidas de tiempo y coste. Esta tesis se centra en los modelos ADT. Durante las últimas décadas, los modelos ADT han sido intensamente estudiados. Este proceso se ha acelerado particularmente en los últimos veinte años debido a la aparición de los Sistemas Inteligentes de Transporte. El objetivo de esta investigación es estudiar y analizar diferentes posibilidades de mejorar la resolución del problema. En un contexto operacional, el objetivo de los modelos ADT es representar la evolución de la red urbana cuando las condiciones de trá fico cambian. Estos modelos tratan de describir la asignación de la demanda en los diferentes caminos que conectan los pares OD siguiendo un estado de equilibrio. En este caso se ha considerado que el comportamiento de los conductores en cada una de sus decisiones individuales tomadas durante el viaje es una generalización dependiente del tiempo del Primer Principio de Wardrop, denominada Equilibrio Dinámico de Usuario (EDU). Esta hipótesis se basa en la siguiente idea: para cada par OD para cada instante de tiempo, si los tiempos de viaje de todos los usuarios que han partido en ese intervalo de tiempo son iguales y mínimos, entonces el ujo dinámico de trá fico en la red se encuentra en un estado de EDU basado en los tiempos de viaje (Ran and Boyce (1996)). El presente trabajo toma como punto de partida el modelo de inecuaciones variacionales continuo en el tiempo propuesto por Friesz et al. (1993) para resolver el problema de equilibrio dinámico de usuario. Por un lado, se encuentran los denominados enfoques analíticos que utilizan técnicas matemáticas de optimización para resolver el problema directamente. Por otro lado, están los modelos cuyas formulaciones están basadas en simulación que aproximan soluciones heurísticas con un coste computacional razonable. Mientras que modelos analíticos se concentran principalmente en demostrar las propiedades teóricas, los modelos basados en simulación se centran en intentar construir modelos que sean prácticos para su utilización en redes reales. Así pues, debido a que las formulaciones basadas en simulación son las que se muestran más prometedoras a la práctica, en esta tesis se ha elegido este enfoque para tratar el problema ADT. En los últimos tiempos, el campo de los modelos ADT basados en simulación ha sido de especial interés. Nuestra formulación basada en simulación consiste en un proceso iterativo que consta de dos componentes principales, sistematizadas por Florian et al. (2001) como sigue: Un método para determinar los nuevos ujos (dependientes del tiempo) en los caminos utilizando los tiempos de viaje experimentados en esos caminos en la iteración previa. Un procedimiento de carga dinámica de la red (CDR) que determine cómo esos fl ujos se propagan a través de sus correspondientes caminos. Los algoritmos de reasignación de flujo pueden ser agrupados en dos categorías: preventivos y reactivos. Es importante notar aquí que no todas las implementaciones computacionales basadas en el marco algorítmico propuesto proporcionan una solución EDU. Por lo tanto, aunque en esta tesis analizamos ambas propuestas, nos centraremos en los métodos preventivos de reasignación de flujo porque son los que nos garantizan alcanzar la hipótesis considerada (EDU). Además, nuestro modelo ADT basado en simulación requiere de una componente de CDR que pueda reproducir diferentes clases de vehículos, controles semafóricos y cambios de carril. Así, uno de los objetivos de esta tesis es desarrollar un nuevo modelo de simulación de trá fico con dichas características (multiclase y multicarril), teniendo en cuenta que será una de las componentes principales del marco ADT propuesto.Award-winningPostprint (published version

Classification algorithms for Intelligent Transport Systems

Intelligent Transport Systems (ITS) consists in the application of ICT to transport to offer new and improved services to the mobility of people and freights. While using ITS, travellers produce large quantities of data that can be collected and analysed to study their behaviour and to provide information to decision makers and planners. The thesis proposes innovative deployments of classification algorithms for Intelligent Transport System with the aim to support the decisions on traffic rerouting, bus transport demand and behaviour of two wheelers vehicles. The first part of this work provides an overview and a classification of a selection of clustering algorithms that can be implemented for the analysis of ITS data. The first contribution of this thesis is an innovative use of the agglomerative hierarchical clustering algorithm to classify similar travels in terms of their origin and destination, together with the proposal for a methodology to analyse drivers’ route choice behaviour using GPS coordinates and optimal alternatives. The clusters of repetitive travels made by a sample of drivers are then analysed to compare observed route choices to the modelled alternatives. The results of the analysis show that drivers select routes that are more reliable but that are more expensive in terms of travel time. Successively, different types of users of a service that provides information on the real time arrivals of bus at stop are classified using Support Vector Machines. The results shows that the results of the classification of different types of bus transport users can be used to update or complement the census on bus transport flows. Finally, the problem of the classification of accidents made by two wheelers vehicles is presented together with possible future application of clustering methodologies aimed at identifying and classifying the different types of accidents

SOLVING TRAFFIC CONGESTION FROM THE DEMAND SIDE

It is nowadays widely accepted that solving traffic congestion from the demand side is more important and more feasible than offering more capacity or facilities for transportation. Following a brief overview of evolution of the concept of Travel Demand Management (TDM), there is a discussion on the TDM foundations that include demand-side strategies, traveler choice and application settings and the new dimensions that ATDM (Active forms of Transportation and Demand Management) bring to TDM, i.e. active management and integrative management. Subsequently, the authors provide a short review of the state-of-the-art TDM focusing on relevant literature published since 2000. Next, we highlight five TDM topics that are currently hot: traffic congestion pricing, public transit and bicycles, travel behavior, travel plans and methodology. The paper closes with some concluding remarks

Traffic and Related Self-Driven Many-Particle Systems

Since the subject of traffic dynamics has captured the interest of physicists, many astonishing effects have been revealed and explained. Some of the questions now understood are the following: Why are vehicles sometimes stopped by so-called ``phantom traffic jams'', although they all like to drive fast? What are the mechanisms behind stop-and-go traffic? Why are there several different kinds of congestion, and how are they related? Why do most traffic jams occur considerably before the road capacity is reached? Can a temporary reduction of the traffic volume cause a lasting traffic jam? Under which conditions can speed limits speed up traffic? Why do pedestrians moving in opposite directions normally organize in lanes, while similar systems are ``freezing by heating''? Why do self-organizing systems tend to reach an optimal state? Why do panicking pedestrians produce dangerous deadlocks? All these questions have been answered by applying and extending methods from statistical physics and non-linear dynamics to self-driven many-particle systems. This review article on traffic introduces (i) empirically data, facts, and observations, (ii) the main approaches to pedestrian, highway, and city traffic, (iii) microscopic (particle-based), mesoscopic (gas-kinetic), and macroscopic (fluid-dynamic) models. Attention is also paid to the formulation of a micro-macro link, to aspects of universality, and to other unifying concepts like a general modelling framework for self-driven many-particle systems, including spin systems. Subjects such as the optimization of traffic flows and relations to biological or socio-economic systems such as bacterial colonies, flocks of birds, panics, and stock market dynamics are discussed as well.Comment: A shortened version of this article will appear in Reviews of Modern Physics, an extended one as a book. The 63 figures were omitted because of storage capacity. For related work see http://www.helbing.org