Path-constrained traffic assignment: A trip chain analysis under range anxiety

This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the “range anxiety” issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler’s combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium.     

高速路网不停车收费车道优化布设方法

合理设置高速公路收费站ETC (Electronic Toll Collection)车道数量，对高速公路通行效率至关重要。针对目前路网中ETC与MTC (Manual Toll Collection)车辆混行的情况，考虑ETC的普及率，结合多用户路网均衡模型和排队论方法，建立基于双层规划模型的高速路网ETC车道优化布设方法。上层模型以车辆总通行时间最小为目标，优化设置进出收费站的ETC车道数量；下层模型为多用户路网均衡模型，反映ETC和MTC车辆的路径和收费车道选择行为。下层模型通过设计收费站的等价拓扑结构，表征收费站的车道使用规则及车辆的收费车道选择行为，并采用排队论方法估计ETC和MTC车道的收费排队时间。根据模型的特点设计了基于主动集的启发式算法，利用参数二进制与拉格朗日函数法确定迭代下降方向，解决了下降方向与步长难以计算的问题；通过内嵌优化函数的方式，保证在主动集转化过程中上层约束均不会失效，且避免了迭代过程中的模型解退化问题。基于上海市绕城高速进行实证分析，结果表明：随着ETC普及率的提升，收费排队时长按照负指数趋势下降；与按比例布设ETC车道的方法相比，所提方法最高可降低57.4%的收费排队时间，且该方法可以避免ETC车道布设过多对于MTC车道通行能力挤压造成的负面效果。研究成果可以有效指导高速路网ETC车道的布设，提高路网通行效率。     

Optimal joint distance and time toll for cordon-based congestion pricing

This paper addresses the optimal toll design problem for the cordon-based congestion pricing scheme, where both a time-toll and a nonlinear distance-toll (i.e., joint distance and time toll) are levied for each network user’s trip in a pricing cordon. The users’ route choice behaviour is assumed to follow the Logit-based stochastic user equilibrium (SUE). We first propose a link-based convex programming model for the Logit-based SUE problem with a joint distance and time toll pattern. A mathematical program with equilibrium constraints (MPEC) is developed to formulate the optimal joint distance and time toll design problem. The developed MPEC model is equivalently transformed into a semi-infinite programming (SIP) model. A global optimization method named Incremental Constraint Method (ICM) is designed for solving the SIP model. Finally, two numerical examples are used to assess the proposed methodology.     

A traffic-condition-based route guidance strategy for a single destination road network

Most of existing route guidance strategies achieves user optimal equilibrium by comparing travel time. Measuring travel time, however, might be uneasy on an urban road network. To contend with the issue, the paper mainly considers easily obtained inflow and outflow of a link and road capacity as input, and proposes a route guidance strategy for a single destination road network based on the determination of free-flow or congested conditions on alternative routes. An extended strategy for a complex network and a feedback approximation for avoiding forecast are further explored. Weaknesses of the strategy are also explicitly analyzed. To test the strategy, simulation investigations are conducted on two networks with multiple parallel routes. The results indicate that the strategy is able to provide stable splitting rates and to approximate user optimal equilibrium in different conditions, in particular when traffic demand is high. This strategy has potential to be applied in an urban road network due to its simplicity and easily obtained input data. The strategy is also applicable for single destination if some alternatives and similar routes are available.     

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.     

机动车交通流比功率与能耗模型研究

为研究机动车交通流能耗,将机动车交通流比功率(VSP)作为研究对象.从最常见的单车比功率研究出发,使用气体动力学交通流模型联系单车比功率与交通流整体比功率,以此建立交通流比功率模型.为使此模型具备更显著的物理意义,将交通流比功率分为两部分,一部分为平衡交通流状态下的比功率,另一部分为偏离平衡交通流状态导致的比功率变化量,模型中的交通流参数与变量能够通过现有的交通流探测设备获取.将比功率理论模型从单车扩展到了交通流,用数学公式反应了交通流状态与比功率的关系,并且证明了交通流比功率能够通过交通流参数进行估计.并由交通流比功率出发,推导出交通流比功公式.此外研究了平衡态交通流比功率及比功与密度的关系.为研究机动车交通流能耗探索了新的思路.     

考虑多目标的城市停车换乘选址优化模型及算法

停车换乘选址问题是城市交通网络设计研究的重点领域,已有研究的优化目标多集中在系统总费用方面,而对交通可持续发展方面考虑不足。为此,提出综合考虑多方面目标的停车换乘设施选址优化模型及其求解算法。首先,基于超网络理论,提出多方式城市交通系统的超网络模型并定义O-D (Origin-destination)间的超路径、有效超路径及子路径,结合出行者出行过程及交通网络拥挤特征,给出超路径费用的数学表达;其次,基于多方式交通网络随机均衡配流结果,构建交通总阻抗、污染物排放量以及交通系统公平性等系统优化指标的计算模型,并建立用以描述停车换乘设施选址问题的多目标优化模型;进而,以多目标系统优化模型为上层问题,以超网络下满足Logit分配的多方式交通网络配流模型为下层问题,构建描述城市多方式交通系统停车换乘设施选址问题的双层规划模型,并基于模型特征,结合“记录-搜索”思想设计非支配排序遗传算法进行求解;最后,基于Sioux Falls网络设计算例。研究结果表明：算法能够在有限的步骤内搜索到90%以上的Pareto最优解;平均而言,停车换乘措施使得交通总阻抗减小了0.31%,污染物排放量减少了7.32%...     

带阈值的广义双向细胞联想神经网络GCBAM及其稳定性质研究

在提出双向细胞联想神经网络CBAM的基础上,通过引入阈值概念,进而提出了广义双向细胞 联想神经网络GCBAM,研究了其平衡态,存在性质及其Lyapunov意义下的网络稳定性质。     

细粒土路基平衡密度状态分析

为掌握细粒土路基的平衡密度状态及其变化原因,统计分析9条高速公路路床顶部的压实度和含水率检测资料,对3条黄泛区高速公路路基的压实度、含水率以及1条高速公路的路基模量进行全断面深度检测,并开展非饱和细粒土的湿化试验和弹性恢复试验。现场实测发现：在役路基除了实测含水率较最佳含水率有0~13.8%的增加外,相应的压实度出现了0~10%的线性衰减;其中,路床区、上路堤以及受水位波动影响较大的路基底部的压实度降低十分明显,而下路堤上部区域压实度基本维持不变甚至有所增大;路基压实度的变化与土的含水率密切相关。非饱和土三轴试验结果表明：土体湿化过程中,吸水导致体积膨胀和压实度衰减;当路床土吸湿至平衡湿度（含水率为18%）时,土体压实度降低5.07%。弹性恢复试验结果表明：压实路基土因变形恢复导致路基密度衰减;低含水率、高压实度和低上覆荷载条件下的弹性恢复较大,压实路床土弹性恢复导致的压实度降低值最大为0.5%;综合湿化和弹性恢复结果来看,两者占黄泛区路床区压实度衰减总量（约7%）的79.6%;此外,路基剪切模量的原位实测值较相同物理状态下的室内重塑土结果平均高出了60.64%,表明运营多年的高速公路路基土具有一定的结构性。因此,既有路基的评价应该同时考虑路基湿度增加、密度降低以及土体结构性等综合因素。     

Electric vehicle charging station locations: Elastic demand,station congestion,and network equilibrium

Battery-only electric vehicles (BEVs) generally offer better air quality through lowered emissions, along with energy savings and security. The issue of long-duration battery charging makes charging-station placement and design key for BEV adoption rates. This work uses genetic algorithms to identify profit-maximizing station placement and design details, with applications that reflect the costs of installing, operating, and maintaining service equipment, including land acquisition. Fast electric vehicle charging stations (EVCSs) are placed across a congested city's network subject to stochastic demand for charging under a user-equilibrium traffic assignment. BEV users’ station choices consider endogenously determined travel times and on-site charging queues. The model allows for congested-travel and congested-station feedback into travelers’ route choices under elastic demand and BEV owners’ station choices, as well as charging price elasticity for BEV charging users.Boston-network results suggest that EVCSs should locate mostly along major highways, which may be a common finding for other metro settings. If 10% of current EV owners seek to charge en route, a user fee of $6 for a 30-min charging session is not enough for station profitability under a 5-year time horizon in this region. However, $10 per BEV charging delivers a 5-year profit of $0.82 million, and 11 cords across 3 stations are enough to accommodate a near-term charging demand in this Boston-area application. Shorter charging sessions, higher fees, and/or allowing for more cords per site also increase profits generally, everything else constant. Power-grid and station upgrades should keep pace with demand, to maximize profits over time, and avoid on-site congestion.