Development of Dynamic Traffic Assignment Models for Planning Applications

Front Cover
Northwestern University, 2000 - Traffic assignment - 370 pages
Although solution algorithms are very well established for LP problems, the size of the problem that can be solved using the LP formulation is still limited by the power of mathematical programming solvers. To relax such limitations, the network structure within the LP formulations is explored to develop decomposition schemes. Such decomposition of the LP formulation can potentially allow us to solve DTA analytically on large size networks. In addition, insights into the problem can be obtained to help better understanding of the behavior of the transportation network under dynamic demand.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Literature Review
7
6 Decomposition Algorithms in Mathematical Programming
35
Demand Modding for Dynamic Traflic Assignment
41
Copyright

9 other sections not shown

Common terms and phrases

Bibliographic information