Approximate network loading and dual-time-scale dynamic user equilibrium

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.     

考虑延误折算方式的公交车站布置形式选择方法

公交车辆在进出站过程中与非机动车之间的干扰对交通运行产生重要影响.针对公交车进出3种布置形式车站时的机非混行交通系统,阐述该3种系统机非干扰形式与延误产生机理;基于公共交通和私人交通出行效益最大化,以机非混行系统延误为目标,构建基于2种延误折算方式的系统延误模型;并利用VISSIM软件完成84个仿真场景用于描述这3种公交车站布置形式下的延误影响效果.仿真数据表明,3种公交站布置形式下混行系统的延误随着机动车和非机动车流量的增加呈现不同的增长趋势.案例分析表明,本文提出的延误模型可应用于分析与判断不同机非流量条件下公交车站布置形式的选择.     

信号交叉口行人过街优化组织实证研究

对信号交叉口行人交通进行优化组织不仅可以提升交叉口的整体运行效率,缓解城市交通拥堵,同时也体现了"以人为本"的交通组织内涵.本文首先分析了信号交叉口行人过街行为,指出信号交叉口处行人过街信号灯和行人过街设施存在的问题,然后提出了相应的改善措施:合理设置机动车信号灯与行人信号灯相位、优化行人过街设施.最后以北京市车公庄大街-车公庄北街交叉口为例,从改善信号灯相位和增加行人二次过街设施两个方面来优化交叉口行人交通.改善后,过街行人的绿灯时间增加了33.3%,行人过街效率显著提高.     

偏压隧道处治措施及稳定性分析

以上瑞高速公路怀新段第8合同段青山冲隧道为工程实例,针对左线出口端洞口浅埋偏压情况,为了节约工程投资,实施了反压回填的处治方案,采用数值模拟分析及现场监控量测数据分析了偏压隧道支护结构的受力状态和稳定性,可供类似工程参考.     

基于ECR模型的常规公交站点服务信息重要度研究

常规公交站点处的服务信息能够引导乘客出行,对站点服务信息进行研究并加以改善,能够提升公共交通整体的服务水平。文章通过对现有研究的归纳,总结出理论上站点应呈现的信息内容,对站点信息进行分析归类。结合理论研究,通过问卷调查的方式探究出行者心中各项服务信息的重要程度,应用ECR算法结合ISM分析得到调查中各信息项的重要程度分层排序。根据不同站点候车乘客的不同信息需求,提出不同站点应设置的信息内容。     

复杂环境下石方控制爆破施工技术

文中结合通灌铁路路堑石方控制爆破施工,根据当地环境条件和地质条件,采用深孔台阶控制爆破施工技术,并根据试验和爆破效果分析,总结了符合现场条件的爆破参数、操作要点及安全防护措施。在通灌铁路复杂环境下石方路堑施工中,高效快速地完成了爆破施工作业,且路堑边坡平整稳定,取得了良好的安全爆破效果,经济、环境效益显著。     

彩信技术在交通违法主动告知中的应用

由于目前的交通违法告知方法存在着信息不对称问题,导致车辆驾驶人不能实时获知自己的交通违法情况,故可能出现自身的重复性交通违法或由套牌车辆的交通违法而被高额罚款。为此,本文提出了一个基于GPRS MODEM通讯技术的彩信发布系统。作者采用C#.net开发了图像处理模块,对电子警察系统抓拍的违法原始图片进行切割并压缩,构成...     

城市快速路匝道合流区与基本路段交通流特征对比

基于快速路实测数据和微观仿真数据,从交通流基本图、交通流状态空间传播、匝道与主线流量关系和车道横向分布特征4个方面对比了匝道合流区与基本路段的交通流特征.结论表明:由于匝道车辆汇入的影响,匝道合流区与基本路段的交通流特征存在较大的差别,在城市快速路的规划、设计、管理和控制中都应该区别对待.     

锂离子电池应用于潜艇动力可行性分析

本文总结了锂离子动力电池特点,分析了潜艇环境对锂离子动力电池提出的要求,立足我国现有锂离子动力电池产业现状,简要梳理了我国锂离子动力电池在潜艇上应用所面临的问题,并得出体积比能量与电池安全性是锂离子动力电池装艇应用需要解决的关键问题的结论.     

潜艇新型作战系统发展构想

本文分析了潜艇作战系统的现状及发展趋势,并提出了对未来潜艇新型作战系统的功能目标和体系架构的发展设想和研究思路.