System optimal dynamic traffic assignment

solution structures of the signal control in non-holding-back formulations

Tarikul Islam, Hai L. Vu, Manoj Panda

Research output: Contribution to journalArticleResearchpeer-review

Abstract

This paper devises locally optimal traffic Signal Control (SC) settings in a Non-Holding-Back Dynamic Traffic Assignment with SC (NHB DTA-SC) formulation for single destination (i.e. one source to one destination and many sources to one destination) networks. To this end, we apply temporal–spatial dual decomposition method and decompose the NHB DTA-SC problem into intersection cells and non-intersection cells. Then we further decompose the intersection cells into different subproblems, i.e. Occupancy Minimization (OM), Flow Maximization (FM), and SC. To study the optimal SC structures, we examine the Karush–Kuhn–Tucker (KKT) optimality conditions of the decomposed SC subproblem. Finally, we obtain the locally optimal SC structures under different network conditions that include over-saturated, under-saturated, and queue spillback traffic scenarios. We also present several numerical results to verify the optimality structures found by our theoretical derivations.

Original languageEnglish
Pages (from-to)967-991
Number of pages25
JournalTransportmetrica B: Transport Dynamics
Volume7
Issue number1
DOIs
Publication statusPublished - 2019

Keywords

  • cell transmission model
  • Dynamic Traffic Assignment
  • Lagrangian dual decomposition
  • optimal solution structures
  • traffic signal control
  • vehicle holding-back problem

Cite this

@article{4bd16052c6284887b23b653da190be92,
title = "System optimal dynamic traffic assignment: solution structures of the signal control in non-holding-back formulations",
abstract = "This paper devises locally optimal traffic Signal Control (SC) settings in a Non-Holding-Back Dynamic Traffic Assignment with SC (NHB DTA-SC) formulation for single destination (i.e. one source to one destination and many sources to one destination) networks. To this end, we apply temporal–spatial dual decomposition method and decompose the NHB DTA-SC problem into intersection cells and non-intersection cells. Then we further decompose the intersection cells into different subproblems, i.e. Occupancy Minimization (OM), Flow Maximization (FM), and SC. To study the optimal SC structures, we examine the Karush–Kuhn–Tucker (KKT) optimality conditions of the decomposed SC subproblem. Finally, we obtain the locally optimal SC structures under different network conditions that include over-saturated, under-saturated, and queue spillback traffic scenarios. We also present several numerical results to verify the optimality structures found by our theoretical derivations.",
keywords = "cell transmission model, Dynamic Traffic Assignment, Lagrangian dual decomposition, optimal solution structures, traffic signal control, vehicle holding-back problem",
author = "Tarikul Islam and Vu, {Hai L.} and Manoj Panda",
year = "2019",
doi = "10.1080/21680566.2018.1540950",
language = "English",
volume = "7",
pages = "967--991",
journal = "Transportmetrica B: Transport Dynamics",
issn = "2168-0566",
publisher = "Taylor & Francis",
number = "1",

}

System optimal dynamic traffic assignment : solution structures of the signal control in non-holding-back formulations. / Islam, Tarikul; Vu, Hai L.; Panda, Manoj.

In: Transportmetrica B: Transport Dynamics, Vol. 7, No. 1, 2019, p. 967-991.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - System optimal dynamic traffic assignment

T2 - solution structures of the signal control in non-holding-back formulations

AU - Islam, Tarikul

AU - Vu, Hai L.

AU - Panda, Manoj

PY - 2019

Y1 - 2019

N2 - This paper devises locally optimal traffic Signal Control (SC) settings in a Non-Holding-Back Dynamic Traffic Assignment with SC (NHB DTA-SC) formulation for single destination (i.e. one source to one destination and many sources to one destination) networks. To this end, we apply temporal–spatial dual decomposition method and decompose the NHB DTA-SC problem into intersection cells and non-intersection cells. Then we further decompose the intersection cells into different subproblems, i.e. Occupancy Minimization (OM), Flow Maximization (FM), and SC. To study the optimal SC structures, we examine the Karush–Kuhn–Tucker (KKT) optimality conditions of the decomposed SC subproblem. Finally, we obtain the locally optimal SC structures under different network conditions that include over-saturated, under-saturated, and queue spillback traffic scenarios. We also present several numerical results to verify the optimality structures found by our theoretical derivations.

AB - This paper devises locally optimal traffic Signal Control (SC) settings in a Non-Holding-Back Dynamic Traffic Assignment with SC (NHB DTA-SC) formulation for single destination (i.e. one source to one destination and many sources to one destination) networks. To this end, we apply temporal–spatial dual decomposition method and decompose the NHB DTA-SC problem into intersection cells and non-intersection cells. Then we further decompose the intersection cells into different subproblems, i.e. Occupancy Minimization (OM), Flow Maximization (FM), and SC. To study the optimal SC structures, we examine the Karush–Kuhn–Tucker (KKT) optimality conditions of the decomposed SC subproblem. Finally, we obtain the locally optimal SC structures under different network conditions that include over-saturated, under-saturated, and queue spillback traffic scenarios. We also present several numerical results to verify the optimality structures found by our theoretical derivations.

KW - cell transmission model

KW - Dynamic Traffic Assignment

KW - Lagrangian dual decomposition

KW - optimal solution structures

KW - traffic signal control

KW - vehicle holding-back problem

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

U2 - 10.1080/21680566.2018.1540950

DO - 10.1080/21680566.2018.1540950

M3 - Article

VL - 7

SP - 967

EP - 991

JO - Transportmetrica B: Transport Dynamics

JF - Transportmetrica B: Transport Dynamics

SN - 2168-0566

IS - 1

ER -