Travel Time Estimation Modelling under Heterogeneous Traffic: A Case Study of Urban Traffic Corridor in Surat, India

Achievement of fast and reliable travel time on urban road network is one of the major objectives for a transport planner against the enormous growth in vehicle population and urban traffic in most of the metropolitan cities in India. Urban arterials or main city corridors are subjected to heavy traffic flow resulting in degradation of traffic quality in terms of vehicular delays and increase in travel time. Since the Indian roadway traffic is characterized by heterogeneity with dominance of 2Ws (Two wheelers) and 3Ws (Auto rickshaw), travel times are varying significantly. With this in background, the present paper focuses on identification of travel time attributes such as heterogeneous traffic, road side friction and corridor intersections for recurrent traffic condition and to develop an appropriate Corridor Travel Time Estimation Model using Multi-Linear Regression (MLR) approach. The model is further subjected to sensitivity analysis with reference to identified attributes to realize the impact of the identified attributes on travel time so as to suggest certain measures for improvement

Bimodal traffic regulation system: A multi-agent approach

International audienceThe development of surface public transportation networks is a major issue in terms of ecology, economy and society. Their quality in terms of punctuality and passengers services (regularity between buses) should be improved in order to improve their attractiveness. To do so, cities often use regulation systems at intersections that grant priority to buses. The problem is that each transportation mode has its own characteristics and a dedicated decision support system. Therefore, most of them hardly take into account both public transport vehicles such as buses and private vehicle traffic. This paper proposes a multi-agent model that supports bimodal regulation and preserves monomodal regulation. The objective is to improve global traffic, to reduce bus delays and to improve bus regularity in congested areas of the network. In our approach, traffic regulation is obtained thanks to communication, collaboration and negotiation between heterogeneous agents. We tested our strategy on a complex network of nine junctions. The results of the simulation are presented

Macroscopic modelling and robust control of bi-modal multi-region urban road networks

The paper concerns the integration of a bi-modal Macroscopic Fundamental Diagram (MFD) modelling for mixed traffic in a robust control framework for congested single- and multi-region urban networks. The bi-modal MFD relates the accumulation of cars and buses and the outflow (or circulating flow) in homogeneous (both in the spatial distribution of congestion and the spatial mode mixture) bi-modal traffic networks. We introduce the composition of traffic in the network as a parameter that affects the shape of the bi-modal MFD. A linear parameter varying model with uncertain parameter the vehicle composition approximates the original nonlinear system of aggregated dynamics when it is near the equilibrium point for single- and multi-region cities governed by bi-modal MFDs. This model aims at designing a robust perimeter and boundary flow controller for single- and multi-region networks that guarantees robust regulation and stability, and thus smooth and efficient operations, given that vehicle composition is a slow time-varying parameter. The control gain of the robust controller is calculated off-line using convex optimisation. To evaluate the proposed scheme, an extensive simulation-based study for single- and multi-region networks is carried out. To this end, the heterogeneous network of San Francisco where buses and cars share the same infrastructure is partitioned into two homogeneous regions with different modes of composition. The proposed robust control is compared with an optimised pre-timed signal plan and a single-region perimeter control strategy. Results show that the proposed robust control can significantly: (i) reduce the overall congestion in the network; (ii) improve the traffic performance of buses in terms of travel delays and schedule reliability, and; (iii) avoid queues and gridlocks on critical paths of the network

Emergency vehicle lane pre-clearing: From microscopic cooperation to routing decision making

Emergency vehicles (EVs) play a crucial role in providing timely help for the general public in saving lives and avoiding property loss. However, very few efforts have been made for EV prioritization on normal road segments, such as the road section between intersections or highways between ramps. In this paper, we propose an EV lane pre-clearing strategy to prioritize EVs on such roads through cooperative driving with surrounding connected vehicles (CVs). The cooperative driving problem is formulated as a mixed-integer nonlinear programming (MINP) problem aiming at (i) guaranteeing the desired speed of EVs, and (ii) minimizing the disturbances on CVs. To tackle this NP-hard MINP problem, we formulate the model in a bi-level optimization manner to address these two objectives, respectively. In the lower-level problem, CVs in front of the emergency vehicle will be divided into several blocks. For each block, we developed an EV sorting algorithm to design optimal merging trajectories for CVs. With resultant sorting trajectories, a constrained optimization problem is solved in the upper-level to determine the initiation time/distance to conduct the sorting trajectories. Case studies show that with the proposed algorithm, emergency vehicles are able to drive at a desired speed while minimizing disturbances on normal traffic flows. We further reveal a linear relationship between the optimal solution and road density, which could help to improve EV routing decision makings when high-resolution data is not available

Identification and Analysis of Queue Spillovers in City Street Networks

We propose a methodology for identifying queue spillovers in city street networks with signalized intersections using data from conventional surveillance systems, such as counts and occupancy from loop detectors. The key idea of the proposed methodology is that when spillovers from a downstream link block vehicle departures from the upstream signal line, queues discharge at rates smaller than the saturation flow. The application of the methodology on an arterial site and the comparison with field data show that it consistently identifies spillovers in urban networks with signal-controlled intersections. The method is extended to account for the variations in vehicle lengths. We also investigate the significant effect of spillovers in congestion and show that a macroscopic diagram that connects spillovers with vehicle density exists in large-scale congested urban networks

On the estimation of arterial route travel time distribution with Markov chains

Recent advances in the probe vehicle deployment offer an innovative prospect for research in arterial travel time estimation. Specifically, we focus on the estimation of probability distribution of arterial route travel time, which contains more information regarding arterial performance measurements and travel time reliability. One of the fundamental contributions of this work is the integration of travel time correlation of route's successive links within the methodology. In the proposed technique, given probe vehicles travel times of the traversing links, a two-dimensional (2D) diagram is established with data points representing travel times of a probe vehicle crossing two consecutive links. A heuristic grid clustering method is developed to cluster each 2D diagram to rectangular sub spaces (states) with regard to travel time homogeneity. By applying a Markov chain procedure, we integrate the correlation between states of 2D diagrams for successive links. We then compute the transition probabilities and link partial travel time distributions to obtain the arterial route travel time distribution. The procedure with various probe vehicle sample sizes is tested on two study sites with time dependent conditions, with field measurements and simulated data. The results are very close to the Markov chain procedure and more accurate once compared to the convolution of links travel time distributions for different levels of congestion, even for small penetration rates of probe vehicles. (C) 2012 Elsevier Ltd. All rights reserved

Artificial intelligence enabled automatic traffic monitoring system

The rapid advancement in the field of machine learning and high-performance computing have highly augmented the scope of video-based traffic monitoring systems. In this study, an automatic traffic monitoring system is proposed that deploys several state-of-the-art deep learning algorithms based on the nature of traffic operation. Taking advantage of a large database of annotated video surveillance data, deep learning-based models are trained to track congestion, detect traffic anomalies and tabulate vehicle counts. To monitor traffic queues, this study implements a Mask region-based convolutional neural network (Mask R-CNN) that predicts congestion using pixel-level segmentation masks on classified regions of interest. Similarly, the model was used to accurately extract traffic queue-related information from infrastructure mounted video cameras. The use of infrastructure-mounted CCTV cameras for traffic anomaly detection and verification is further explored. Initially, a convolutional neural network model based on you only look once (YOLO), a popular deep learning framework for object detection and classification is deployed. The following identification model, together with a multi-object tracking system (based on intersection over union -- IOU) is used to search for and scrutinize various traffic scenes for possible anomalies. Likewise, several experiments were conducted to fine-tune the system's robustness in different environmental and traffic conditions. Some of the techniques such as bounding box suppression and adaptive thresholding were used to reduce false alarm rates and refine the robustness of the methodology developed. At each stage of our developments, a comparative analysis is conducted to evaluate the strengths and limitations of the proposed approach. Likewise, IOU tracker coupled with YOLO was used to automatically count the number of vehicles whose accuracy was later compared with a manual counting technique from CCTV video feeds. Overall, the proposed system is evaluated based on F1 and S3 performance metrics. The outcome of this study could be seamlessly integrated into traffic system such as smart traffic surveillance system, traffic volume estimation system, smart work zone management systems, etc.by Vishal MandalIncludes bibliographical reference

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale urban network is modeled as R homogeneous regions with the macroscopic fundamental diagrams (MFDs) representation. The MFD provides for homogeneous network regions a unimodal, low-scatter relationship between network vehicle density and network space-mean flow. In this paper, the optimal hybrid control problem for an R-region MFD network is formulated as a mixed-integer nonlinear optimization problem, where two types of controllers are introduced: 1) perimeter controllers and 2) switching signal timing plans controllers. The perimeter controllers are located on the border between the regions, as they manipulate the transfer flows between them, while the switching controllers influence the dynamics of the urban regions, as they define the shape of the MFDs and as a result affect the internal flows within each region. Moreover, to decrease the computational complexity due to the nonlinear and nonconvex nature of the optimization problem, we reformulate the problem as a mixed-integer linear programming (MILP) problem utilizing piecewise affine approximation techniques. Two different approaches for transformation of the original model and building up MILP problems are presented, and the performances of the approximated methods along with the original problem formulation are evaluated and compared for different traffic scenarios of a two-region urban case study