Eco-system optimal time-dependent flow assignment in a congested network

Eco-system optimal time-dependent flow assignment in a congested network
复制标题

DOI:
10.1016/j.trb.2016.09.015
复制
发表时间:
2016-12
影响因子:
6.8
通讯作者:
C. Lu;Jiangtao Liu;Yunchao Qu;S. Peeta;N. Rouphail;Xuesong Zhou
C. Lu;Jiangtao Liu;Yunchao Qu;S. Peeta;N. Rouphail;Xuesong Zhou
中科院分区:
工程技术1区
文献类型:
--
作者:
C. Lu;Jiangtao Liu;Yunchao Qu;S. Peeta;N. Rouphail;Xuesong Zhou

文献摘要

被引文献

相似文献

本文研究了生态系统最优动态交通分配问题,旨在寻找系统最优生态路径或绿色路径流,使拥挤网络中的车辆排放总量最小。本文提出了一种通用的基于Agent的ESODTA模型和一种简化的排队模型(SQM),该模型能够清晰地区分自由流和拥挤条件下的车辆速度,便于分析路段排放与延误之间的关系。在此基础上,构建了一个扩展的时空网络,用于求解具有恒定瓶颈流量的ESODTA。所得的ESODTA的整数线性模型求解的拉格朗日松弛为基础的算法。对于基于模拟的ESODTA,我们提出了基于列生成的启发式,这需要在嵌入式时间相关的最小成本路径算法和基于梯度投影的下降方向方法的链路和路径的边际排放。我们推导出一个公式的边际排放,其中包括边际行程时间作为一种特殊情况,并开发了一个算法,用于评估路径的边际排放在拥挤的网络。数值实验表明,该算法能够有效地获得协调的路径流,使大规模网络中的车辆排放达到最小.
This research addresses the eco-system optimal dynamic traffic assignment (ESODTA) problem which aims to find system optimal eco-routing or green routing flows that minimize total vehicular emission in a congested network. We propose a generic agent-based ESODTA model and a simplified queueing model (SQM) that is able to clearly distinguish vehicles’ speed in free-flow and congested conditions for multi-scale emission analysis, and facilitates analyzing the relationship between link emission and delay. Based on the SQM, an expanded space-time network is constructed to formulate the ESODTA with constant bottleneck discharge capacities. The resulting integer linear model of the ESODTA is solved by a Lagrangian relaxation-based algorithm. For the simulation-based ESODTA, we present the column-generation-based heuristic, which requires link and path marginal emissions in the embedded time-dependent least-cost path algorithm and the gradient-projection-based descent direction method. We derive a formula of marginal emission which encompasses the marginal travel time as a special case, and develop an algorithm for evaluating path marginal emissions in a congested network. Numerical experiments are conducted to demonstrate that the proposed algorithm is able to effectively obtain coordinated route flows that minimize the system-wide vehicular emission for large-scale networks.