Development of Dynamic Traffic Assignment Models for Planning Applications

Résumé du livre

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.