信号交叉口增量延误分析

为了对交通信号控制参数进行优化,需对交叉口延误进行定量分析与计算.对已有的平面信号交叉口增量延误模型提出了改进,并且对该模型进行了校正.针对交叉口处于非饱和与过饱和状态下的交通状况,用排队论分析并推导了交叉口增量延误公式.其结果既完善了现有的延误计算理论,又可为设置信号相位提供理论依据.     

车辆侧翻的运动力学分析及预防措施

车辆转弯发生侧翻是最常见、最严重的交通事故之一。对车辆转弯的4种运动状态进行了力学分析，对“车轮下的奇迹”进行科学的压力测算，提出了防止车辆侧翻的具体措施。     

斯太尔汽车双前轴转向机构分析及其应用

本文在对斯太尔重型汽车的双轴转向传动机构进行分析的基础上建立了数学模型,研究了各部分的传动过程,并采用MATLAB语言编写了转向传动机构分析程序,对转向轴内外轮之间,前后轮间的转角匹配,以及最小转弯半径的匹配关系进行了优化。     

多车道道路改扩建工程中最优施工区长度的研究

针对道路改扩建工程,在分析施工区总费用的基础上,通过对交通流运行特征的研究,对车辆通过施工区所产生的各种延误分别进行推导,建立了由施工费用以及车辆延误费用构成的总费用函数模型,得到了道路改扩建工程中不同施工组织条件下最优施工区长度计算公式。微观仿真研究示例表明,最优施工区长度计算方法具有较好的适用性和正确性。有效指导道路维护部门的施工作业,起到节约社会总成本的作用。     

A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks

Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.     

基于历史数据的城市轨道交通列车运行扰动影响分析

列车运行过程受到诸多扰动因素的影响,严重时引起列车运行延误,影响乘客出行.为了判别列车运行扰动、评估影响范围和程度,提出了基于城市轨道交通历史数据的分析方法.根据突发事件类扰动及其相关的列车运行、自动售检票等多源数据,分析扰动的产生和影响规律,包括扰动分类、原因和发生规律,以及扰动持续时间、空间范围和客流相对率.典型城...     

信息化条件下的防空武器装备运输线路优化算法

弹药保障,是武器系统战斗力的重要标志。着眼适应未来信息化战争运输保障的特点和要求,应用线性规划和多端网络最大流问题,将运输保障问题抽象为运筹中的线路问题,建立模型,以提高军交运输保障能力。     

Increasing the capacity of signalized intersections with separate left turn phases

A separate turn phase is often used on the approach leg to an intersections with heavy left turns. This wastes capacity on the approach because some of its lanes cannot discharge during its green phases. The paper shows that the problem can be eliminated by reorganizing traffic on all the lanes upstream of an intersection using a mid-block pre-signal. If drivers behave deterministically, the capacity that can be achieved is the same as if there were no left turns. However, if the reorganization is too drastic, it may be counterintuitive to drivers. This can be remedied by reorganizing traffic on just some of the available lanes. It is shown that such partial reorganization still increases capacity significantly, even if drivers behave randomly and only one lane is reorganized. The paper shows how to optimize the design of a pre-signal system for a generic intersection. It also identifies both, the potential benefits of the proposed system for a broad class of intersections, and the domain of application where the benefits are most significant.     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

铁路客运站旅客最高聚集人数计算模型

考虑了旅客出行习惯和列车晚点,建立了铁路客运站旅客最高聚集人数计算模型.在模型中,在出行时,乘坐6:00～9:00出发列车的旅客一般在列车出发前5～60 min到达客运站,乘坐21:00以后出发列车的旅客一般在19:00～21:00达到客运站;在晚点调整时等级越高的列车具有越高的优先权,晚点时间与运行时间成正比.计算结...