On the system optimum dynamic traffic assignment and earliest arrival flow problems

Hong Zheng, Yi Chang Chiu, Pitu Mirchandani

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

This paper investigates the cell-transmission model (CTM)-based single destination system optimum dynamic traffic assignment (SO-DTA) problem, focusing attention on a case where the cell properties are timeinvariant. We show the backward propagation of congestion in CTM does not affect the optimal arrival flow pattern of SO-DTA, if the fundamental diagram is of triangular/trapezoidal shape as in the CTM. We mathematically prove that the set of earliest arrival flows (EAFs) not constrained by the traffic wave propagation equations obtained on the node-arc network without cell division is a subset of the SO-DTA. This finding leads to a new approach to the SO-DTA that solves the EAF. Such an EAF can be obtained by merely applying static flow techniques and turning the static flows into dynamic flows over time. Therefore, SO-DTA can theoretically be solved with a run time at the link level depending polynomially on logT. We use numerical examples to verify the results and report the computational benefits of the proposed method by solving SO-DTA on a real-world network.

Original languageEnglish (US)
Pages (from-to)13-27
Number of pages15
JournalTransportation Science
Volume49
Issue number1
DOIs
StatePublished - Feb 1 2015

Fingerprint

traffic
Flow patterns
Wave propagation
Cells
time

Keywords

  • Cell-transmission model
  • Dynamic traffic assignment
  • Earliest arrival flows
  • Flows over time
  • System optimum

ASJC Scopus subject areas

  • Transportation

Cite this

On the system optimum dynamic traffic assignment and earliest arrival flow problems. / Zheng, Hong; Chiu, Yi Chang; Mirchandani, Pitu.

In: Transportation Science, Vol. 49, No. 1, 01.02.2015, p. 13-27.

Research output: Contribution to journalArticle

@article{30cda504a767448ebe121fa71cc32115,
title = "On the system optimum dynamic traffic assignment and earliest arrival flow problems",
abstract = "This paper investigates the cell-transmission model (CTM)-based single destination system optimum dynamic traffic assignment (SO-DTA) problem, focusing attention on a case where the cell properties are timeinvariant. We show the backward propagation of congestion in CTM does not affect the optimal arrival flow pattern of SO-DTA, if the fundamental diagram is of triangular/trapezoidal shape as in the CTM. We mathematically prove that the set of earliest arrival flows (EAFs) not constrained by the traffic wave propagation equations obtained on the node-arc network without cell division is a subset of the SO-DTA. This finding leads to a new approach to the SO-DTA that solves the EAF. Such an EAF can be obtained by merely applying static flow techniques and turning the static flows into dynamic flows over time. Therefore, SO-DTA can theoretically be solved with a run time at the link level depending polynomially on logT. We use numerical examples to verify the results and report the computational benefits of the proposed method by solving SO-DTA on a real-world network.",
keywords = "Cell-transmission model, Dynamic traffic assignment, Earliest arrival flows, Flows over time, System optimum",
author = "Hong Zheng and Chiu, {Yi Chang} and Pitu Mirchandani",
year = "2015",
month = "2",
day = "1",
doi = "10.1287/trsc.2013.0485",
language = "English (US)",
volume = "49",
pages = "13--27",
journal = "Transportation Science",
issn = "0041-1655",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "1",

}

TY - JOUR

T1 - On the system optimum dynamic traffic assignment and earliest arrival flow problems

AU - Zheng, Hong

AU - Chiu, Yi Chang

AU - Mirchandani, Pitu

PY - 2015/2/1

Y1 - 2015/2/1

N2 - This paper investigates the cell-transmission model (CTM)-based single destination system optimum dynamic traffic assignment (SO-DTA) problem, focusing attention on a case where the cell properties are timeinvariant. We show the backward propagation of congestion in CTM does not affect the optimal arrival flow pattern of SO-DTA, if the fundamental diagram is of triangular/trapezoidal shape as in the CTM. We mathematically prove that the set of earliest arrival flows (EAFs) not constrained by the traffic wave propagation equations obtained on the node-arc network without cell division is a subset of the SO-DTA. This finding leads to a new approach to the SO-DTA that solves the EAF. Such an EAF can be obtained by merely applying static flow techniques and turning the static flows into dynamic flows over time. Therefore, SO-DTA can theoretically be solved with a run time at the link level depending polynomially on logT. We use numerical examples to verify the results and report the computational benefits of the proposed method by solving SO-DTA on a real-world network.

AB - This paper investigates the cell-transmission model (CTM)-based single destination system optimum dynamic traffic assignment (SO-DTA) problem, focusing attention on a case where the cell properties are timeinvariant. We show the backward propagation of congestion in CTM does not affect the optimal arrival flow pattern of SO-DTA, if the fundamental diagram is of triangular/trapezoidal shape as in the CTM. We mathematically prove that the set of earliest arrival flows (EAFs) not constrained by the traffic wave propagation equations obtained on the node-arc network without cell division is a subset of the SO-DTA. This finding leads to a new approach to the SO-DTA that solves the EAF. Such an EAF can be obtained by merely applying static flow techniques and turning the static flows into dynamic flows over time. Therefore, SO-DTA can theoretically be solved with a run time at the link level depending polynomially on logT. We use numerical examples to verify the results and report the computational benefits of the proposed method by solving SO-DTA on a real-world network.

KW - Cell-transmission model

KW - Dynamic traffic assignment

KW - Earliest arrival flows

KW - Flows over time

KW - System optimum

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

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

U2 - 10.1287/trsc.2013.0485

DO - 10.1287/trsc.2013.0485

M3 - Article

AN - SCOPUS:84922588968

VL - 49

SP - 13

EP - 27

JO - Transportation Science

JF - Transportation Science

SN - 0041-1655

IS - 1

ER -