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.     

基于宜兴市居民出行特征的客运交通发展对策研究

居民出行调查是城市交通规划、建设和管理的基本依据．本文根据宜兴市2002年居民出行调查的有关数据,对人均出行次数、平均出行时耗、出行方式构成、出行目的和出行时间分布等进行了分析,并在此基础上,结合宜兴市交通现状及城市总体规划,从优先发展公共交通、重视自行车交通、控制摩托丰发展、加强交通管制、强化市场机制、加强企业管理和政府扶持相结合以及颁布公交行业服务标准等方面,提出了宜兴市客运交通发展的几点对策．     

湖北城际铁路动车组选型与交路优化研究

以湖北城际铁路为例,通过比照区间运行速度、参考我国高级动车的技术配置合理选择车型,并优化原交路,最终对原、现两种方案的成本效益对比分析,实证表明,该方案有助于减少动车购置成本,降低亏损,并简化原有运输组织工作.     

深圳市交通需求管理政策的法治思考

深圳市制定和实施了若干小汽车交通需求管理政策,完善相关政策的法制保障成为政策实施的关键问题。首先结合深圳市交通需求管理实践经验,梳理小汽车增量调控、停车收费政策的制定与实施情况。指出交通需求管理政策的制定与实施面临经济杠杆存在法理争议、行政手段法律依据不足和程序合法性存疑等法治障碍。进而提出在国家层面构建交通管理法治体系、在地方层面完善法律法规以及规范交通需求管理政策出台程序等完善路径。     

考虑多人相互影响的舰船通道最短路径规划

将时间维引入既定舰船通道网络,把考虑多人相互影响的动态最优路径规划问题转化为时间依赖网络中的最优路径搜索问题。首先,论文的算法为所有人员随机生成走行路径,为了预测网络中的弧(路段)的走行时间,按人员速度从慢到快的顺序依次计算并记录人员到达路径中的各路段首节点的时刻,先记录到的人员将成为后记录到的人员的动态障碍。然后,将遗传算法与网络中弧的走行时间预测方法相结合,借助遗传算法的个体多样性天然地解决了人员走行任意性问题,因而获得了全局动态最优路径算法,并仿真计算了两人以及三人的最短时间路径;经与不考虑人员间相互影响时获得的最优路径相比较,论文的算法获得了人员遇到障碍时(或跟行或绕行)的最优走行路径。最后,借助时间依赖网络中的最优路径充要条件定理,说明了算法的有效性。     

基于乘客路径选择的多制式轨道交通客流分配

为量化换乘对乘客出行路径选择的影响程度,在单层网络中添加虚拟换乘站,构建无隐性连接的三层多制式轨道交通拓扑网络模型.基于时间、换乘节点衔接性,计算线网间衔接性系数;利用Dijkstra法搜索模型各起讫点间的K短路径,以乘客感受到的线网复杂度及乘客出行计划确定时间,建立乘客对线网的熟悉度函数;根据乘客路径选择影响因素构建...     

多点后方交会法在地铁竖井联系测量中的应用

竖井联系测量工作的可操作性及准确性对矿山法隧道施工至关重要.以广州市轨道交通21号线某标段2号隧道为研究对象,基于施工竖井结构及现场环境的特殊性,对用于辅助测量的4根钢丝距离和角度进行观测,再利用多点后方交会及钢丝坐标传递原理实现井上和井下坐标传递.研究表明,在隧道开挖至40～60 m、100～150 m、贯通前150...