.png){kind=icon}
返回
Eco-system optimal time-dependent flow assignment in a congested network
.png){kind=icon}
OA
AI
DOI：10.1016/j.trb.2016.09.015.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Green transportation
Vehicular emission modeling
Eco-routing
Marginal emission
Multi-scale dynamic network loading
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
Recycling of the Diamond-wire Saw Powder by Ni-catalyzed Nitridation to Prepare Si3N4.png)
Silicon
SiliconIF0
PREAI
分享收藏Stochastic quasi-gradient algorithm for the off-line stochastic dynamic traffic assignment problem
PREAI
分享收藏
分享收藏
查看更多内容