A network flow algorithm for the cell-based single-destination system optimal dynamic traffic assignment problem

Hong Zheng, Yi-Chang Chiu

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

The cell-transmission model-based single-destination system optimal dynamic traffic assignment problem proposed by Ziliaskopoulos was mostly solved by standard linear programming (LP) methods, e.g., simplex and interior point methods, which produce link-based flows involving vehicle-holding phenomenon. In this paper we present a network flow algorithm for this problem. We show that the problem is equivalent to the earliest arrival flow and then solve the earliest arrival flow on a time-expanded network. In particular, a scaled flow scheme is proposed to deal with the situation in which the ratio of backward wave speed to forward wave speed is less than one. The proposed algorithm produces path-based flows exhibiting realistic nonvehicleholding properties. Complexity and numerical analyses show that the algorithm runs more efficiently than LP.

Original languageEnglish (US)
Pages (from-to)121-137
Number of pages17
JournalTransportation Science
Volume45
Issue number1
DOIs
StatePublished - Feb 2011

Fingerprint

Optimal systems
traffic
Linear programming
programming

Keywords

  • Cell-transmission model
  • Dynamic traffic assignment
  • Network flows
  • System optimal
  • Vehicle-holding

ASJC Scopus subject areas

  • Transportation

Cite this

A network flow algorithm for the cell-based single-destination system optimal dynamic traffic assignment problem. / Zheng, Hong; Chiu, Yi-Chang.

In: Transportation Science, Vol. 45, No. 1, 02.2011, p. 121-137.

Research output: Contribution to journalArticle

@article{534992c672e54635a14f2018aca8faff,
title = "A network flow algorithm for the cell-based single-destination system optimal dynamic traffic assignment problem",
abstract = "The cell-transmission model-based single-destination system optimal dynamic traffic assignment problem proposed by Ziliaskopoulos was mostly solved by standard linear programming (LP) methods, e.g., simplex and interior point methods, which produce link-based flows involving vehicle-holding phenomenon. In this paper we present a network flow algorithm for this problem. We show that the problem is equivalent to the earliest arrival flow and then solve the earliest arrival flow on a time-expanded network. In particular, a scaled flow scheme is proposed to deal with the situation in which the ratio of backward wave speed to forward wave speed is less than one. The proposed algorithm produces path-based flows exhibiting realistic nonvehicleholding properties. Complexity and numerical analyses show that the algorithm runs more efficiently than LP.",
keywords = "Cell-transmission model, Dynamic traffic assignment, Network flows, System optimal, Vehicle-holding",
author = "Hong Zheng and Yi-Chang Chiu",
year = "2011",
month = "2",
doi = "10.1287/trsc.1100.0343",
language = "English (US)",
volume = "45",
pages = "121--137",
journal = "Transportation Science",
issn = "0041-1655",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "1",

}

TY - JOUR

T1 - A network flow algorithm for the cell-based single-destination system optimal dynamic traffic assignment problem

AU - Zheng, Hong

AU - Chiu, Yi-Chang

PY - 2011/2

Y1 - 2011/2

N2 - The cell-transmission model-based single-destination system optimal dynamic traffic assignment problem proposed by Ziliaskopoulos was mostly solved by standard linear programming (LP) methods, e.g., simplex and interior point methods, which produce link-based flows involving vehicle-holding phenomenon. In this paper we present a network flow algorithm for this problem. We show that the problem is equivalent to the earliest arrival flow and then solve the earliest arrival flow on a time-expanded network. In particular, a scaled flow scheme is proposed to deal with the situation in which the ratio of backward wave speed to forward wave speed is less than one. The proposed algorithm produces path-based flows exhibiting realistic nonvehicleholding properties. Complexity and numerical analyses show that the algorithm runs more efficiently than LP.

AB - The cell-transmission model-based single-destination system optimal dynamic traffic assignment problem proposed by Ziliaskopoulos was mostly solved by standard linear programming (LP) methods, e.g., simplex and interior point methods, which produce link-based flows involving vehicle-holding phenomenon. In this paper we present a network flow algorithm for this problem. We show that the problem is equivalent to the earliest arrival flow and then solve the earliest arrival flow on a time-expanded network. In particular, a scaled flow scheme is proposed to deal with the situation in which the ratio of backward wave speed to forward wave speed is less than one. The proposed algorithm produces path-based flows exhibiting realistic nonvehicleholding properties. Complexity and numerical analyses show that the algorithm runs more efficiently than LP.

KW - Cell-transmission model

KW - Dynamic traffic assignment

KW - Network flows

KW - System optimal

KW - Vehicle-holding

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

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

U2 - 10.1287/trsc.1100.0343

DO - 10.1287/trsc.1100.0343

M3 - Article

AN - SCOPUS:79951912954

VL - 45

SP - 121

EP - 137

JO - Transportation Science

JF - Transportation Science

SN - 0041-1655

IS - 1

ER -