Cellpath: Fusion of cellular and traffic sensor data for route flow estimation via convex optimization

A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated, then solved using the proposed concept of cellpaths for cellular network data. With this data-driven approach, our proposed approach is versatile: it is compatible with other data sources, and it is model agnostic and thus compatible with user equilibrium, system-optimum, Stackelberg concepts, and other models. Using a dimensionality reduction scheme, we design a projected gradient algorithm suitable for the proposed route flow estimation problem. The algorithm solves a block isotonic regression problem in the projection step in linear time. The accuracy, computational efficiency, and versatility of the proposed approach are validated on the I-210 corridor near Los Angeles, where we achieve 90% route flow accuracy with 1033 traffic sensors and 1000 cellular towers covering a large network of highways and arterials with more than 20,000 links. In contrast to long-term land use planning applications, we demonstrate the first system to our knowledge that can produce route-level flow estimates suitable for short time horizon prediction and control applications in traffic management. Our system is open source and available for validation and extension.     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.     

A modified reinforcement learning algorithm for solving coordinated signalized networks

This study proposes Reinforcement Learning (RL) based algorithm for finding optimum signal timings in Coordinated Signalized Networks (CSN) for fixed set of link flows. For this purpose, MOdified REinforcement Learning algorithm with TRANSYT-7F (MORELTRANS) model is proposed by way of combining RL algorithm and TRANSYT-7F. The modified RL differs from other RL algorithms since it takes advantage of the best solution obtained from the previous learning episode by generating a sub-environment at each learning episode as the same size of original environment. On the other hand, TRANSYT-7F traffic model is used in order to determine network performance index, namely disutility index. Numerical application is conducted on medium sized coordinated signalized road network. Results indicated that the MORELTRANS produced slightly better results than the GA in signal timing optimization in terms of objective function value while it outperformed than the HC. In order to show the capability of the proposed model for heavy demand condition, two cases in which link flows are increased by 20% and 50% with respect to the base case are considered. It is found that the MORELTRANS is able to reach good solutions for signal timing optimization even if demand became increased.     

Large-scale dynamic transportation network simulation: A space-time-event parallel computing approach

This paper describes a computationally efficient parallel-computing framework for mesoscopic transportation simulation on large-scale networks. By introducing an overall data structure for mesoscopic dynamic transportation simulation, we discuss a set of implementation issues for enabling flexible parallel computing on a multi-core shared memory architecture. First, we embed an event-based simulation logic to implement a simplified kinematic wave model and reduce simulation overhead. Second, we present a space-time-event computing framework to decompose simulation steps to reduce communication overhead in parallel execution and an OpenMP-based space-time-processor implementation method that is used to automate task partition tasks. According to the spatial and temporal attributes, various types of simulation events are mapped to independent logical processes that can concurrently execute their procedures while maintaining good load balance. We propose a synchronous space-parallel simulation strategy to dynamically assign the logical processes to different threads. The proposed method is then applied to simulate large-scale, real-world networks to examine the computational efficiency under different numbers of CPU threads. Numerical experiments demonstrate that the implemented parallel computing algorithm can significantly improve the computational efficiency and it can reach up to a speedup of 10 on a workstation with 32 computing threads.     

System energy optimisation strategies for metros with regeneration

Energy and environmental sustainability in transportation are becoming ever more important. In Europe, the transportation sector is responsible for about 30% of the final end use of energy. Electrified railway systems play an important role in contributing to the reduction of energy usage and CO₂ emissions compared with other transport modes. For metro-transit systems with frequently motoring and braking trains, the effective use of regenerated braking energy is a significant way to reduce the net energy consumption. Although eco-driving strategies have been studied for some time, a comprehensive understanding of how regeneration affects the overall system energy consumption has not been developed. This paper proposes a multi-train traction power network modelling method to determine the system energy flow of the railway system with regenerating braking trains. The initial results show that minimising traction energy use is not the same as minimising the system energy usage in a metro system. An integrated optimisation method is proposed to solve the system energy-saving problem, which takes train movement and electrical power flow into consideration. The results of a study of the Beijing Yizhuang metro line indicate that optimised operation could reduce the energy consumption at the substations by nearly 38.6% compared to that used with the existing ATO operation.     

基于神经网络实现交叉口多相位模糊控制

根据城市交叉口交通流的特点，给出了一种交叉口多相位自适应控制算法，综合考虑相邻车道上的车队长度，利用多层BP神经网络实现了道路交叉口多相位模糊控制。仿真结果表明，所设计的模糊神经网络控制器能有效地减少单交叉口平均车辆延误，具有较强的学习和泛化能力。     

Incorporating Driver Behaviors in Network Design Problems: Challenges and Opportunities

The goal of a network design problem (NDP) is to make optimal decisions to achieve a certain objective such as minimizing total travel time or maximizing tolls collected in the network. A critical component to NDP is how travelers make their route choices. Researchers in transportation have adopted human decision theories to describe more accurate route choice behaviors. In this paper, we review the NDP with various route choice models: the random utility model (RUM), random regret-minimization (RRM) model, bounded rationality (BR), cumulative prospect theory (CPT), the fuzzy logic model (FLM) and dynamic learning models. Moreover, we identify challenges in applying behavioral route choice models to NDP and opportunities for future research.     

An efficient and exact event-based algorithm for solving simplified first order dynamic network loading problems in continuous time

In this paper a novel solution algorithm is proposed for exactly solving simplified first order dynamic network loading (DNL) problems for any generalised network. This DNL solution algorithm, termed eLTM (event-based Link Transmission Model), is based on the seminal Lighthill–Witham–Richards (LWR) model, adopts a triangular fundamental diagram and includes a generalised first order node model formulation. Unlike virtually all DNL solution algorithms, eLTM does not rely on time discretisation, but instead adopts an event based approach. The main advantage of this approach is the possibility of yielding exact results. Furthermore, an approximate version of the same algorithm is introduced. The user can configure an a-priori threshold that dictates the approximation error (measurable a-posteriori). Using this approximation the computational effort required decreases significantly, making it especially suitable for large scale applications. The computational complexity is investigated and results are demonstrated via theoretical and real world case studies. Fixed periods of stationary demands are included adopting a matrix demand profile to mimic basic departure time demand fluctuations. Finally, the information loss of the approximate solution is assessed under different configurations.     

Indicators of reliability and vulnerability: Similarities and differences in ranking links of a complex road system

This article investigates two performance attributes of road networks, reliability and vulnerability, analyzing their similarities as well as the differences that justify distinct definitions, based on consolidation of recent studies. We also discuss the indicators found in the literature for these two performance attributes. Since various authors treat vulnerability as an aspect of reliability instead of a specific attribute, we carried out an application to a complex road network representative of the city of Rio de Janeiro to check the suitability of this approach. The results show that the vulnerability indicators are more strongly affected by the characteristics of alternative routes while the reliability metrics are more sensitive to the congestion level. The conclusion is that reliability and vulnerability should be treated distinctly for evaluating the performance of road network links.     

Estimating the influence of common disruptions on urban rail transit networks

With the continuous expansion of urban rapid transit networks, disruptive incidents—such as station closures, train delays, and mechanical problems—have become more common, causing such problems as threats to passenger safety, delays in service, and so on. More importantly, these disruptions often have ripple effects that spread to other stations and lines. In order to provide better management and plan for emergencies, it has become important to identify such disruptions and evaluate their influence on travel times and delays. This paper proposes a novel approach to achieve these goals. It employs the tap-in and tap-out data on the distribution of passengers from smart cards collected by automated fare collection (AFC) facilities as well as past disruptions within networks. Three characteristic types of abnormal passenger flow are divided and analyzed, comprising (1) “missed” passengers who have left the system, (2) passengers who took detours, and (3) passengers who were delayed but continued their journeys. In addition, the suggested computing method, serving to estimate total delay times, was used to manage these disruptions. Finally, a real-world case study based on the Beijing metro network with the real tap-in and tap-out passenger data is presented.