Network flow solution method for optimal evacuation traffic routing and signal control with nonuniform threat

Neema Nassir, Mark Hickman, Hong Zheng, Yi-Chang Chiu

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

An efficient two-stage network flow approach is proposed for the determination of optimal scenarios for integrated traffic routing and signal timing in the evacuation of real-sized urban networks with several threat zones, where the threat levels may be nonuniform across zones. The objective is to minimize total exposure to the threat (severity multiplied by duration) for all evacuees during the evacuation. In the problem formulation, traffic flow dynamics are based on the well-known point queue model in a time-expanded network representation. The proposed solution approach is adapted from a general relaxation-based decomposition method in a network flow formulation. The decomposition method is developed on the basis of insights into the optimal flow of traffic at intersections in the solution of the evacuation routing problem. As for efficiency, the computation time associated with the decomposition method for solving the integrated optimal routing and signal control problem Ls equivalent to the time required for solving the same optimal routing problem (without optimizing the intersection control plan) because the computation time required for determining the optimal signal control is negligible. The proposed solution method proves to be optimal. The method is implemented and applied to a real-sized evacuation scenario in the transportation network of Tucson, Arizona. The method is stress-tested with some inflated demand scenarios, and computation aspects are reported.

Original languageEnglish (US)
Pages (from-to)54-62
Number of pages9
JournalTransportation Research Record
Volume2459
DOIs
StatePublished - 2014

Fingerprint

Decomposition

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Mechanical Engineering

Cite this

Network flow solution method for optimal evacuation traffic routing and signal control with nonuniform threat. / Nassir, Neema; Hickman, Mark; Zheng, Hong; Chiu, Yi-Chang.

In: Transportation Research Record, Vol. 2459, 2014, p. 54-62.

Research output: Contribution to journalArticle

@article{e6771c45506f485a8d6464f6c3d0c90c,
title = "Network flow solution method for optimal evacuation traffic routing and signal control with nonuniform threat",
abstract = "An efficient two-stage network flow approach is proposed for the determination of optimal scenarios for integrated traffic routing and signal timing in the evacuation of real-sized urban networks with several threat zones, where the threat levels may be nonuniform across zones. The objective is to minimize total exposure to the threat (severity multiplied by duration) for all evacuees during the evacuation. In the problem formulation, traffic flow dynamics are based on the well-known point queue model in a time-expanded network representation. The proposed solution approach is adapted from a general relaxation-based decomposition method in a network flow formulation. The decomposition method is developed on the basis of insights into the optimal flow of traffic at intersections in the solution of the evacuation routing problem. As for efficiency, the computation time associated with the decomposition method for solving the integrated optimal routing and signal control problem Ls equivalent to the time required for solving the same optimal routing problem (without optimizing the intersection control plan) because the computation time required for determining the optimal signal control is negligible. The proposed solution method proves to be optimal. The method is implemented and applied to a real-sized evacuation scenario in the transportation network of Tucson, Arizona. The method is stress-tested with some inflated demand scenarios, and computation aspects are reported.",
author = "Neema Nassir and Mark Hickman and Hong Zheng and Yi-Chang Chiu",
year = "2014",
doi = "10.3141/2459-07",
language = "English (US)",
volume = "2459",
pages = "54--62",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "US National Research Council",

}

TY - JOUR

T1 - Network flow solution method for optimal evacuation traffic routing and signal control with nonuniform threat

AU - Nassir, Neema

AU - Hickman, Mark

AU - Zheng, Hong

AU - Chiu, Yi-Chang

PY - 2014

Y1 - 2014

N2 - An efficient two-stage network flow approach is proposed for the determination of optimal scenarios for integrated traffic routing and signal timing in the evacuation of real-sized urban networks with several threat zones, where the threat levels may be nonuniform across zones. The objective is to minimize total exposure to the threat (severity multiplied by duration) for all evacuees during the evacuation. In the problem formulation, traffic flow dynamics are based on the well-known point queue model in a time-expanded network representation. The proposed solution approach is adapted from a general relaxation-based decomposition method in a network flow formulation. The decomposition method is developed on the basis of insights into the optimal flow of traffic at intersections in the solution of the evacuation routing problem. As for efficiency, the computation time associated with the decomposition method for solving the integrated optimal routing and signal control problem Ls equivalent to the time required for solving the same optimal routing problem (without optimizing the intersection control plan) because the computation time required for determining the optimal signal control is negligible. The proposed solution method proves to be optimal. The method is implemented and applied to a real-sized evacuation scenario in the transportation network of Tucson, Arizona. The method is stress-tested with some inflated demand scenarios, and computation aspects are reported.

AB - An efficient two-stage network flow approach is proposed for the determination of optimal scenarios for integrated traffic routing and signal timing in the evacuation of real-sized urban networks with several threat zones, where the threat levels may be nonuniform across zones. The objective is to minimize total exposure to the threat (severity multiplied by duration) for all evacuees during the evacuation. In the problem formulation, traffic flow dynamics are based on the well-known point queue model in a time-expanded network representation. The proposed solution approach is adapted from a general relaxation-based decomposition method in a network flow formulation. The decomposition method is developed on the basis of insights into the optimal flow of traffic at intersections in the solution of the evacuation routing problem. As for efficiency, the computation time associated with the decomposition method for solving the integrated optimal routing and signal control problem Ls equivalent to the time required for solving the same optimal routing problem (without optimizing the intersection control plan) because the computation time required for determining the optimal signal control is negligible. The proposed solution method proves to be optimal. The method is implemented and applied to a real-sized evacuation scenario in the transportation network of Tucson, Arizona. The method is stress-tested with some inflated demand scenarios, and computation aspects are reported.

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

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

U2 - 10.3141/2459-07

DO - 10.3141/2459-07

M3 - Article

VL - 2459

SP - 54

EP - 62

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

ER -