高速路网不停车收费车道优化布设方法

合理设置高速公路收费站ETC (Electronic Toll Collection)车道数量，对高速公路通行效率至关重要。针对目前路网中ETC与MTC (Manual Toll Collection)车辆混行的情况，考虑ETC的普及率，结合多用户路网均衡模型和排队论方法，建立基于双层规划模型的高速路网ETC车道优化布设方法。上层模型以车辆总通行时间最小为目标，优化设置进出收费站的ETC车道数量；下层模型为多用户路网均衡模型，反映ETC和MTC车辆的路径和收费车道选择行为。下层模型通过设计收费站的等价拓扑结构，表征收费站的车道使用规则及车辆的收费车道选择行为，并采用排队论方法估计ETC和MTC车道的收费排队时间。根据模型的特点设计了基于主动集的启发式算法，利用参数二进制与拉格朗日函数法确定迭代下降方向，解决了下降方向与步长难以计算的问题；通过内嵌优化函数的方式，保证在主动集转化过程中上层约束均不会失效，且避免了迭代过程中的模型解退化问题。基于上海市绕城高速进行实证分析，结果表明：随着ETC普及率的提升，收费排队时长按照负指数趋势下降；与按比例布设ETC车道的方法相比，所提方法最高可降低57.4%的收费排队时间，且该方法可以避免ETC车道布设过多对于MTC车道通行能力挤压造成的负面效果。研究成果可以有效指导高速路网ETC车道的布设，提高路网通行效率。     

城市大型医院周边道路交通问题剖析及改善对策——以深圳市为例

为了合理科学组织医院周边及内部交通,避免重现目前深圳大型医院周边普遍存在的交通拥堵、停车困难、进院车辆排队、的士乘坐不便等交通问题,以深圳市为例,分析现状大型医院周边存在的道路交通问题和产生原因,提出完善周边道路交通设施、大力发展公共交通、合理规划医院布局、建立科学有效的交通组织体系等改善对策.     

Cost scaling based successive approximation algorithm for the traffic assignment problem

This paper presents a cost scaling based successive approximation algorithm, called ε-BA (ε-optimal bush algorithm), to solve the user equilibrium traffic assignment problem by successively refining ε-optimal flows. As ε reduces to zero, the user equilibrium solution is reached. The proposed method is a variant of bush-based algorithms, and also a variant of the min-mean cycle algorithm to solve the min-cost flow by successive approximation. In ε-BA, the restricted master problem, implying traffic equilibration restricted on a bush, is solved to ε-optimality by cost scaling before bush reconstruction. We show that ε-BA can reduce the number of flow operations substantially in contrast to Dial’s Algorithm B, as the former operates flows on a set of deliberately selected cycles whose mean values are sufficiently small. Further, the bushes can be constructed effectively even if the restricted master problem is not solved to a high level of convergence, by leveraging the ε-optimality condition. As a result, the algorithm can solve a highly precise solution with faster convergence on large-scale networks compared to our implementation of Dial’s Algorithm B.     

Formal scientific research of traffic collision data utilizing GIS

This paper explores the tenuous link between speeding behavior and accident causation, one that has not been well established in the international literature to date. Taking advantage of established engineering conventions and formulae, we were able to set up an a priori hypothesis suitable for testing. Utilizing this formal scientific method (which GIS researchers have been criticised for not using) we establish a statistical link for this relationship. Our methodology can be used to support all police intervention strategies, including the controversial photo radar systems. The results from our research have been entered into a GIS in order to create a map for spatial display. This map illustrates the relative probability or risk of collision occurrence resulting from speeding at all intersections and interchanges within the scope of the study. It is suggested that this methodology could easily be maintained with periodic updates of data, thus creating a dynamic model from which to monitor traffic safety within the city. Furthermore, this model can be utilized to study specific strategies, allowing for the scrutiny of before, during and after effects. The study area is the entire city of Calgary, Alberta, Canada, and includes all traffic collisions occurring during the year of 1994.     

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.     

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.     

水中悬浮隧道交通荷载模拟方法研究

为研究水中悬浮隧道交通荷载的合理模拟方法以及交通荷载对隧道结构的影响,借鉴铁路、公路交通荷载的模拟方法,综合考虑车辆轮载、路面不平度、行车速度以及外部激励荷载等影响因素的共同作用,提出水中悬浮隧道交通荷载的模拟表达式。通过数值模拟计算,分析悬浮隧道交通荷载的变化特征,并研究不同交通荷载模拟方法对悬浮隧道结构振动位移响应的影响。结果表明:文章提出的交通荷载模拟方法计算结果符合移动振动荷载的波动性和周期性特征。在对结构振动位移响应影响方面,固定均布荷载相当于静载,移动集中荷载和移动振动荷载时的位移变化幅值相对固定均布荷载时的大且影响相似,但移动振动荷载时的振幅稍大,体现了交通荷载中动荷载部分对结构振动位移响应的影响,更适合用来模拟悬浮隧道中的交通荷载。     

信息化战争交通重点目标防护的对策

针对信息化战争条件下战场透明化和打击精确化的特点,从建立和完善"综合集成" 的防护体系、完善伪装防护技术手段、适时做好交通保障器材的储备和更新等方面,提出了交通重点目标防护应采取的技术措施和应对精确打击的相关对策.     

城市灯控平面交叉口的自行车交通设计研究

城市灯控平面交叉口混合交通流安全和效率的核心研究对象应该是自行车与机动车交通流间的相互影响。本丈在大量的理论分析和实践的基础上,探讨时空分离法的自行车交通设计的基本原则和交通空间设计方法,即自行车右转弯专用车道设计、左转自行车二次过街以及自行车与行人过街一体化设计,并进行了南京市太平北路与珠江路交叉口的应用实例分析。本文的城市灯控平面交叉口自行车的交通设计方法可为解决城市灯控平面交叉口混合交通问题提供借鉴。