Method for investigating intradriver heterogeneity using vehicle trajectory data: A Dynamic Time Warping approach

After first extending Newell’s car-following model to incorporate time-dependent parameters, this paper describes the Dynamic Time Warping (DTW) algorithm and its application for calibrating this microscopic simulation model by synthesizing driver trajectory data. Using the unique capabilities of the DTW algorithm, this paper attempts to examine driver heterogeneity in car-following behavior, as well as the driver’s heterogeneous situation-dependent behavior within a trip, based on the calibrated time-varying response times and critical jam spacing. The standard DTW algorithm is enhanced to address a number of estimation challenges in this specific application, and a numerical experiment is presented with vehicle trajectory data extracted from the Next Generation Simulation (NGSIM) project for demonstration purposes. The DTW algorithm is shown to be a reasonable method for processing large vehicle trajectory datasets, but requires significant data reduction to produce reasonable results when working with high resolution vehicle trajectory data. Additionally, singularities present an interesting match solution set to potentially help identify changing driver behavior; however, they must be avoided to reduce analysis complexity.     

Globally energy-optimal speed planning for road vehicles on a given route

This paper provides a globally optimal solution to an important problem: given a real-world route, what is the most energy-efficient way to drive a vehicle from the origin to the destination within a certain period of time. Along the route, there may be multiple stop signs, traffic lights, turns and curved segments, roads with different grades and speed limits, and even leading vehicles with pre-known speed profiles. Most of such route information and features are actually constraints to the optimal vehicle speed control problem, but these constraints are described in two different domains. The most important concept in solving this problem is to convert the distance-domain route constraints to some time-domain state and input constraints that can be handled by optimization methods such as dynamic programming (DP). Multiple techniques including cost-to-go function interpolation and parallel computing are used to reduce the computation of DP and make the problem solvable within a reasonable amount of time on a personal computer.     

Real-time traffic network state estimation and prediction with decision support capabilities: Application to integrated corridor management

This paper presents a real-time traffic network state estimation and prediction system with built-in decision support capabilities for traffic network management. The system provides traffic network managers with the capabilities to estimate the current network conditions, predict congestion dynamics, and generate efficient traffic management schemes for recurrent and non-recurrent congestion situations. The system adopts a closed-loop rolling horizon framework in which network state estimation and prediction modules are integrated with a traffic network manager module to generate efficient proactive traffic management schemes. The traffic network manger adopts a meta-heuristic search mechanism to construct the schemes by integrating a wide variety of control strategies. The system is applied in the context of Integrated Corridor Management (ICM), which is envisioned to provide a system approach for managing congested urban corridors. A simulation-based case study is presented for the US-75 corridor in Dallas, Texas. The results show the ability of the system to improve the overall network performance during hypothetical incident scenarios.     

Simplified analytical method for evaluating web girder crushing during ship collision and grounding

The paper presents a simplified analytical method to examine the crushing resistance of web girders subjected to local static or dynamic in-plane loads. A new theoretical model, inspired by existing simplified approaches, is developed to describe the progressive plastic deformation behaviour of web girders. It is of considerable practical importance to estimate the extent of structural deformation within ship web girders during collision and grounding accidents. In this paper, new formulae to evaluate this crushing force are proposed on the basis of a new folding deformation mode. The folding deformation of web girders is divided into two parts, plastic deformation and elastic buckling zones, which are not taken into account for in the existing models. Thus, the proposed formulae can well express the crushing deformation behaviour of the first and subsequent folds. They are validated with experimental results of web girder found in literature and actual numerical simulations performed by the explicit LS-DYNA finite element solver. The elastic buckling zone, which absorbs almost zero energy, is captured and confirmed by the numerical results. In addition, the analytical method derives expressions to estimate the average strain rate of the web girders during the impact process and evaluates the material strain rate sensitivity with the Cowper-Symonds constitutive model. These adopted formulae, validated with an existing drop weight impact test, can well capture the dynamic effect of web girders.     

Paradoxes of reservation-based intersection controls in traffic networks

Reservation-based intersection control is a revolutionary idea for using connected autonomous vehicle technologies to improve intersection controls. Vehicles individually request permission to follow precise paths through the intersection at specific times from an intersection manager agent. Previous studies have shown that reservations can reduce delays beyond optimized signals in many demand scenarios. The purpose of this paper is to demonstrate that signals can outperform reservations through theoretical and realistic examples. We present two examples that exploit the reservation protocol to prioritize vehicles on local roads over vehicles on arterials, increasing the total vehicle delay. A third theoretical example demonstrates that reservations can encourage selfish route choice leading to arbitrarily large queues. Next, we present two realistic networks taken from metropolitan planning organization data in which reservations perform worse than signals. We conclude with significantly positive results from comparing reservations and signals on the downtown Austin grid network using dynamic traffic assignment. Overall, these results indicate that network-based analyses are needed to detect adverse route choices before traffic signals can be replaced with reservation controls. In asymmetric intersections (e.g. local road-arterial intersections), reservation controls can cause several potential issues. However, in networks with more symmetric intersections such as a downtown grid, reservations have great potential to improve traffic.     

A real-time system for monitoring driver fatigue

ABSTRACT

This paper presents a nonintrusive prototype computer vision system for real-time fatigue driving detection. First, we use Haar-like features to detect a driver’s face and conduct tracking by introducing an improved Camshift algorithm. Second, we propose a new eye-detection algorithm that combines the Adaboost algorithm with template matching to reduce computational costs and add an eye-validation process to increase the accuracy of the detection rate. Third, and different from other methods focusing on detecting eyes using the ‘bright pupil’ effect, which only works well only for certain constrained lighting conditions, our method detects and estimates the iris center in the hue (H) channel of the hue, saturation, value color space and fits the iris with an ellipse. After extracting the eye fatigue features, we calculate the PERCLOS measurement for fatigue evaluation. This system has been tested on the IMM Face Database, which contains more than 200 faces, and in a real-time test. The experimental results show that the system possesses good accuracy and robustness.     

Optimization of airport bus timetable in cultivation period considering passenger dynamic airport choice under conditions of uncertainty

An airport bus service, which is newly introduced in a multi-airport region, commonly leads to a gradually increasing market share of airports until a new state of equilibrium is reached. With the goal of speeding up and enlarging the increase in market share, this paper proposes a timetable optimization model by incorporating reactions of airport-loyal passengers to bus service quality. The simulation part of the model, which uses cumulative prospect theory to formulate discrete airport choices, results in predicted passenger demand needed in the optimization part. Then a genetic algorithm for multi-objective optimization problems called NSGA-II is applied to solve the model. To illustrate the model, the “Lukou airport-Wuxi” airport bus in China is taken as an example. The results show that the optimized timetables shorten the cultivation period and impel the market share to grow rapidly.     

Preferences for shared autonomous vehicles

Shared autonomous vehicles (SAVs) could provide inexpensive mobility on-demand services. In addition, the autonomous vehicle technology could facilitate the implementation of dynamic ride-sharing (DRS). The widespread adoption of SAVs could provide benefits to society, but also entail risks. For the design of effective policies aiming to realize the advantages of SAVs, a better understanding of how SAVs may be adopted is necessary. This article intends to advance future research about the travel behavior impacts of SAVs, by identifying the characteristics of users who are likely to adopt SAV services and by eliciting willingness to pay measures for service attributes. For this purpose, a stated choice survey was conducted and analyzed, using a mixed logit model. The results show that service attributes including travel cost, travel time and waiting time may be critical determinants of the use of SAVs and the acceptance of DRS. Differences in willingness to pay for service attributes indicate that SAVs with DRS and SAVs without DRS are perceived as two distinct mobility options. The results imply that the adoption of SAVs may differ across cohorts, whereby young individuals and individuals with multimodal travel patterns may be more likely to adopt SAVs. The methodological limitations of the study are also acknowledged. Despite a potential hypothetical bias, the results capture the directionality and relative importance of the attributes of interest.     

Dynamic green bike repositioning problem – A hybrid rolling horizon artificial bee colony algorithm approach

This paper introduces a new dynamic green bike repositioning problem (DGBRP) that simultaneously minimizes the total unmet demand of the bike-sharing system and the fuel and CO₂ emission cost of the repositioning vehicle over an operational period. The problem determines the route and the number of bikes loaded and unloaded at each visited node over a multi-period operational horizon during which the cycling demand at each node varies from time to time. To handle the dynamic nature of the problem, this study adopts a rolling horizon approach to break down the proposed problem into a set of stages, in which a static bike repositioning sub-problem is solved in each stage. An enhanced artificial bee colony (EABC) algorithm and a route truncation heuristic are jointly used to optimize the route design in each stage, and the loading and unloading heuristic is used to tackle the loading and unloading sub-problem along the route in a given stage. Numerical results show that the EABC algorithm outperforms Genetic Algorithm in solving the routing sub-problem. Computation experiments are performed to illustrate the effect of the stage duration on the two objective values, and the results show that longer stage duration leads to higher total unmet demand and total fuel and CO₂ emission cost. Numerical studies are also performed to illustrate the effects of the weight and the loading and unloading times on the two objective values and the tradeoff between the two objectives.     

摆式列车线路检测信号的动态自适应滤波研究

为提高摆式列车检测系统的精度,针对传统数字滤波器的不足,将非平稳随机信号时变模型参数的自适应估计与普通卡尔曼滤波算法相结合,提出一种能有效消除或削弱测量信号中高斯白噪声的卡尔曼动态自适应滤波方法及数学模型。实时建模精度是实现卡尔曼动态滤波的关键。通过对具有不同遗忘因子的递推最小二乘算法的分析和比较,结果表明,带自适应遗忘因子的递推最小二乘算法(RLSAF)由于其遗忘因子能根据信号本身的统计特性的变化自适应地进行调整,因而对非平稳随机信号具有很强的跟踪性能。采用基于RL-SAF算法的卡尔曼动态自适应滤波方法,能实现摆式列车线路检测信号(陀螺仪角速率信号)的有效滤波。