The CONTRAM Dynamic Traffic Assignment Model

CONTRAM is a computer model of time-varying traffic in road networks, which takes as input the network definition and time-varying demand for travel between a set of origin and destination zones, and outputs the resulting network flows, routes and travel times. It combines a macroscopic time-sliced traffic model with disaggregate dynamic assignment of traffic, so is intermediate between macroscopic equilibrium and microscopic models. The paper details the methods used, including time-dependent queuing which plays a central role, and the treatment of network definition, user classes, road capacities, signals and coordination, vehicle emissions, Intelligent Transport Systems and research lines.     

Real-time urban traffic information estimation with a limited number of surveillance cameras

Constant traffic congestion consumes enormous amounts of energy and causes vastly increased journey times. Therefore, real-time traffic information is of great importance to the public because such information is invaluable to more efficient traffic control and travel planning. To obtain such information in metropolises like Shanghai, however, is very challenging due to the extraordinarily large scale and complexity of the underlying road network. In this paper, we propose a novel traffic estimation scheme utilizing surveillance cameras pervasively deployed in cities. With only a limited number of roads with cameras, we adopt a measurementbased traffic matrix (TM) estimation method to infer the traffic conditions on those roads with no cameras. Extensively trace-driven simulations as well as field study results show that our scheme can achieve high accuracy with a very limited number of measurements. The accuracy of our measurement-based algorithm outperforms the traditional speed-based and model-based approaches by up to 50%.     

A Road Timetable to aid vehicle routing and scheduling

Both within and between urban conurbations, the time of a journey and the corresponding shortest path in a road network from an origin to a destination may depend on the time of the day, the day of the week and the season of the year. Significant journey time differences occur mainly due to recurring instances and variations in levels of traffic congestion throughout the year. This paper examines the issues involved in constructing a database of road times for a road network that uses time-dependent data on the travel times for individual roads in the network to provide the expected times and distances between locations for journeys starting at different times. The benefits of time-dependent vehicle routing and scheduling systems are demonstrated by using real-world data for the road network in the north west of England.     

基于浮动车数据的道路单向限行状态动态识别

交通道路的单向限行状态识别可以为社会公众提供及时准确的路网限行信息,提高公众出行效率,提升动态交通信息服务水平。提出了一种基于浮动车数据的道路单向限行状态动态识别算法。该算法首先获取地图线要素信息,并进行空间信息网格对交通道路的投影匹配预处理,实现海量浮动车数据的快速匹配;然后分析各道路的浮动车数据方向信息的统计特性,对其进行双阈值信息过滤和方向信息过滤处理,以动态提取交通道路的单向限行状态信息。经实际路网测试验证,该算法可有效识别道路的单向限行状态信息。     

Comparison of Methods for Path Flow Reassignment for Dynamic User Equilibrium

Models to describe or predict of time-varying traffic flows and travel times on road networks are usually referred to as dynamic traffic assignment (DTA) models or dynamic user equilibrium (DUE) models. The most common form of algorithms for DUE consists of iterating between two components namely dynamic network loading (DNL) and path inflow reassignment or route choice. The DNL components in these algorithms have been investigated in many papers but in comparison the path inflow reassignment component has been relatively neglected. In view of that, we investigate various methods for path inflow reassignment that have been used in the literature. We compare them numerically by embedding them in a DUE algorithm and applying the algorithm to solve DUE problems for various simple network scenarios. We find that the choice of inflow reassignment method makes a huge difference to the speed of convergence of the algorithms and, in particular, find that ??travel time responsive?? reassignment methods converge much faster than the other methods. We also investigate how speed of convergence is affected by the extent of congestion on the network, by higher demand or lower capacity. There appears to be much scope for further improving path inflow reassignment methods.     

基于MapReduce的城市道路旅行时间实测计算

城市道路旅行时间计算一直是智能交通系统中研究的核心问题之一,准确高效的旅行时间计算可以有效地帮助道路管控,减少交通拥挤.然而面对巨大而且快速增长的城市道路交通检测数据,如何将分布式计算模式融合到传统的旅行时间计算问题中已成为一个亟待解决的问题.论文基于海量道路车牌识别数据,设计了基于MapReduce编程模型的城市道路旅行时间实测计算的算法.并利用Hadoop环境进行了实现,可以支持对自定义路段集下不同时间段道路旅行时间的计算.通过实验证明,相对于传统的旅行时间计算方式,在计算时间上基于MapReduce的旅行时间计算模式可以提高十倍以上.     

考虑交通拥堵规避的低碳时变车辆路径问题研究

针对时变路网条件下的低碳车辆路径问题,首先,分析车辆离散行驶速度与连续行驶时间之间的关系,依据“先进先出”准则设计基于时间段划分的路段行驶时间计算方法,引入考虑车辆速度、实时载重、行驶距离与道路坡度因素的碳排放计算函数;然后,在此基础上以所有车辆的碳排放量最小为目标构建低碳时变车辆路径问题数学模型;最后,引入交通拥堵指数,设计交通拥堵规避方法,并根据模型特点设计一种改进蚁群算法求解.实验结果表明,所提出方法能有效规避交通拥堵、缩短车辆行驶时间、减少车辆碳排放,促进物流配送与生态环境和谐发展.     

多重处理的道路拥堵识别可视化融合分析

目的 随着城市交通拥堵问题的日益严重,建立有效的道路拥堵可视化系统,对智慧城市建设起着重要作用。针对目前基于车辆密度分析法、车速判定法、行驶时间判定法等模式单一,可信度低的问题,提出了一种基于DBSCAN+（density-based spatial clustering of applications with noise plus）的道路拥堵识别可视化方法。方法 引入分块并行计算,相较于传统密度算法,可以适应大规模轨迹数据,并行降维聚类速度快。对结果中缓行区类簇判别路段起始点和终止点,通过曲线拟合和拓扑网络纠偏算法,将类簇中轨迹样本点所表征的路段通过地图匹配算法匹配在电子地图中,并结合各类簇中浮动车平均行驶速度判别道路拥堵程度,以颜色深浅程度进行区分可视化。结果 实验结果表明,DBSCAN+算法相较现有改进的DBSCAN算法时间复杂度具有优势,由指数降为线性,可适应海量轨迹点。相较主流地图产品,利用城市出租车车载OBD（on board diagnostics）数据进行城区道路拥堵识别,提取非畅通路段总检出长度相较最优产品提高28.9%,拥堵识别命中率高达91%,较主流产品城区拥堵识别平均命中率提高15%。结论 在城市路网中,基于DBSCAN+密度聚类和缓行区平均移动速度的多表征道路拥堵识别算法与主流地图产品相比,对拥堵识别率、通勤程度划分更具代表性,可信度更高,可以为道路拥堵识别的实时性提供保障。     

TR-light：基于多信号灯强化学习的交通组织方案优化算法

针对多变环境条件下的交通堵塞问题,将强化学习、神经网络、多智能体和交通仿真技术结合起来,提出了用于优化多路口条件下交通状况的trajectory reward light(TR-light)模型。该方法具有几个显著特点：基于红绿灯拟定交通组织方案;将多智能体强化学习用于红绿灯控制;通过红绿灯的协同达到区域级的交通组织优化;在智能体每次行为执行结束后实施轨迹重构,在OD对不改变的情况下改变车辆行驶路径,根据方案和重构轨迹来计算智能体的最终回报。通过SUMO进行交通仿真实验和交通指标对比,验证了该模型在多交叉口中能够提高路网畅通率,改善交通状态。实验表明该模型可行,可有效缓解交通拥堵。     

基于改进DV-HOP的道路交通拥堵传感节点快速监测

由于现有交通拥堵监控设备在海量三维交通信息中处理数据的能力较差,导致监测目标延迟较高,故设计一种基于改进DV-HOP的道路交通拥堵传感节点快速监测方法;在待监测区域安置无线视觉传感器,划分子节点与Sink节点,采集车辆通行状况和整体长度;把异常道路数据作为小概率事件,确立速率采集周期及交通状态采集周期,推算历史车辆速率均值和交通数据方差,设定拥堵临界值,分析路段是否产生拥堵;对道路交通拥堵节点进行初始化,确定全部道路交通拥堵节点,并将其转换到二维坐标中;利用改进DV-HOP算法获取道路交通拥堵节点位置信息,得出道路交通拥堵节点监测结果;实验分析表明：设计方法的均等系数值可达0.998,数据传输延时仅为3.5 s,表明交通拥堵监测精度较高。     

出租车数据的城市道路网路段通行时间估计方法

城市路段通行时间估计能够更好地运营和管理城市交通。针对包含起点-终点位置,行程时间和距离信息的GPS行程数据,提出了一种城市道路网短时通行时间的估计模型。首先将城市道路网按照交叉路口分解为多个路段,并基于k-最短路径搜索方法分析司机行进路线。然后针对每一个路段,提出了双车道通行时间多项式关联关系模型,既能提升道路网通行时间精细度,又能避免因训练数据不足导致的路网通行时间过拟合问题。最后以最小化行程期望时间和实际行程时间之间的均方误差为优化目标,拟合道路网通行时间。在纽约出租车数据集上的实验结果表明,所提模型及方法相对于传统单车道估计方法能够更准确地估计城市道路网路段的通行时间。     

基于O-D矩阵估计的路网交通流量仿真模型

为了将交通出行需求对路网交通流量的影响进行动态的量化分析,提出了一个基于O-D矩阵估计的路网交通流量仿真模型。利用O-D矩阵估计的重力模型计算方法、复杂网络理论和路段阻抗模型,构建了路网模型;在人们出行总是选择路段阻抗最小路径的假定下,设计了出行需求的路网流量映射算法;基于离散事件仿真,在PC系统上实现了路网流量仿真系统。仿真结果表明：该仿真系统可以根据各交通子区域出行需求的变化,精确模拟路网流量和交通状态的动态演进。     

A general framework for modeling shared autonomous vehicles with dynamic network-loading and dynamic ride-sharing application

Shared autonomous vehicles (SAVs) could provide low-cost service to travelers and possibly replace the need for personal vehicles. Previous studies found that each SAV could service multiple travelers, but many used unrealistic congestion models, networks, and/or travel demands. The purpose of this paper is to provide a method for future research to use realistic flow models to obtain more accurate predictions about SAV benefits. This paper presents an event-based framework for implementing SAV behavior in existing traffic simulation models. We demonstrate this framework in a cell transmission model-based dynamic network loading simulator. We also study a heuristic approach for dynamic ride-sharing. We compared personal vehicles and SAV scenarios on the downtown Austin city network. Without dynamic ride-sharing, the additional empty repositioning trips made by SAVs increased congestion and travel times. However, dynamic ride-sharing resulted in travel times comparable to those of personal vehicles because ride-sharing reduced vehicular demand. Overall, the results show that using realistic traffic flow models greatly affects the predictions of how SAVs will affect traffic congestion and travel patterns. Future work should use a framework such as the one in this paper to integrate SAVs with established traffic flow simulators.     

基于道路风险评估的城市路网实时路径选择

为了缓解城市交通拥堵、避免交通事故的发生,城市路网的路径选择一直以来是一个热门的研究课题.随着边缘计算和车辆智能终端技术的发展,城市路网中的行驶车辆从自组织网络朝着车联网(Internet of vehicles,IoV)范式过渡,这使得车辆路径选择问题从基于静态历史交通数据的计算向实时交通信息计算转变.在城市路网路径选择问题上,众多学者的研究主要聚焦如何提高出行效率,减少出行时间等.然而这些研究并没有考虑所选路径是否存在风险等问题.基于以上问题,首次构造了一个基于边缘计算技术的道路风险实时评估模型(real-time road risk assessment model based on edge computing, R³A-EC),并提出基于该模型的城市路网实时路径选择方法(real-time route selection method based on risk assessment, R²S-RA). R3A-EC模型利用边缘计算技术的低延迟,高可靠性等特点对城市道路进行实时风险评估,并利用最小风险贝叶斯决策验证道路是否存在风险问...     

多个MFD子区边界协调控制方法

为了改善交通网络运行状况,根据车流密度的差异对宏观路网进行子区划分,提出了面向多个宏观基本图（Macroscopic fundamental diagram,MFD）子区的边界协调控制方法.根据划分的多个子区间邻接关系和流入流出交通流率,建立了路网车流平衡方程.通过与最佳累积车辆数进行比较,确定了拥挤度高的子区边界交叉口最佳流入与流出的交通流量;进而建立了以整个路网旅行完成流率最大、平均行程时间和平均延误最小的多目标边界协调优化模型,并通过自适应遗传算法对多目标函数进行求解.以存在4个MFD子区的实际路网为分析对象,对比仿真结果表明所提方法可有效提高路网运行效率、缓解拥堵状况.     

Optimization for signal setting problems using non-smooth techniques

Consider a road network with severe traffic congestion. A set of efficient strategies can be addressed to simultaneously minimize road users’ travel times and maximize possible increase in travel demands. Due to the non-differentiability of the perturbed solutions in equilibrium constraints, non-smooth optimization models for delay-minimizing and capacity-maximizing signal setting problems are established. In this paper, we propose a new bundle subgradient projection approach to solve the signal setting problems with global convergence. Various control policies are numerically tested one against another. Numerical results disclose that the proposed approach has successfully solved the delay-minimizing and capacity maximizing signal setting problems and achieved significant performance in cost reduction when compared to other alternatives.     

Design of Regulatory Traffic Light Control Systems with Synchronized Timed Petri Nets

Fixing the phases is one of the common methods to control an urban traffic network. Once a road is filled with a high traffic flow approaching its capacity, the conventional traffic light controller is not able to handle this traffic congestion phenomenon well. In this paper, we propose a novel regulatory traffic light control system to handle such traffic congestion by using synchronized timed Petri nets (STPNs). Three kinds of intersections in an urban traffic network are defined and employed to demonstrate our new regulatory traffic light control system models. Finally, the liveness and reversibility of the proposed STPN models are proven through the reachability graph analysis method. To our knowledge, this is the first work that solves a traffic congestion problem with a regulatory traffic light control technique that is effective in preventing vehicles from entering traffic congestion zones.     

一种时间最短的交通网络路径求解方法

随着科技的不断发展和人民生活水平的不断提高,汽车的保有量日益增加,交通堵塞问题愈加严重,造成了时间的浪费。为了防止城市交通拥堵,节约驾驶员出行的时间,将路网信息表示成矩阵的形式,建立了车辆行驶时间目标函数。运用拉格朗日乘子法求解目标函数,从而得到各车辆的行驶路径。最后,利用MATLAB实验仿真,在目标函数最小的情况下,能得到车辆的行驶路径,当有利他因子时,更节省出行时间。     

Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints

The sustainable problems of transportation have become noticeable in the majority of cities worldwide. Many researchers are devoted themselves into traffic congestion. Generally, traffic congestion could be alleviated via increasing road capacity (supply) or reducing traffic (demand). In this paper, we model CNDP which has a tradable credit scheme and equity constraints in order to research on the way of releasing congestion by combining increasing supply and reducing demand. Firstly, the bilevel programming problem is proposed to model the CNDP with a tradable credit scheme. The upper level (the government) chooses optimal capacity enhancement for some existing links to minimize the total system costs under a budget constraint. The lower level chooses the optimal route based on considering the generalized travel cost in which both travel time and credit charging for using the link are involved. And then, considering the inequity problem in terms of equilibrium O–D travel cost and link travel time, the model is proposed by incorporating equity constraints into CNDP with a tradable credit scheme. After presenting a relaxation algorithm, the experiments on Sioux Falls network are illustrated. Finally, conclusion and some future research directions are presented.     

Fuzzy adaptive predictive flow control of ATM network traffic

In order to exploit the nonlinear time-varying property of network traffic, the traffic flow from controlled sources is described by a fuzzy autoregressive moving-average model with auxiliary input (fuzzy ARMAX process), with the traffic flow from uncontrolled sources (i.e., cross traffic) being described as external disturbances. In order to overcome the difficulty of the transmission delay in the design of congestion control, the fuzzy traffic model is translated to an equivalent fuzzy predictive traffic model. A fuzzy adaptive flow control scheme is proposed to avoid congestion at high utilization while maintaining good quality of service. By use of fuzzy adaptive prediction technique, the difficulties in congestion control design due to nonlinearity, time-varying characteristics, and large propagation delay can be overcome by the proposed adaptive traffic control method. A comparative evaluation is also given to show the superiority of the proposed method.