考虑意外事件对交通流影响的元胞自动机交通流模型

在NaSh模型的基础上,考虑交通事故和养护路段等意外事件对高速公路交通流的影响,建立了有意外事件影响的在车道管制下的高速公路交通流元胞自动机模型,并进行数值模拟. 研究发现:意外事件对高速公路交通流有明显影响,并且意外事件对交通流的影响在某一密度值范围内尤其明显,且意外事件堵塞点在第一车道比在第二车道对交通流的影响小;同时,在该密度值范围内,意外事件堵塞时间和堵塞路段长度越长,对交通流的影响就越大. 关键词： 元胞自动机 交通流 意外事件     

基于社团结构的负载传输优化策略研究

研究表明网络社团结构特征对负载传输有影响,明显社团结构特征会降低网络的承载能力.由于最短路由策略在选择路由时有一定的随机性,本文提出了一种基于社团结构的负载传输策略,减少最短路由经过的社团数量,从而降低社团边缘节点的介数.实验结果显示,该策略在保证最短路由小世界特性的同时,提升了网络的承载能力,社团划分得越准确传输优化策略效果越显著. 关键词： 优化路由策略 社团结构 复杂网络 负载传输     

考虑交通出行惯例的双向行人流模型研究

推广了Baek等人最近提出的一个双向行人流模型,提出了两种改进策略,并从行人平均速度-密度关系、行人空间分布密度和位置分布等方面进行了数值分析. 研究发现,引入的两个新策略不仅可以提高行人流的平均速度,而且可以提高道路系统(尤其是道路中央区域)利用率,减轻拥堵状况,有效避免严重堵塞的发生. 改进的策略对行人的心理特点和行为特性等方面考虑更加全面,而且可以较好地模拟高密度的双向行人流. 关键词： 元胞自动机模型 双向行人流 交通惯例     

A 4D-sequencing approach for air traffic management

The current air traffic system is forecasted to face strong challenges due to the continuous increase in air traffic demand. Hence, there is a need for new types of organization permitting a more efficient air traffic management, with both a high capacity and a high level of safety, and possibly with a reduced environmental impact. In this article, we study a holistic approach, consisting in designing across Europe a very organized air traffic system, as opposed to free flight, to reduce costs while maintaining safety.     

Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model

This paper proposes a novel extended traffic network model to solve the logit-based stochastic user equilibrium (SUE) problem with elastic demand. In this model, an extended traffic network is established by properly adding dummy nodes and links to the original traffic network. Based on the extended traffic network, the logit-based SUE problem with elastic demand is transformed to the SUE problem with fixed demand. Such problem is then further converted to a linearly constrained convex programming and addressed by a predictor–corrector interior point algorithm with polynomial complexity. A numerical example is provided to compare the proposed model with the method of successive averages (MSA). The numerical results indicate that the proposed model is more efficient and has a better convergence than the MSA.     

Worst Traffic Passing Virtual Frame Regulation: Analysis with Dynamic Programming

This paper studies a discrete-time queueing system in which the traffic regulation places an upper bound on the number of arrivals in each of the non-overlapping time windows (virtual frames) of a fixed length. The worst traffic passing through this traffic regulation is characterized. As a criterion for traffic comparison, this paper employs the weighted sum of queueing delays with the weighting factors decaying geometrically over the time horizon. This paper uses dynamic programming techniques and convexity argument to characterize the worst traffic.