Enhancing realism in modeling merge junctions in analytical models for system-optimal dynamic traffic assignment

Wei Hua Lin, Hongchao Liu

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The existing analytical system-optimal dynamic traffic assignment (SO-DTA) model formulated with the linear programming (LP) approach usually assumes system control over vehicles in the entire network. This property would give rise to unreasonable priorities at merge junctions that are sometimes physically impossible to realize for the given roadway configuration. In this paper, we demonstrate that models with and without considering the merge-priority ratio would exhibit very different traffic patterns and route-choice behavior. To realistically model traffic flow on a transportation network, one should properly distinguish the level of control by drivers, roadway geometry, and system providers. This paper also attempts to develop an LP module that explicitly considers the merge-priority ratio of a merge junction and can potentially be incorporated into the existing LP formulation of the SO-DTA problem based on the cell-transmission model. By more realistically modelling the behavior of vehicles at merge junctions, the obtained solution can be used as a benchmark to compare control strategies developed without explicitly considering the merge-priority ratio at merge junctions or strategies developed with heuristic approaches.

Original languageEnglish (US)
Article number5484667
Pages (from-to)838-845
Number of pages8
JournalIEEE Transactions on Intelligent Transportation Systems
Volume11
Issue number4
DOIs
StatePublished - Dec 2010

Fingerprint

Optimal systems
Analytical models
Linear programming
Control systems
Geometry

Keywords

  • Dynamic traffic assignment (DTA)
  • intelligent transportation systems
  • mathematical programming
  • system optimum
  • traffic control
  • traffic-management system

ASJC Scopus subject areas

  • Automotive Engineering
  • Computer Science Applications
  • Mechanical Engineering

Cite this

Enhancing realism in modeling merge junctions in analytical models for system-optimal dynamic traffic assignment. / Lin, Wei Hua; Liu, Hongchao.

In: IEEE Transactions on Intelligent Transportation Systems, Vol. 11, No. 4, 5484667, 12.2010, p. 838-845.

Research output: Contribution to journalArticle

@article{725c3f4270874f9c998595f3a02b28c5,
title = "Enhancing realism in modeling merge junctions in analytical models for system-optimal dynamic traffic assignment",
abstract = "The existing analytical system-optimal dynamic traffic assignment (SO-DTA) model formulated with the linear programming (LP) approach usually assumes system control over vehicles in the entire network. This property would give rise to unreasonable priorities at merge junctions that are sometimes physically impossible to realize for the given roadway configuration. In this paper, we demonstrate that models with and without considering the merge-priority ratio would exhibit very different traffic patterns and route-choice behavior. To realistically model traffic flow on a transportation network, one should properly distinguish the level of control by drivers, roadway geometry, and system providers. This paper also attempts to develop an LP module that explicitly considers the merge-priority ratio of a merge junction and can potentially be incorporated into the existing LP formulation of the SO-DTA problem based on the cell-transmission model. By more realistically modelling the behavior of vehicles at merge junctions, the obtained solution can be used as a benchmark to compare control strategies developed without explicitly considering the merge-priority ratio at merge junctions or strategies developed with heuristic approaches.",
keywords = "Dynamic traffic assignment (DTA), intelligent transportation systems, mathematical programming, system optimum, traffic control, traffic-management system",
author = "Lin, {Wei Hua} and Hongchao Liu",
year = "2010",
month = "12",
doi = "10.1109/TITS.2010.2050880",
language = "English (US)",
volume = "11",
pages = "838--845",
journal = "IEEE Transactions on Intelligent Transportation Systems",
issn = "1524-9050",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Enhancing realism in modeling merge junctions in analytical models for system-optimal dynamic traffic assignment

AU - Lin, Wei Hua

AU - Liu, Hongchao

PY - 2010/12

Y1 - 2010/12

N2 - The existing analytical system-optimal dynamic traffic assignment (SO-DTA) model formulated with the linear programming (LP) approach usually assumes system control over vehicles in the entire network. This property would give rise to unreasonable priorities at merge junctions that are sometimes physically impossible to realize for the given roadway configuration. In this paper, we demonstrate that models with and without considering the merge-priority ratio would exhibit very different traffic patterns and route-choice behavior. To realistically model traffic flow on a transportation network, one should properly distinguish the level of control by drivers, roadway geometry, and system providers. This paper also attempts to develop an LP module that explicitly considers the merge-priority ratio of a merge junction and can potentially be incorporated into the existing LP formulation of the SO-DTA problem based on the cell-transmission model. By more realistically modelling the behavior of vehicles at merge junctions, the obtained solution can be used as a benchmark to compare control strategies developed without explicitly considering the merge-priority ratio at merge junctions or strategies developed with heuristic approaches.

AB - The existing analytical system-optimal dynamic traffic assignment (SO-DTA) model formulated with the linear programming (LP) approach usually assumes system control over vehicles in the entire network. This property would give rise to unreasonable priorities at merge junctions that are sometimes physically impossible to realize for the given roadway configuration. In this paper, we demonstrate that models with and without considering the merge-priority ratio would exhibit very different traffic patterns and route-choice behavior. To realistically model traffic flow on a transportation network, one should properly distinguish the level of control by drivers, roadway geometry, and system providers. This paper also attempts to develop an LP module that explicitly considers the merge-priority ratio of a merge junction and can potentially be incorporated into the existing LP formulation of the SO-DTA problem based on the cell-transmission model. By more realistically modelling the behavior of vehicles at merge junctions, the obtained solution can be used as a benchmark to compare control strategies developed without explicitly considering the merge-priority ratio at merge junctions or strategies developed with heuristic approaches.

KW - Dynamic traffic assignment (DTA)

KW - intelligent transportation systems

KW - mathematical programming

KW - system optimum

KW - traffic control

KW - traffic-management system

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

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

U2 - 10.1109/TITS.2010.2050880

DO - 10.1109/TITS.2010.2050880

M3 - Article

AN - SCOPUS:78649730623

VL - 11

SP - 838

EP - 845

JO - IEEE Transactions on Intelligent Transportation Systems

JF - IEEE Transactions on Intelligent Transportation Systems

SN - 1524-9050

IS - 4

M1 - 5484667

ER -