A Path-Based Solution Algorithm for Dynamic Traffic Assignment

The approximation of the traversal cost is a critical component of dynamic traffic assignment model. In link based traffic assignment, it assumes that the constraints sets are linear or convex and it is not realistic in general traffic networks. Comparing with the link based model, the path cost in the objective function of the path based traffic assignment model is implicitly nonlinear or non-convex, which is difficult to solve. In this paper, a path based traffic assignment model combining the generalized expansion method in M/G/c/c model with the point queue model is proposed to extend the link traversal cost to the travel cost along the path. Comparing with the link based model without considering intersection effects, this proposed path based model can take into account queuing delays between intersections and it is easy to implement. In order to validate the proposed path based model, a comparative experiment is implemented by comparing with the traditional travel cost models in Sydney traffic networks. Taking into account travel flow changes and blocking time, the proposed path based model is more effective for travellers from the uncongested traffic to congested traffic networks. In addition, the results from traffic assignment model show that the proposed model can achieve feasible results.     

Traffic Simulation in Urban Networks Using Stochastic Cell Transmission Model

The stochastic cell transmission model (SCTM) is a macroscopic traffic simulation model of high accuracy. One of its advantages is that it can represent the uncertainty of the traffic states and the changing travel demand and supply conditions. However, it has been applied to freeways and simple networks having only one origin‐destination pair. In this article, we propose a modified stochastic cell transmission model (M‐SCTM) that applies the conventional SCTM to urban networks. In M‐SCTM, we introduce vehicle agents as well as their route choice behavior on an urban network, which is more applicable to complex urban networks. Additionally, M‐SCTM was applied to networks in which the turning ratio is not priorly set through a route search algorithm. The results show that M‐SCTM can conduct simulations with as much accuracy as SCTM. Furthermore, we verified the appropriate reproducibility of the simulations based on M‐SCTM and compared the estimated value and the measured value in terms of the travel time of each vehicle.     

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

为了缓解城市交通拥堵、避免交通事故的发生,城市路网的路径选择一直以来是一个热门的研究课题.随着边缘计算和车辆智能终端技术的发展,城市路网中的行驶车辆从自组织网络朝着车联网(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模型利用边缘计算技术的低延迟,高可靠性等特点对城市道路进行实时风险评估,并利用最小风险贝叶斯决策验证道路是否存在风险问...     

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.     

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 simultaneous route and departure time choice equilibrium model on dynamic networks

In this paper, we are concerned with modeling dynamic networks, when drivers simultaneously optimize their departure time and route choice. We state equilibrium conditions and propose a simulation-based model that can solve large networks accounting for many realities of actual networks. The main components of the model are a time-dependent shortest path algorithm for fixed arrival times and a traffic simulator. The proposed model has the potential to realistically capture user decisions when arrival time based origin–destination tables are easier to obtain than the departure time based ones e.g. in the morning peak and in special events. Two solution methodologies are designed and tested: the first emulates users day-to-day dynamic behavior and does not guarantee convergence; the second is a heuristic approach that adjusts link travel times and always converges to an equilibrium solution, although not at the desired level of schedule delay. Computational experiments on a small street network are presented.     

基于延迟函数次梯度启发式道路交通补偿策略

拥挤收费被认为是解决交通拥挤的有效方法,解决道路交通拥堵的主要想法是,对于有些容易造成拥堵的道路进行收费,而对于其他未充分利用的道路进行适当补偿,对此提出一种基于延迟函数的次梯度启发式道路交通补偿策略。首先,给出道路集的收费/补贴的非线性规划模型,主要是基于Beckmann最小化目标函数实现,然后利用库恩-希尔斯条件和拉格朗日乘子建立模型的条件约束;其次,基于启发式算法建立道路交通的定价补偿策略,利用边际成本建立延迟函数分析模型,然后基于次梯度法进行模型的优化;最后,通过在真实道路网络上的仿真实验,显示所提算法在旅行时间、交通流量、收敛性等指标上均具有较好的性能,验证了算法的有效性。     

Dynamic User Equilibrium Model for Combined Activity-Travel Choices Using Activity-Travel Supernetwork Representation

Integrated urban transportation models have several benefits over sequential models including consistent solutions, quicker convergence, and more realistic representation of behavior. Static models have been integrated using the concept of Supernetworks. However integrated dynamic transport models are less common. In this paper, activity location, time of participation, duration, and route choice decisions are jointly modeled in a single unified dynamic framework referred to as Activity-Travel Networks (ATNs). ATNs is a type of Supernetwork where virtual links representing activity choices are added to augment the travel network to represent additional choice dimensions. Each route in the augmented network represents a set of travel and activity arcs. Therefore, choosing a route is analogous to choosing an activity location, duration, time of participation, and travel route. A cell-based transmission model (CTM) is embedded to capture the traffic flow dynamics. The dynamic user equilibrium (DUE) behavior requires that all used routes (activity-travel sequences) provide equal and greater utility compared to unused routes. An equivalent variational inequality problem is obtained. A solution method based on route-swapping algorithm is tested on a hypothetical network under different demand levels and parameter assumptions.     

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

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

Popular route planning with travel cost estimation from trajectories

With the increasing number of GPS-equipped vehicles,more and more trajectories are generated continuously,based on which some urban applications become feasible,such as route planning.In general,popular route that has been travelled frequently is a good choice,especially for people who are not familiar with the road networks.Moreover,accurate estimation of the travel cost(such as travel time,travel fee and fuel consumption)will benefit a wellscheduled trip plan.In this paper,we address this issue by finding the popular route with travel cost estimation.To this end,we design a system consists of three main components.First,we propose a novel structure,called popular traverse graph where each node is a popular location and each edge is a popular route between locations,to summarize historical trajectories without road network information.Second,we propose a self-adaptive method to model the travel cost on each popular route at different time interval,so that each time interval has a stable travel cost.Finally,based on the graph,given a query consists of source,destination and leaving time,we devise an efficient route planning algorithmwhich considers optimal route concatenation to search the popular route from source to destination at the leaving time with accurate travel cost estimation.Moreover,we conduct comprehensive experiments and implement our system by a mobile App,the results show that our method is both effective and efficient.     

Integration control for traffic corridors considering guidance information

The problem of designing integration traffic strategies for traffic corridors with the use of ramp metering, speed limit, and route guidance is considered in this paper. As an improvement to the previous work, the presented approach has the following five features： 1） modeling traffic flow to analyze traffic characteristics under the influence of variable speed limit, on-ramp metering and guidance information; 2） building a hierarchy model to realize the integration design of traffic control and route guidance in traffic corridors; 3） devising a multi-class analytical dynamic traffic assignment （DTA） model for traffic corridors, where not only the route choice process will be different for each user-class, but also the traffic flow operations are user-class specific because the travel time characteristic for each user-class is considered; 4） predicting route choice probabilities adaptively with real-time traffic conditions and route choice behaviors corresponding to variant users, rather than assuming as pre-determined; and 5） suggesting a numerical solution algorithm of the hierarchy model presented in this paper based on the modified algorithm of iterative optimization assignment （IOA）. Preliminary numerical test demonstrates the potential of the developed model and algorithm for integration corridor control.     

基于实时车速的交通控制与诱导协同

为了减小路网的总行程时间和提高路网运行效率,提出一种基于实时车速的交通控制与诱导协同模型。利用惩罚函数将有约束遗传算法转化为无约束遗传算法对所建立的协同模型进行求解,得到最佳的控制方案和诱导方案。在Vissim微观交通仿真软件中建立包含4个交叉口的小型路网进行仿真实验,仿真结果表明,此方法能够有效地减少路网总行程时间,提高路网运行效率。      

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.     

SALA: A Self-Adaptive Learning Algorithm—Towards Efficient Dynamic Route Guidance in Urban Traffic Networks

In order to alleviate traffic congestion for vehicles in urban networks, most of current researches mainly focused on signal optimization models and traffic assignment models, or tried to recognize the interaction between signal control and traffic assignment. However, these methods may not be able to provide fast and accurate route guidance due to the lack of individual traffic demands, real-time traffic data and dynamic cooperation between vehicles. To solve these problems, this paper proposes a dynamic and real-time route selection model in urban traffic networks (DR2SM), which can supply a more accurate and personalized strategy for vehicles in urban traffic networks. Combining the preference for alternative routes with real-time traffic conditions, each vehicle in urban traffic networks updates its route selection before going through each intersection. Based on its historical experiences and estimation about route choices of the other vehicles, each vehicle uses a self-adaptive learning algorithm to play congestion game with each other to reach Nash equilibrium. In the route selection process, each vehicle selects the user-optimal route, which can maximize the utility of each driving vehicle. The results of the experiments on both synthetic and real-world road networks show that compared with non-cooperative route selection algorithms and three state-of-the-art equilibrium algorithms, DR2SM can effectively reduce the average traveling time in the dynamic and uncertain urban traffic networks.     

Neural network model for rapid forecasting of freeway link travel time

Estimation of freeway travel time with reasonable accuracy is essential for successful implementation of an advanced traveler information system (ATIS) for use in an intelligent transportation system (ITS). An ATIS consists of a route guiding system that recommends the most suitable route based on the traveler's requirements using the information gathered from various sources such as loop detectors and probe vehicles. This information can be disseminated through mass media or on on-board satellite-based navigational system. Based on the estimated travel times for various routes, the traveler can make a route choice. In this article, a neural network model is presented for forecasting the freeway link travel time using the counter propagation neural (CPN) network. The performance of the model is compared with a recently reported freeway link travel forecasting model using the backpropagation (BP) neural network algorithm. It is shown that the new model based on the CPN network, and the learning coefficients proposed by Adeli and Park, is nearly two orders of magnitude faster than the BP network. As such, the proposed freeway link travel-forecasting model is particularly suitable for real-time advanced travel information and management systems.     

一种车载自组织网络中交通拥塞自适应的出行计划方案

交通堵塞现象越来越威胁正常的城市交通,针对选择最短路径的出行方案往往不能取得最短的出行时间的现象,提出了一种交通拥塞自适应的出行计划方案.该方案克服了现有方案在规划出行路线时未能考虑行车过程中实际交通状况的缺点,根据车辆在各路段行驶的平均通过时间来判断路段当前的拥塞状况,并动态优化行车路线,从而提高交通效率.仿真实验表明该方案能够自适应路段的交通拥塞,根据当前拥塞状况重新优化行车路线,从而缩短平均行车时间.     

The framing of drivers' route choices when travel time information is provided under varying degrees of cognitive load

In two experiments, participants chose between staying on a main route with a certain travel time and diverting to an alternative route that could take a range of travel times. In the first experiment, travel time information was displayed on a sheet of paper to participants seated at a desk. In the second experiment, the same information was displayed in a virtual environment through which participants drove. Overall, participants were risk-averse when the average travel time along the alternative route was shorter than the certain travel time of the main route but risk-seeking when the average travel time of the alternative route was longer than the certain travel time along the main route. In the second experiment, in which cognitive load was higher, participants simplified their decision-making strategies. A simple probabilistic model describes the risk-taking behavior and the load effects. Actual or potential applications of this research include the development of efficient travel time information systems for drivers.     

基于ANFIS混合模型的短时交通流预测

城市短时交通流预测可以帮助人们选择出行最优路线,提高出行效率,其研究在交通拥堵日益严重的今天十分必要.受天气等多种因素影响,短时交通流的精确预测比较困难,为改善短时交通流预测的精度,本文提出了一种基于自适应模糊推理系统（ANFIS）的混合模型.该混合模型用周期性知识模型及残差数据驱动ANFIS模型集成得到.为验证所提出的混合模型的性能,与倒向传播神经网络（BPNN）模型和普通ANFIS模型进行对比.实验结果证明混合模型在交通流预测方面有更好的适用性和准确度.     

Urban arterial traffic two-direction green wave intelligent coordination control technique and its application

This paper presents a new two-direction green wave intelligent control strategy to solve the coordination control problem of urban arterial traffic. The whole control structure includes two layers — the coordination layer and the control layer. Public cycle time, splits, inbound offset and outbound offset are calculated in the coordination layer. Public cycle time is adjusted by fuzzy neural networks (FNN) according to the traffic flow saturation degree of the key intersection. Splits are calculated based on historical and real-time traffic information. Offsets are calculated by the real-time average speeds. The control layer determines phase composition and adjusts splits at the end of each cycle. The target of this control strategy is to maximize the possibility for vehicles in each direction along the arterial road to pass the local intersection without stop while the utility efficiency of the green signal time is at relatively high level. The actual application results show the proposed method can decrease the average travel time and average number of stops, and increase the average travel speed for vehicles on the arterial road effectively.     

基于出行时间预算的有限理性出行者路网均衡模型

为研究有限理性出行者逐日出行中出发时刻及路径调整的出行行为,引入前景理论,分析出行者依据最大准点到达概率来选择出行时间预算,将此出行时间预算作为到达参考点,进而在给定参考点下选择前景值最大的路径出行,并利用前次流量分配结果调整下次出行时间预算,经过多次出行达到路网流量平衡及准点到达概率最大的稳定状态。基于出行时间预算和前景理论建立了双层模型进行路网逐日均衡配流,用遗传算法求解最佳出行时间预算,用相继平均法计算路径平衡流量。最后基于算例验证模型和算法,并设定不同的出行选择机制分析出行时间预算、路径前景值及准点到达概率三者间的博弈关系。