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

Chung Cheng Lu, Jiangtao Liu, Yunchao Qu, Srinivas Peeta, Nagui M. Rouphail, Xuesong Zhou

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)217-239
Number of pages23
JournalTransportation Research Part B: Methodological
Volume94
DOIs
StatePublished - Dec 1 2016

Fingerprint

Optimal systems
traffic
Travel time
linear model
time
Ecosystem
Assignment
projection
heuristics
travel
Dynamic traffic assignment
simulation
experiment
costs
Costs
Experiments

Keywords

  • Eco-routing
  • Green transportation
  • Marginal emission
  • Multi-scale dynamic network loading
  • Vehicular emission modeling

ASJC Scopus subject areas

  • Transportation
  • Management Science and Operations Research

Cite this

Eco-system optimal time-dependent flow assignment in a congested network. / Lu, Chung Cheng; Liu, Jiangtao; Qu, Yunchao; Peeta, Srinivas; Rouphail, Nagui M.; Zhou, Xuesong.

In: Transportation Research Part B: Methodological, Vol. 94, 01.12.2016, p. 217-239.

Research output: Contribution to journalArticle

Lu, Chung Cheng ; Liu, Jiangtao ; Qu, Yunchao ; Peeta, Srinivas ; Rouphail, Nagui M. ; Zhou, Xuesong. / Eco-system optimal time-dependent flow assignment in a congested network. In: Transportation Research Part B: Methodological. 2016 ; Vol. 94. pp. 217-239.
@article{772b5bbc9eea4699b1618f27352bb5a0,
title = "Eco-system optimal time-dependent flow assignment in a congested network",
abstract = "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.",
keywords = "Eco-routing, Green transportation, Marginal emission, Multi-scale dynamic network loading, Vehicular emission modeling",
author = "Lu, {Chung Cheng} and Jiangtao Liu and Yunchao Qu and Srinivas Peeta and Rouphail, {Nagui M.} and Xuesong Zhou",
year = "2016",
month = "12",
day = "1",
doi = "10.1016/j.trb.2016.09.015",
language = "English (US)",
volume = "94",
pages = "217--239",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

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

AU - Lu, Chung Cheng

AU - Liu, Jiangtao

AU - Qu, Yunchao

AU - Peeta, Srinivas

AU - Rouphail, Nagui M.

AU - Zhou, Xuesong

PY - 2016/12/1

Y1 - 2016/12/1

N2 - 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.

AB - 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.

KW - Eco-routing

KW - Green transportation

KW - Marginal emission

KW - Multi-scale dynamic network loading

KW - Vehicular emission modeling

UR - http://www.scopus.com/inward/record.url?scp=84990196552&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990196552&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2016.09.015

DO - 10.1016/j.trb.2016.09.015

M3 - Article

AN - SCOPUS:84990196552

VL - 94

SP - 217

EP - 239

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -