A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations

In this paper, we propose a link-node complementarity model for the basic deterministic dynamic user equilibrium (DUE) problem with single-user-class and fixed demands. The model complements link-path formulations that have been widely studied for dynamic user equilibria. Under various dynamic network constraints, especially the exact flow propagation constraints, we show that the continuous-time dynamic user equilibrium problem can be formulated as an infinite dimensional mixed complementarity model. The continuous-time model can be further discretized as a finite dimensional non-linear complementarity problem (NCP). The proposed discrete-time model captures the exact flow propagation constraints that were usually approximated in previous studies. By associating link inflow at the beginning of a time interval to travel times at the end of the interval, the resulting discrete-time model is predictive rather than reactive. The solution existence and compactness condition for the proposed model is established under mild assumptions. The model is solved by an iterative algorithm with a relaxed NCP solved at each iteration. Numerical examples are provided to illustrate the proposed model and solution approach. We particularly show why predictive DUE is preferable to reactive DUE from an algorithmic perspective.     

A new channel allocation scheme for hierarchical wireless networks

A channel allocation scheme for hierarchical wireless networks was proposed in terms of the connection-level quality of service. The channel allocation scheme was analyzed using both horizontal channel borrowing and vertical traffic overflowing. Pre-emptive priority strategies are used to classify real-time services and non-real-time services, real-time service is given higher priority for it is allowed to pre-empt channels used by non-real-time service. Some channel borrowing thresholds and acceptance ratios are used to avoid channel locking or dynamic power control, which can also be dynamically adjusted according to network load. Simula-tion results show that the proposed schemes can improve the system performance.     

方格路网车辆路径在线选择模型及竞争分析

为分析城市方格路网遭遇突发性堵塞下的车辆路径选择问题,应用在线问题与竞争策略的方法建模,设计了2种在线路径选择竞争策略,即方向贪婪策略和多选择移动策略,计算了2种策略的竞争性能比。通过策略竞争分析得出:在发生突发性堵塞的情形下,方向贪婪策略下的费用为最优费用的3倍;利用多选择移动策略在对网络具有实际意义约束条件下的部分情形能够得到最优费用,且在最坏情形下的费用为最优费用的2倍;2种策略的竞争性能比优于以往研究给出的堵塞不可恢复问题竞争比的下界。     

高速公路雾区智能电子诱导系统

高速公路雾区智能电子诱导系统,是由多种高速公路监控设备、入侵探测技术和控制软件构成。采取动态节点探测器对驶入雾区的车辆作为移动物体进行连续检测,根据能见度仪检测的数值控制公路一侧的双色诱导灯转换数量,形成前后车辆的需要保持的安全行车距离,对车辆在雾区行驶实行诱导,旨在保障雾区不封道的情况下车辆行驶,它将有助于我国的智能交通管理的形成。     

三峡水库主要通航支流船舶定线制的设计原则和基本方法

本文参照国际海事组织关于船舶定线制的设计规范和标准,依据《中华人民共和国内河交通安全管理条例》、《中华人民共和国内河避碰规则》等法律、法规,对三峡水库通航支流船舶定线制的设计原则和基本方法,进行了探索和研究。     

三峡水库通航支流实行船舶定线制的必要性和可行性分析

随着三峡工程及一批支流航电枢纽的建设,部分三峡水库通航支流航道条件得到了明显的改善,为改善三峡水库通航支流水域的通航状况,切实解决三峡水库通航支流水域船舶航行、停泊和作业安全出现的新情况,使库区通航支流水上交通事故降低到最小,有必要以三峡水库通航支流水域环境为研究对象,通过对库区航道通航支流水域各种通航条件的深入研究,采取各种措施,确保船舶在三峡水库通航支流航道的安全航行。     

基于逆向重力模型的枢纽机场旅客吞吐量估计方法

为了利用航空OD客流数据精确估计机场旅客吞吐量,描述了全连通线性航线网络和枢纽辐射航线网络,根据枢纽机场之间的OD客流矩阵,建立了逆向重力模型标准代数算法和基于哈密顿图原理的简化代数算法,分析了在不同距离修正指数下,算法的拟合与估计精度。分析结果表明:简化代数算法与模型标准代数算法最优吞吐量回归直线的可决系数都为0.84,斜率分别为0.91和0.87,比较接近。可见算法的拟合效果优良,估计精度高,且简化代数算法需要的数据少,尤其适合大规模OD矩阵分析。     

航班延误恢复调度的混合粒子群算法

为了优化航班延误恢复调度,考虑了航班延误的经济效益、社会影响和经济损失构成,定义了航线影响因子,构建了一种新的航班延误恢复调度模型,将局部搜索方法引入到粒子群算法中,提出了求解航班延误恢复调度问题的混合粒子群算法。计算结果表明:与先来先服务调度方法相比,混合粒子群算法可以减少航班延误损失4.2%,与基本粒子群算法和进化策略算法相比,混合粒子群算法平均可减少航班延误损失2.0%,随着航班延误恢复规模的增大,算法优势会更明显。     

终端区飞机排序的混合人工鱼群算法

为了保障飞行安全,对终端区着陆飞机进行有效的排序,建立了以航班延误总时间最小为目标函数的规划模型,以人工鱼群算法为基础,融合了遗传算法的选择操作和模拟退火算法的依概率接受的思想,形成混合人工鱼群算法,对着陆飞机排序问题进行了仿真计算,并与先到先服务算法、模拟退火算法以及蚁群算法进行了对比研究。仿真结果表明:与先到先服务相比,使用人工鱼群算法使得单跑道、双跑道延误分别减少了9·3%和48·0%,计算时间小于3s;与蚁群算法和模拟退火算法相比,求解的延误与时间最小,因此,提出的混合算法可行。     

Quantitative Analysis of impact of Bicycles on Vehicles in Urban Mixed Traffic

Bicycles create obvious impact on motor vehicles' behavior on urban road especially in China with mixed traffic. These influences can be divided into two states: friction and block interference. Based on the data of interference of bicycles on vehicles' driving in typical road section in Beijing, this paper quantitatively analyzes the velocity changing tendency of vehicles under different interference, velocity distribution frequency, and critical transformation of different interference state. The friction and block interference coefficients are also worked out, which are useful to compare interference degrees under different road conditions. As a result, the research based on sample data shows that the velocity distribution of vehicles has different characteristics under different interference state, and vehicles driving velocities are significantly different under the friction interference and block interference.