基于计算机视觉的驾驶员转向操作实时监测研究

为实时监控驾驶员操纵转向盘的状态，构建了基于机器视觉汽车转向盘实时监控系统，并运用阈值分割和边缘检测方法对转向盘图像中感兴趣区域进行了图像分割，提出了转向盘转角的计算公式。试验结果表明，感兴趣区域图像分割与转向盘转角监测方法有效。     

软弱地层中瑞雷波传播的数值模拟研究

瑞雷波技术已经广泛用于工程物探和质量检测中,但对软弱地层的探测尚缺乏系统深入的研究.本文采用有限差分软件FLAC3D对横向存在软硬分区、表层软弱及软弱夹层3种地层模型作数值模拟,分析了相应地层模型中瑞雷波时域信号传播特征,得出了传播规律.为工程技术人员现场快速时域信号分析提供了帮助.     

公共交通系统营运可靠性研究

优先发展公共交通是大城市解决交通拥堵,实现城市交通可持续发展的一项重要措施,然而,公交营运水平的低下制约着公交的发展。本文借鉴可靠性理论对公共交通营运可靠性进行定义,并对公交营运时间和乘客服务可靠性分别进行了描述,据此建立起公交系统营运可靠性模型,然后采用随机模拟技术(即Monte Carlo模拟)进行求解,通过算例说明模型的可行性,最后通过分析可靠性模型得出大型活动期间改善公交营运的途径。     

大跨度钢管混凝土拱桥地震反应分析

利用有限元法分析大跨度钢管混凝土拱桥的地震反应，考虑了剪切变形的影响，用子空间迭代法分析了其振动规律和动力特性，应用反应谱法和时程分析法分析了该拱桥的地震反应，得出了一些有价值的结论。     

Quantifying travel time variability at a single bottleneck based on stochastic capacity and demand distributions

Travel time reliability, an essential factor in traveler route and departure time decisions, serves as an important quality of service measure for dynamic transportation systems. This article investigates a fundamental problem of quantifying travel time variability from its root sources: stochastic capacity and demand variations that follow commonly used log-normal distributions. A volume-to-capacity ratio-based travel time function and a point queue model are used to demonstrate how day-to-day travel time variability can be explained from the underlying demand and capacity variations. One important finding is that closed-form solutions can be derived to formulate travel time variations as a function of random demand/capacity distributions, but there are certain cases in which a closed-form expression does not exist and numerical approximation methods are required. This article also uses probabilistic capacity reduction information to estimate time-dependent travel time variability distributions under conditions of non-recurring traffic congestion. The proposed models provide theoretically rigorous and practically useful tools for understanding the causes of travel time unreliability and evaluating the system-wide benefit of reducing demand and capacity variability.     

Classification of Livebus arrivals user behavior

With the increasing use of Intelligent Transport Systems, large amounts of data are created. Innovative information services are introduced and new forms of data are available, which could be used to understand the behavior of travelers and the dynamics of people flows. This work analyzes the requests for real-time arrivals of bus routes at stops in London made by travelers using Transport for London's LiveBus Arrivals system. The available dataset consists of about one million requests for real-time arrivals for each of the 28 days under observation. These data are analyzed for different purposes. LiveBus Arrivals users are classified based on a set of features and using K-Means, Expectation Maximization, Logistic regression, One-level decision tree, Decision Tree, Random Forest, and Support Vector Machine (SVM) by Sequential Minimal Optimization (SMO). The results of the study indicate that the LiveBus Arrivals requests can be classified into six main behaviors. It was found that the classification-based approaches produce better results than the clustering-based ones. The most accurate results were obtained with the SVM-SMO methodology (Precision of 97%). Furthermore, the behavior within the six classes of users is analyzed to better understand how users take advantage of the LiveBus Arrivals service. It was found that the 37% of users can be classified as interchange users. This classification could form the basis of a more personalized LiveBus Arrivals application in future, which could support management and planning by revealing how public transport and related services are actually used or update information on commuters.     

Plate scanning tools to obtain travel times in traffic networks

The management of vehicle travel times has been shown to be fundamental to traffic network analysis. To collect travel time measurement, some methods focus solely on isolated links or highway segments, and where two measurement points, at the beginning and at the end of a section, are deemed sufficient to evaluate users' travel time. However, in many cases, transport studies involve networks in which the problem is more complex. This article takes advantage of the plate scanning technique to propose an algorithm that minimizes the required number of registering devices and their location in order to identify vehicles candidates to compute the travel times of a given set of routes (or subroutes). The merits of the proposed method are explained using simple examples and are illustrated by its application to the real network of Ciudad Real.     

Subjective-utility travel time budget modeling in the stochastic traffic network assignment

ABSTRACT

In this article, we propose a new model called subjective-utility travel time budget (SU-TTB) model to capture travelers' risk-averse route choices. In the travel time budget (TTB) and mean-excess travel time (METT) model, a predefined confidence level is needed to capture the risk-aversion in route choice. Due to the day-to-day route travel time variations, the exact confidence level is hard to be predicted. With the SU-TTB model, we assume travelers' confidence level belongs to an interval that they may comply with in the route choice. The two main components of SU-TTB are the utility function and the TTB model. We can show that the SU-TTB can be reduced to the TTB and METT model with proper utility function for the confidence levels. We can also prove its equivalence with our recently proposed nonlinear-expectation route travel time (NERTT) model in some cases and give some new interpretation on the NERTT with this equivalence. Finally, we formulate the SU-TTB model as a variational inequality (VI) problem to model the risk-averse user equilibrium (RAUE), termed as generalized RAUE (GRAUE). The GRAUE is solved via a heuristic gradient projection algorithm, and the model and solution algorithm are demonstrated with the Braess's traffic network and the Nguyen and Dupuis's traffic network.     

Effectiveness of travel time reliability indicators in the light of the assessment of dynamic managed lane strategy

ABSTRACT

The aim of traffic management is to ensure a high quality of service for a maximum number of users by decreasing congestion and increasing safety. Uncertainty of travel times decreases the quality of service and leads end users to modify their plans regardless of the average travel time. Indicators describing travel time reliability are being developed and should be used in the future both for the optimization and for the assessment of active traffic management operations. This article discusses the efficiency of certain reliability indicators in an ex-post assessment of a traffic management strategy. Ex-post assessment is based on an observational before–after study. As some factors other than the studied management strategy may intervene between the two periods, and as most reliability indicators require knowledge of the full travel time distribution and not only its average, a methodology is developed for the identification of the impact of these exogenous factors on the whole distribution. Many reliability indicators are split into different parts allowing the identification of the part due to the management strategy impact. The methodology is tested numerically on a managed lane operation consisting of Hard Shoulder Running (HSR) at rush hour on a section of a French motorway. The variation of some reliability indicators appears misleading, whereas the splitting of the indicators increases our understanding of the strategy and highlights its impact. The paper gives the reliability assessment of the HSR field test and discusses different reliability indicators to identify their potential performances and shortcomings.     

Robust traffic assignment model: Formulation,solution algorithms and empirical application

ABSTRACT

The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.

The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.