A linear programming model for the single destination System Optimum Dynamic Traffic Assignment problem

Ziliaskopoulos, AK

doi:10.1287/trsc.34.1.37.12281

Return

A linear programming model for the single destination System Optimum Dynamic Traffic Assignment problem

2000-02-01

421

PRE

Ziliaskopoulos, AK *

DOI：10.1287/trsc.34.1.37.12281

Original

Original request for help

Save

Abstract

En 中文

Recently, Daganzo introduced the cell transmission model-a simple approach for modeling highway traffic flow consistent with the hydrodynamic model. In this paper, toe use the cell transmission model to formulate the single destination System Optimum Dynamic Traffic Assignment (SO DTA) problem as a Linear Program (LP). We demonstrate that the model can. obtain insights into the DTA problem, and we address various related issues, such as the concept of marginal travel time in a dynamic network and system optimum necessary and sufficient conditions. The model is limited to one destination and, although it can account for traffic realities as they are captured by the cell transmission model, it is not presented as an. operational model for actual applications. The main, objective of the paper is to demonstrate that the DTA problem can be modeled as an LP, which allows the vast existing literature on LP to be used to better under stand and compute DTA. A numerical example illustrates the simplicity and applicability, of the proposed approach.

Keywords:

CELL TRANSMISSION MODEL

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.