城市快速路交通诱导和匝道控制集成仿真模型

为缓解城市快速道路网络交通网络拥挤问题,将网络交通流模型、匝道控制模型、基于可变信息标志（VMS）的路径选择模型等整合为一体,建立了城市快速路交通诱导和匝道控制集成仿真模型。与各种边界条件相结合,测试了匝道控制和路径诱导的控制效果。结果表明城市快速路集成控制方法有助于在空间和时间上均衡交通负荷,提高交通系统整体运行效率。     

交叉口有交通信号控制时用户最优动态配流模型

针对智能交通系统（ＴＴＳ）基础上中主要基础理论之一的动态交通分配问题,在现有研究成果的基础上,提出了更接近真实路网的多起点多旋点交叉口设置有交通信号控制（Ｔｒａｆｆｉｃ Ｓｉｇｎａｌ Ｃｏｎｔｒｏｌ）时的动态配流模型,给出了对现有的通过Ｆｒａｎｋ Ｗｏｉｆｅ算法所得的ＤＵＯ配流解进行修正的原则,最后的算例表明由修正后的模型和算法所得到的ＤＵＯ配流解满足ＴＳＣ约束。     

The combination of continuous network design and route guidance

In this study, a traffic management measure is presented by combining the route guidance of Advanced Traveler Information System (ATIS) and the continuous network design (CNDP) to alleviate increasing traffic congestion. The route guidance recommends the travelers to choose the shortest path based on marginal travel cost and user constraints. The problem is formulated into a bi-level programming problem. The most distinct property of this problem formulation is that the feasible path set of its lower-level problem is determined by the decision variable of upper-level problem, while in conventional transportation network design problems the feasible path set for lower-level traffic assignment problem is fixed to be all the viable paths between each specific origin-destination pair. The simulated annealing algorithm is improved to solve this bi-level problem. A path-based traffic algorithm is developed to calculate the lower-level traffic assignment problem under the route guidance. Compared to the results of conventional CNDP, the measure presented in this study can better improve the transportation network performance.     

整合快速路网匝道控制和路径诱导的进化粒子群算法

针对快速路匝道控制和路径诱导优化,改进已有宏观交通流模型对上下匝道的处理方式,提出了一种实现快速路网协同整合动态优化控制的进化粒子群算法。利用区分目的地车流的均匀分布,给出起始路段区分目的地车流的实际驶入比例。通过对实际路网中上下匝道车流的观察分析,给出上匝道车速与下游主线车速的关联关系,并对下匝道实施类似主线路段的建模处理。针对基于上述改进得到的快速路网动态控制系统,利用控制变量的箱式约束,在经典粒子群算法中引入交叉变异操作,给出了一种高效的进化粒子群算法。通过算例分析比较了经典粒子群算法和进化粒子群算法,证实了新方法可以高效处理复杂的实际快速路网。     

Allocation of freeway ramp metering volumes to optimize corridor performance

A simple macroscopic freeway traffic corridor model is formulated for the purpose of developing optimal allocations of freeway on-ramp metering volumes. The model represents a freeway and a single parallel "equivalent surface street," both unidirectional, which are interconnected by freeway on-ramps. Since a choice of routes is included in the problem formulation, the fairly standard methodology of "traffic assignment" is employed to predict how drivers will react to the on-ramp metering. An explicit traffic assignment algorithm which includes ramp queueing is developed. Both the corridor and traffic assignment models are restricted to stationary traffic patterns. Two specific corridor performance criteria, freeway travel rate and total travel-time rate, are formulated in terms of the model variables. Then the problem of choosing ramp metering volumes to optimize a performance criterion is posed. A computationally efficient suboptimal dynamic programming scheme is developed and illustrated by an example.     

An integrated optimal control and algorithm for commuting corridors

An integrated optimal control model and its solution algorithm have been developed for commuting corridor management. Three traffic control measures, including ramp metering, intersection signal timing, and freeway flow diversion, have been incorporated and optimized simultaneously. As an improvement to our previous work, the presented model and algorithm have the following three unique features: (1) modeling traffic state evolution on surface streets with flow conservation within sections, flow transition between sections, and flow discharging at downstream intersections; (2) estimating time-dependent model parameters adaptively with real-time traffic measurements, rather than assuming as pre-determined; and (3) having a limited-step convergence property in its solution logic. Preliminary numerical tests have demonstrated the potential of the developed model and algorithm for integrated real-time corridor control.     

考虑网络流量的最优路径求解模型和算法

本文旨在解决交通网络中群体车辆的路径选择问题．即为每个车辆寻求最优行驶路径．使之在起迄点间的旅行时间最短．考虑到网络流量对路段旅行时间的影响，先进行流量分配，再同时为各个车辆寻求最短路径．为此，首先给出了考虑流量影响的网络模型，然后建立了基于路段的用于流量分配的变分不等式模型．该模型的解给出了车辆按照最优路径行驶时分配到各路段上的车辆数目．由于该模型是完全基于路段的，从而克服了基于路径方法必须进行路径穷举的缺陷．最后给出了最优路径选择算法，并证明了算法的正确性．本文给出的模型和算法适用于交通畅通、交通拥挤等各种情况．实验结果表明本文提出的模型和算法是非常有效的．     

Traffic Dynamics and Mode Choice’s Delay Effect Under Traffic Restriction in Two-Mode Networks

Day-to-day traffic assignment models provide a powerful tool to analyze the time evolution of traffic flow within transport networks. In day-to-day dynamics, most models assume that there are only private cars on traffic networks and travelers update their choices each day. However, there are mainly two traffic modes, i.e. cars and buses, and travelers may not change their mode choices frequently. In this paper, a period-to-period traffic assignment model is proposed to capture traffic dynamics under traffic restrictions by considering interactions among different modes and introducing a delay about travelers’ mode choice. The existence and uniqueness of the equilibrium are analyzed. The linear stability of the equilibrium is analyzed and the eigenvalue range of Jacobian matrix is estimated by using the Gershgorin circle theorem. Both theoretical analyses and numerical simulations indicated that compared to the system with no mode choice, mode choice behaviors could improve the stability of the equilibrium. Additionally, mode choice behaviors with delay might further increase the stability domain and dampen oscillations on the cost and the flows. This study explains the evolution patterns of transportation networks under traffic policy and provides guidance for network design and management.

     

交通事件下快速路网匝道控制与路线诱导的集成控制

本文建立了交通事件影响下匝道控制与路线诱导相结合的完全集成控制模型,即建立了一个以节点分流比例与匝道调节率为控制变量的非线性最优控制模型,模型中考虑了突发交通事件后快速路的交通特点,基于粒子群算法设计了模型的求解算法.以一个简单的小型路网为例,讨论了突发事件后采用不同控制策略对系统的全局影响,仿真表明,匝道控制与路线诱导相结合的集成控制有效地降低了事件的影响.     

Combined Activity/Travel Choice Models: Time-Dependent and Dynamic Versions

To fully understand and predict travel demand and traffic flow, it is necessary to investigate what drives people to travel. The analysis should examine why, where and when various activities are engaged in, and how activity engagement is related to the spatial and institutional organization of an urban area. In view of this, two combined activity/travel choice models are presented in this paper. The first one is a time-dependent (quasi-dynamic) model for long-term transport planning such as travel demand forecasting, while the other one is a dynamic model for short-term traffic management such as instantaneous flow analysis. The time-dependent model is formulated as a mathematical programming problem for modeling the multinomial logit activity/destination choice and the user equilibrium route choice behavior. It can further be converted to a variational inequality problem. On the other hand, the dynamic model is aimed to find a solution for equilibrium activity location, travel route and departure time choices in queuing networks with multiple commuter classes. It is formulated as a discrete-time, finite-dimensional variational inequality and then converted to an equivalent zero-extreme value minimization problem. Solution algorithms are proposed for these two models and numerical example is presented for the latter. It is shown that the proposed modeling approaches, either based on time-dependent or dynamic traffic assignment principles, provide powerful tools to a wide variety of activity/travel choice problems in dynamic domain.     

面向诱导的交通状态信息提取方法

为实现可变信息板（Variable Message Signs,VMS）的交通状态信息提取,选取速度、饱和度与交叉口平均延误作为交通参数,提出了基于模糊推理的关联路段交通状态信息提取方法。针对驾驶员的VMS信息响应特性,设计了面向拥挤状态的VMS诱导策略,在关联路段均处于拥挤状态时基于Vague集对交通状态进行排序,以判别交通状态相对最优的关联路段进行发布。以实际算例验证了该方法的有效性,所提出的VMS诱导策略能够逐步引导拥挤交通流的分流,并为驾驶员在拥挤状态下进行路径选择提供决策支持。     

弹药配送时间最优路线选择和时间预测策略研究

弹药的补给线是作战部队的生命线,主动、精确、迅速地实施弹药配送保障已成为战斗力的重要增长点,现代战争中对弹药配送的时间最优路线选择和到达时间的准确快速预测是至关重要的。通过分析传统的弹药配送方法,借助卫星图像处理技术,建立弹药配送路线的车流量预测算法和应用策略模型。通过对弹药配送的可行路线上的车流量进行预测,选择预测的车流量最少的一条路线为最优路线,车流量的速度作为弹药配送车辆的速度来预测弹药配送到达时间。为了提高车流量预测算法的可靠性和精确性,采用统计数据挖掘对算法参数优化,进而借助并行计算技术来降低算法的时间复杂度,实现对弹药配送的时间最优路线选择和到达时间的可靠、精确、快速的预测。     

城市快速路网匝道与污染控制双层多目标规划模型

基于环境容量和交通容量,建立了一个双层多目标规划模型描述城市快速道路网的污染控制与匝道控制,并考虑了用户的路径选择行为．设计了基于改进遗传算法的启发式求解算法。该算法借助不可微精确罚函数将约束问题转化为单个无约束问题来解决,采用混合杂交和间歇变异提高算法的搜索能力．最后。通过算例说明该模型及算法的有效性．     

Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback

This paper studies the dynamic user optimal (DUO) traffic assignment problem considering simultaneous route and departure time choice. The DUO problem is formulated as a discrete variational inequality (DVI), with an embeded LWR-consistent mesoscopic dynamic network loading (DNL) model to encapsulate traffic dynamics. The presented DNL model is capable of capturing realistic traffic phenomena such as queue spillback. Various VI solution algorithms, particularly those based on feasible directions and a line search, are applied to solve the formulated DUO problem. Two examples are constructed to check equilibrium solutions obtained from numerical algorithms, to compare the performance of the algorithms, and to study the impacts of traffic interacts across multiple links on equilibrium solutions.     

利于节能减排的交通诱导与控制时空融合算法

交通诱导与控制时空融合算法以车流量平衡为最终目标. 为使融合算法的调速过程利于节能减排, 调速应不突变, 提高低速, 保持高速, 避免拥堵. 为此, 建立了表征路网各路段车速的实时速度网, 以此为基础, 进行符合节能减排目标的交通诱导与控制的融合, 以及单时空流调速和多时空流调速. 与其他协同方法进行仿真比较的结果表明, 时空融合算法的能耗与排放明显降低.

     

Linear Programming Formulation for Strategic Dynamic Traffic Assignment

This work introduces a novel formulation of system optimal dynamic traffic assignment that captures strategic route choice in users under demand uncertainty. We define strategic route choice to be that users choose a path prior to knowing the true travel demand which will be experienced (therefore users consider the full set of possible demand scenarios). The problem is formulated based on previous work by Ziliaskopoulos (Transp Sci 34(1):37–49, 2000). The resulting novel formulation requires substantial enhancement to account for path-based flows and scenario-based stochastic demands. Further, a numerical demonstration is presented on a network with different demand loading profiles. Finally, model complexity, implications on scalability and future research directions are discussed.     

冰雪天气下高速公路可变限速控制研究

为保障冰雪天气条件下高速公路的行车安全与通行效率,在建立安全限速模型与交通流预测模型的基础上,提出一种基于粒子群优化算法的可变限速控制策略;首先,通过分析冰雪天气下车辆制动性能和交通流演化规律,提出适用于冰雪天气条件的高速公路安全限速模型以及交通流预测模型;其次,设计了兼顾通行效率与行车安全的优化目标函数,并考虑实际行车需求给出相关约束条件;最后,基于交通流预测模型并结合粒子群优化算法对可变限速值进行求解,并通过搭建的元胞自动机交通流模型将所提出的可变限速策略的控制效果与固定限速方案和分段安全限速方案进行对比仿真实验;仿真结果表明,相比于固定限速方案,可变限速控制减少了总行程时间、总行程延误时间和车辆冲突时间;相比于分段安全限速方案,可变限速控制有效减小了管控路段内的车辆行驶速度标准差,总行程延误时间和车辆冲突暴露时间也有所降低,验证了所提出可变限速控制策略的有效性。     

A Hybrid Route Choice Model for Dynamic Traffic Assignment

Network user equilibrium or user optimum is an ideal state that can hardly be achieved in real traffic. More often than not, every day traffic tends to be in disequilibrium rather than equilibrium, thanks to uncertainties in demand and supply of the network. In this paper we propose a hybrid route choice model for studying non-equilibrium traffic. It combines pre-trip route choice and en-route route choice to solve dynamic traffic assignment (DTA) in large-scale networks. Travelers are divided into two groups, habitual travelers and adaptive travelers. Habitual travelers strictly follow their pre-trip routes which can be generated in the way that major links, such as freeways or major arterial streets, are favored over minor links, while taking into account historical traffic information. Adaptive travelers are responsive to real-time information and willing to explore new routes from time to time. We apply the hybrid route choice model in a synthetic medium-scale network and a large-scale real network to assess its effect on the flow patterns and network performances, and compare them with those obtained from Predictive User Equilibrium (PUE) DTA. The results show that PUE-DTA usually produces considerably less congestion and less frequent queue spillback than the hybrid route choice model. The ratio between habitual and adaptive travelers is crucial in determining realistic flow and queuing patterns. Consistent with previous studies, we found that, in non-PUE DTA, supplying a medium sized group (usually less than 50%) of travelers real-time information is more beneficial to network performance than supplying the majority of travelers with real-time information. Finally, some suggestions are given on how to calibrate the hybrid route choice model in practice to produce realistic results.     

A Heuristic for the Doubly Constrained Entropy Distribution/Assignment Problem

The doubly constrained entropy distribution/assignment (DEDA) problem that combines a gravity-based trip distribution (TD) problem and a traffic assignment (TA) problem has long been formulated as an optimization model and solved by two solution algorithms, i.e., partial- and full-linearization solution algorithms. As an alternative, this research first treats the DEDA problem by the augmented Lagrangian dual (ALD) method as the singly constrained entropy distribution/assignment (SEDA) problem, which in turn is addressed, via a tactical supernetwork representation, as an “extended” 1-origin-to-1-destination TA problem. A quick-precision TA solution algorithm, ? called TAPAS (Traffic Assignment by Paired Alternative Segments), ? is then adopted for solutions. The proposed approach is demonstrated with a numerical example for the correctness of the result, using Lingo 11 solver and the partial linearization solution (PLS) algorithm. Moreover, through the use of TAPAS in the innermost loop, the proposed approach also has the merit of generating unique path flow solution, which is very useful in route guidance under the intelligent transportation systems environment, among other academic applications. In addition, the proposed approach can be easily applied, or with minor modification at most, to various combined models in travel demand forecasting.