典型潮汐车流路段可变车道设置方案研究

通过对成都市蜀西路实地交通调查,在分析其交通流量、服务水平等交通特性的基础上,根据设置可变车道的相关要求,论证了可变车道设置的可行性。提出了可变车道的具体设计方案并进行了实施效果仿真实验,以达到缓解蜀西路早晚高峰交通拥挤状况的目的。     

城区无信号交叉口次要道路通行能力计算模型

无信号交叉口的次要道路往往有不同的车道功能划分组合,现有的通行能力计算模型不能真正解决混合交通流在其上的最大通过能力计算问题。以可接受间隙理论为基础,利用概率论方法,对直左、直右等合用车道功能组的通行能力计算模型进行了探讨,通过对小型车、大型车构成的混合车流在不同合用车道上的转向队型分析,建立了该类交叉口主路车流服从负指数分布下的支路通行能力模型,从而发展了无信号交叉口的混合车流通行能力理论,为现代化的城市、公路交通管理提供了理论依据。     

高职院校共享型校内实训基地建设研究

文章分析了共享性实训基地的定位,提出了当前共享性实训基地存在的问题及应对措施,并提出了共享性实训基地的运行管理策略。     

山地城市平交口进出口道设计方法研究

鉴于平交口的车行压力大,通过对平交口进出口道设计优化进行研究,并提出相应的措施,能较大提高平交口的通行能力,有效缓解山地城市平交口排队过长的现象.     

考虑右转车流的交叉口交通岛比选设计

交通岛设计的关键是确定右转车流在进口道分流区及出口道合流区的交通组织,在此基础上进行方案设计和通行能力评价。目前的设计缺乏对在不同右转流量条件下方案优化和比选时的定量化分析。本文提出右转车流在不同交通组织条件下的四种交通岛设计方案,并采用通行能力模型对进口道分流区及出口道合流区通行能力进行评价,提供不同右转车流需求下的交通岛最佳设计方案。算例结果表明:随着右转车流量的变化,本文提出的四种交通设计方案与右转车流的四个流量区间一一对应,能够满足复杂条件下的城市交通精细化设计需求,解决了目前设计单一化、非定量化的弊端。     

通行能力仿真中的换道模型研究

道路通行能力是在饱和交通流下得到的,而目前交通微观仿真中缺少分析饱和流状况下的换道模型,从分析饱和流下换道行为的特性出发,建立了饱和流率下的换道模型。该模型在需求判断中用累积的速度优势代替了传统模型的瞬间速度优势,避免了仿真中车辆在短时间内频繁换道的现象;在可行性检测中加入了前后间距不足时司机的减速行为,与传统模型相比该模型能更好地反映拥挤流下的换道行为,更适合于道路通行能力的仿真。     

ETC系统缴费方式随机选择模型

针对组合式收费系统中驾驶员缴费方式的随机选择行为,以排队论与非集计理论为基础,建立电子收费(Electronic Toll Collection,ETC)系统缴费方式随机选择模型及均衡状态求解算法。通过均衡分析与灵敏度分析探讨了ETC技术的采用对道路使用者的技术选择与车道选择行为所产生的影响,所得结果可为ETC系统的规划和管理提供帮助。     

Implications of path tolerance and path characteristics on critical vehicle manoeuvres

Path planning and path following are core components in safe autonomous driving. Typically, a path planner provides a path with some tolerance on how tightly the path should be followed. Based on that, and other path characteristics, for example, sharpness of curves, a speed profile needs to be assigned so that the vehicle can stay within the given tolerance without going unnecessarily slow. Here, such trajectory planning is based on optimal control formulations where critical cases arise as on-the-limit solutions. The study focuses on heavy commercial vehicles, causing rollover to be of a major concern, due to the relatively high centre of gravity. Several results are obtained on required model complexity depending on path characteristics, for example, quantification of required path tolerance for a simple model to be sufficient, quantification of when yaw inertia needs to be considered in more detail, and how the curvature rate of change interplays with available friction. Overall, in situations where the vehicle is subject to a wide range of driving conditions, from good transport roads to more tricky avoidance manoeuvres, the requirements on the path following will vary. For this, the provided results form a basis for real-time path following.     

Development of realistic shortest path algorithm considering lane changes

Lane changes occur as many times as turning movements are needed while following a designated path. The cost of a route with many lane changes is likely to be more expensive than that with less lane changes, and unrealistic paths with impractical lane changes should be avoided for drivers' safety. In this regard, a new algorithm is developed in this study to find the realistic shortest path considering lane changing. The proposed algorithm is a modified link‐labeling Dijkstra algorithm considering the effective lane‐changing time that is a parametric function of the prevailing travel speed and traffic density. The parameters were estimated using microscopic traffic simulation data, and the numerical test demonstrated the performance of the proposed algorithm. It was found that the magnitude of the effect of the effective lane‐changing time on determining the realistic shortest path is nontrivial, and the proposed algorithm has capability to exclude links successfully where the required lane changes are practically impossible. Copyright © 2015 John Wiley & Sons, Ltd.     

A Cooperative Intelligent Transport Systems (C‐ITS)‐based lane‐changing advisory for weaving sections

Weaving sections, a common design of motorways, require extensive lane‐change manoeuvres. Numerous studies have found that drivers tend to make their lane changes as soon as they enter the weaving section, as the traffic volume increases. Congestion builds up as a result of this high lane‐changing concentration. Importantly, such congestion also limits the use of existing infrastructure, the weaving section downstream. This behaviour thus affects both safety and operational aspects. The potential tool for managing motorways effectively and efficiently is cooperative intelligent transport systems (C‐ITS). This research investigates a lane‐change distribution advisory application based on C‐ITS for weaving vehicles in weaving sections. The objective of this research is to alleviate the lane‐changing concentration problem by coordinating weaving vehicles to ensure that such lane‐changing activities are evenly distributed over the existing weaving length. This is achieved by sending individual messages to drivers based on their location to advise them when to start their lane change. The research applied a microscopic simulation in aimsun to evaluate the proposed strategy's effectiveness in a one‐sided ramp weave. The proposed strategy was evaluated using different weaving advisory proportions, traffic demands and penetration rates. The evaluation revealed that the proposed lane‐changing advisory has the potential to significantly improve delay. Copyright © 2016 John Wiley & Sons, Ltd.