A linear programming model for the single destination system optimum dynamic traffic assignment problem

A linear programming model for the single destination system optimum dynamic traffic assignment problem

0.00 Avg rating0 Votes
Article ID: iaor2001885
Country: United States
Volume: 34
Issue: 1
Start Page Number: 37
End Page Number: 49
Publication Date: Feb 2000
Journal: Transportation Science
Authors:
Keywords: programming: linear, programming: assignment
Abstract:

Recently, Daganzo introduced the cell transmission model — a simple approach for modeling highway traffic flow consistent with the hydrodynamic model. In this paper, we 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 understand and compute DTA. A numerical example illustrates the simplicity and applicability of the proposed approach.

Reviews

Required fields are marked *. Your email address will not be published.