Dynamic programming approach for online freeway flow propagation adjustment

Xuesong Zhou, Hani S. Mahmassani

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

An optimization framework for online flow propagation adjustment in a freeway context was proposed. Instead of performing local adjustment for individual links separately, the proposed framework considers the interconnectivity of links in a traffic network. In particular, dynamic behavior in the mesoscopic simulation is approximated by the finite-difference method at a macroscopic level. The proposed model seeks to minimize the deviation between simulated density and anticipated density. By taking advantage of the serial structure of a freeway, an efficient dynamic programming algorithm has been developed and tested. The experiment results compared with analytic results as the base case showed the superior performance of dynamic programming methods over the classical proportion control method. The effect of varying update intervals was also examined. The simulation results suggest that a greedy method considering the impact of inconsistency propagation achieves the best trade-off in terms of computation effort and solution quality.

Original languageEnglish (US)
Pages (from-to)263-270
Number of pages8
JournalTransportation Research Record
Issue number1802
StatePublished - 2002
Externally publishedYes

Fingerprint

Highway systems
Dynamic programming
Finite difference method
Experiments

ASJC Scopus subject areas

  • Civil and Structural Engineering

Cite this

Dynamic programming approach for online freeway flow propagation adjustment. / Zhou, Xuesong; Mahmassani, Hani S.

In: Transportation Research Record, No. 1802, 2002, p. 263-270.

Research output: Contribution to journalArticle

@article{16e36d65cf6045cf99327486ebd48953,
title = "Dynamic programming approach for online freeway flow propagation adjustment",
abstract = "An optimization framework for online flow propagation adjustment in a freeway context was proposed. Instead of performing local adjustment for individual links separately, the proposed framework considers the interconnectivity of links in a traffic network. In particular, dynamic behavior in the mesoscopic simulation is approximated by the finite-difference method at a macroscopic level. The proposed model seeks to minimize the deviation between simulated density and anticipated density. By taking advantage of the serial structure of a freeway, an efficient dynamic programming algorithm has been developed and tested. The experiment results compared with analytic results as the base case showed the superior performance of dynamic programming methods over the classical proportion control method. The effect of varying update intervals was also examined. The simulation results suggest that a greedy method considering the impact of inconsistency propagation achieves the best trade-off in terms of computation effort and solution quality.",
author = "Xuesong Zhou and Mahmassani, {Hani S.}",
year = "2002",
language = "English (US)",
pages = "263--270",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "US National Research Council",
number = "1802",

}

TY - JOUR

T1 - Dynamic programming approach for online freeway flow propagation adjustment

AU - Zhou, Xuesong

AU - Mahmassani, Hani S.

PY - 2002

Y1 - 2002

N2 - An optimization framework for online flow propagation adjustment in a freeway context was proposed. Instead of performing local adjustment for individual links separately, the proposed framework considers the interconnectivity of links in a traffic network. In particular, dynamic behavior in the mesoscopic simulation is approximated by the finite-difference method at a macroscopic level. The proposed model seeks to minimize the deviation between simulated density and anticipated density. By taking advantage of the serial structure of a freeway, an efficient dynamic programming algorithm has been developed and tested. The experiment results compared with analytic results as the base case showed the superior performance of dynamic programming methods over the classical proportion control method. The effect of varying update intervals was also examined. The simulation results suggest that a greedy method considering the impact of inconsistency propagation achieves the best trade-off in terms of computation effort and solution quality.

AB - An optimization framework for online flow propagation adjustment in a freeway context was proposed. Instead of performing local adjustment for individual links separately, the proposed framework considers the interconnectivity of links in a traffic network. In particular, dynamic behavior in the mesoscopic simulation is approximated by the finite-difference method at a macroscopic level. The proposed model seeks to minimize the deviation between simulated density and anticipated density. By taking advantage of the serial structure of a freeway, an efficient dynamic programming algorithm has been developed and tested. The experiment results compared with analytic results as the base case showed the superior performance of dynamic programming methods over the classical proportion control method. The effect of varying update intervals was also examined. The simulation results suggest that a greedy method considering the impact of inconsistency propagation achieves the best trade-off in terms of computation effort and solution quality.

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

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

M3 - Article

AN - SCOPUS:0036960029

SP - 263

EP - 270

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - 1802

ER -