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.     

Experimental and empirical investigations of traffic flow instability

Traffic instability is an important but undesirable feature of traffic flow. This paper reports our experimental and empirical studies on traffic flow instability. We have carried out a large scale experiment to study the car-following behavior in a 51-car-platoon. The experiment has reproduced the phenomena and confirmed the findings in our previous 25-car-platoon experiment, i.e., standard deviation of vehicle speeds increases in a concave way along the platoon. Based on our experimental results, we argue that traffic speed rather than vehicle spacing (or density) might be a better indicator of traffic instability, because vehicles can have different spacing under the same speed. For these drivers, there exists a critical speed between 30 km/h and 40 km/h, above which the standard deviation of car velocity is almost saturated (flat) along the 51-car-platoon, indicating that the traffic flow is likely to be stable. In contrast, below this critical speed, traffic flow is unstable and can lead to the formation of traffic jams. Traffic data from the Nanjing Airport Highway support the experimental observation of existence of a critical speed. Based on these findings, we propose an alternative mechanism of traffic instability: the competition between stochastic factors and the so-called speed adaptation effect, which can better explain the concave growth of speed standard deviation in traffic flow.     

Roads in transition: Integrated modeling of a manufacturer-traveler-infrastructure system in a mixed autonomous/human driving environment

This paper develops an integrated model to characterize the market penetration of autonomous vehicles (AVs) in urban transportation networks. The model explicitly accounts for the interplay among the AV manufacturer, travelers with heterogeneous values of travel time (VOTT), and road infrastructure capacity. By making in-vehicle time use more leisurely or productive, AVs reduce travelers’ VOTT. In addition, AVs can move closer together than human-driven vehicles because of shorter safe reaction time, which leads to increased road capacity. On the other hand, the use of AV technologies means added manufacturing cost and higher price. Thus, traveler adoption of AVs will trade VOTT savings with additional out-of-pocket cost. The model is structured as a leader (AV manufacturer)-follower (traveler) game. Given the cost of producing AVs, the AV manufacturer sets AV price to maximize profit while anticipating AV market penetration. Given an AV price, the vehicle and routing choice of heterogeneous travelers are modeled by combining a multinomial logit model with multi-modal multi-class user equilibrium (UE). The overall problem is formulated as a mathematical program with complementarity constraints (MPCC), which is challenging to solve. We propose a solution approach based on piecewise linearization of the MPCC as a mixed-integer linear program (MILP) and solving the MILP to global optimality. Non-uniform distribution of breakpoints that delimit piecewise intervals and feasibility-based domain reduction are further employed to reduce the approximation error brought by linearization. The model is implemented in a simplified Singapore network with extensive sensitivity analyses and the Sioux Falls network. Computational results demonstrate the effectiveness and efficiency of the solution approach and yield valuable insights about transportation system performance in a mixed autonomous/human driving environment.     

Mental models of driving and speed: biases,choices and reality

This paper provides a review of research performed by Svenson with colleagues and others work on mental models and their practical implications. Mental models describe how people perceive and think about the world including covariances and relationships between different variables, such as driving speed and time. Research on mental models has detected the time-saving bias [Svenson, O. (1970). A functional measurement approach to intuitive estimation as exemplified by estimated time savings. Journal of Experimental Psychology, 86, 204–210]. It means that drivers relatively overestimate the time that can be saved by increasing speed from an already high speed, for example, 90–130?km/h, and underestimate the time that can be saved by increasing speed from a low speed, for example, 30–45?km/h. In congruence with this finding, mean speed judgments and perceptions of mean speeds are also biased and higher speeds given too much weight and low speeds too little weight in comparison with objective reality. Replacing or adding a new speedometer in the car showing min per km eliminated or weakened the time-saving bias. Information about braking distances at different speeds did not improve overoptimistic judgments of braking capacity, but information about collision speed with an object suddenly appearing on the road did improve judgments of braking capacity. This is relevant to drivers, politicians and traffic regulators.     

Performance comparison between pedestrian push-button and pre-timed pedestrian crossings at midblock: a Korean case study

Walking has been highlighted as an independent transportation mode as well as an access/egress mode to/from public transit to encourage the use of more sustainable transport systems. However, walking does not seem to have priority over other transportation modes, especially in areas where various modes of movement are in conflict. The pedestrian push-button system seems to be a solution to distribute the right of way. The focus of this study is on the performance issue of the pedestrian push-button. Specifically, this study deals with issues related to mid-block crossings and attempts to answer two questions: whose waiting time is longer at pre-timed and push-button crossings, pedestrians, or vehicles? and which system – pre-timed or push-button – is better in terms of total waiting time? According to our simulation analyses, if the pedestrian flow rate is less than 120, 85, and 70 ped/h for two-, three-, and four-lane roads, respectively, the push-button system is recommended.     

A copula-based approach for estimating the travel time reliability of urban arterial

Estimating the travel time reliability (TTR) of urban arterial is critical for real-time and reliable route guidance and provides theoretical bases and technical support for sophisticated traffic management and control. The state-of-art procedures for arterial TTR estimation usually assume that path travel time follows a certain distribution, with less consideration about segment correlations. However, the conventional approach is usually unrealistic because an important feature of urban arterial is the dependent structure of travel times on continuous segments. In this study, a copula-based approach that incorporates the stochastic characteristics of segments travel time is proposed to model arterial travel time distribution (TTD), which serves as a basis for TTR quantification. First, segments correlation is empirically analyzed and different types of copula models are examined. Then, fitting marginal distributions for segment TTD is conducted by parametric and non-parametric regression analysis, respectively. Based on the estimated parameters of the models, the best-fitting copula is determined in terms of the goodness-of-fit tests. Last, the model is examined at two study sites with AVI data and NGSIM trajectory data, respectively. The results of path TTD estimation demonstrate the advantage of the proposed copula-based approach, compared with the convolution model without capturing segments correlation and the empirical distribution fitting methods. Furthermore, when considering the segments correlation effect, it was found that the estimated path TTR is more accurate than that by the convolution model.     

Fully autonomous vehicles: analyzing transportation network performance and operating scenarios in the Greater Toronto Area,Canada

Fully autonomous vehicles (AVs) have the potential to considerably change urban mobility in the future. This study simulates potential AV operating scenarios in the Greater Toronto Area (GTA), Canada, and assesses transportation system performance on a regional level. For each scenario, the base capacities of certain types of road links are modified to simulate the theoretical increase in throughput enabled by AV driving behavior. Another scenario examines driverless parking operations in downtown Toronto. Simulation results indicate that the increased attractiveness of freeways relative to other routes leads to slightly increased average travel distance as vehicles divert to access higher capacity road links. Average travel time is found to decrease by up to one-fifth at the 90% AV market penetration level. Concurrently, localized increases in congestion suggest that proactive transportation planning will be needed to mitigate negative consequences of AV adoption, especially in relation to induced demand for personal automobile travel.     

港口门机司机绩效考核系统设计

针对某港口企业下属门机队现行绩效考核和管理相对落后的状况提出了有效的改进策略。基于门机作业实时记录,采用Microsoft SQL2005数据库、VC＋＋6．0和水晶报表技术设计了一套司机作业绩效考核软件,实现了对现场采集数据的转换和存储,并结合作业票数据考核门机司机的作业量,自动生成每月的机械队员工工资报表,同时,港口企业通过司机绩效考核软件完成对生产数据的科学、有效的管理。     

Link travel time inference using entry/exit information of trips on a network

This paper studies link travel time estimation using entry/exit time stamps of trips on a steady-state transportation network. We propose two inference methods based on the likelihood principle, assuming each link associates with a random travel time. The first method considers independent and Gaussian distributed link travel times, using the additive property that trip time has a closed-form distribution as the summation of link travel times. We particularly analyze the mean estimates when the variances of trip time estimates are known with a high degree of precision and examine the uniqueness of solutions. Two cases are discussed in detail: one with known paths of all trips and the other with unknown paths of some trips. We apply the Gaussian mixture model and the Expectation–Maximization (EM) algorithm to deal with the latter. The second method splits trip time proportionally among links traversed to deal with more general link travel time distributions such as log-normal. This approach builds upon an expected log-likelihood function which naturally leads to an iterative procedure analogous to the EM algorithm for solutions. Simulation tests on a simple nine-link network and on the Sioux Falls network respectively indicate that the two methods both perform well. The second method (i.e., trip splitting approximation) generally runs faster but with larger errors of estimated standard deviations of link travel times.