京唐城际铁路速度目标值选择

速度目标值是城际铁路最主要技术标准,不同的速度目标值决定了基础设施、设备及各项配套设施的选择。从京唐城际铁路功能定位出发,通过对客流特点、功能定位、时间目标值需求、经济技术比选等多方面因素的分析,综合得出京唐城际铁路速度目标值推荐采用350 km/h的方案。     

基于速度动态函的LTE-R越区切换优化算法

传统的LTE-R越区切换算法,采用固定切换迟滞门限和延迟触发时间的切换算法。但是当列车高速运行时,切换成功率明显下降,无法满足高速铁路无线通信系统对Qo S大于99.5%的要求。通过对切换流程、测量参数、控制参数的分析,提出一种基于速度动态函数的越区切换优化算法。该算法在低速、中速、高速3种列车运行状况下,更适宜高速铁路情景切换时机的选择。仿真结果表明:基于椭圆函数的LTE-R越区切换优化算法,既保证了列车在中高速运行时,越区切换成功率有着明显提升,又避免了列车在中低速运行时,乒乓切换事件频率过高。     

Estimation of delay variability at signalized intersections for urban arterial performance evaluation

Urban arterial performance evaluation has been broadly studied, with the major focus on average travel time estimation. However, in view of the stochastic nature of interrupted flow, the ability to capture the characteristics of travel time variability has become a critical step in determining arterial level of service (LOS). This article first presents a stochastic approach that integrates classic cumulative curves and probability theories in order to investigate delay variability at signalized intersections, as a dominant part of the link travel time variability. This serves as a basis for arterial travel time estimation, which can be obtained through a convolution of individual link travel time distributions. The proposed approach is then applied in the estimation of travel time along one arterial in Shanghai, China, with abundant automatic vehicle identification (AVI) data sources. The travel time variability is evaluated thoroughly at 30-min intervals, with promising results achieved in comparison to the field measurements. In addition, the estimated travel time distributions are utilized to illustrate the probability of multiple LOS ranges, namely, reliability LOS. The results provide insights into how we might achieve a more reliable and informative understanding of arterial performance.     

Subjective-utility travel time budget modeling in the stochastic traffic network assignment

ABSTRACT

In this article, we propose a new model called subjective-utility travel time budget (SU-TTB) model to capture travelers' risk-averse route choices. In the travel time budget (TTB) and mean-excess travel time (METT) model, a predefined confidence level is needed to capture the risk-aversion in route choice. Due to the day-to-day route travel time variations, the exact confidence level is hard to be predicted. With the SU-TTB model, we assume travelers' confidence level belongs to an interval that they may comply with in the route choice. The two main components of SU-TTB are the utility function and the TTB model. We can show that the SU-TTB can be reduced to the TTB and METT model with proper utility function for the confidence levels. We can also prove its equivalence with our recently proposed nonlinear-expectation route travel time (NERTT) model in some cases and give some new interpretation on the NERTT with this equivalence. Finally, we formulate the SU-TTB model as a variational inequality (VI) problem to model the risk-averse user equilibrium (RAUE), termed as generalized RAUE (GRAUE). The GRAUE is solved via a heuristic gradient projection algorithm, and the model and solution algorithm are demonstrated with the Braess's traffic network and the Nguyen and Dupuis's traffic network.     

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.     

基于FDS公路隧道火灾仿真研究

针对公路隧道突发火灾事故问题,采用模拟软件对隧道发生的火灾进行研究。分析火灾条件下公路隧道内被困人群的疏散行为特点,给出隧道内人员疏散的安全依据,按照隧道火灾条件下通风风速不同时火灾烟气蔓延情况,确定火灾可利用疏散时间(ASET),通过分析人员疏散特点计算出所需的疏散时间(RSET),通过对比得出:通风风速至少为3m/s时才能保证人员的安全疏散。     

基于时间约束的铁路空车调配系统可靠性分析

为弥补现有铁路空车调配系统缺乏空车调配可靠性研究的缺陷,在传统空车调配优化模型的基础上,本文提出了一种新的基于时间约束的空车调配可靠性分析方法。通过深入分析铁路空车调配过程,建立效益最大化目标函数,生成约束条件,以规定时间内的实际到达空车数与需求空车数之比计算出各需求站的空车调配可靠性,再利用各需求站可靠性均值求解空车调配系统的可靠性。最后,使用LINGO软件进行算例分析,论证了该方法的可行性和有效性。     

考虑多人相互影响的舰船通道最短路径规划

将时间维引入既定舰船通道网络,把考虑多人相互影响的动态最优路径规划问题转化为时间依赖网络中的最优路径搜索问题。首先,论文的算法为所有人员随机生成走行路径,为了预测网络中的弧(路段)的走行时间,按人员速度从慢到快的顺序依次计算并记录人员到达路径中的各路段首节点的时刻,先记录到的人员将成为后记录到的人员的动态障碍。然后,将遗传算法与网络中弧的走行时间预测方法相结合,借助遗传算法的个体多样性天然地解决了人员走行任意性问题,因而获得了全局动态最优路径算法,并仿真计算了两人以及三人的最短时间路径;经与不考虑人员间相互影响时获得的最优路径相比较,论文的算法获得了人员遇到障碍时(或跟行或绕行)的最优走行路径。最后,借助时间依赖网络中的最优路径充要条件定理,说明了算法的有效性。     

响应谱法与时程法在管道水锤分析中的对比研究

水锤是输流管道中经常发生的现象,由于阀门操作不当或设备突然停车引起的水锤极易引起管道的振动,造成设备及支架的破坏,严重影响管道系统的正常运行。文章运用CAESAERⅡ软件,对管道中的水锤现象分别采用响应谱法和时程分析法进行分析。结果表明:响应谱法有利于对振动响应过大模态的精确控制,时程法能精确求解时间历程内各时刻系统的整体响应。为全面分析水锤对管道应力的影响提供了一个研究思路。     

基于同方差的递增时间序列自回归预测的改善方法

提出了"利用反双曲正弦函数变换提高数据列光滑程度"的新结论,获得了递增时间序列改善的自回归预测新方法。