Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem (1991)
| Venue: | Transportation Science |
| Citations: | 29 - 20 self |
BibTeX
@ARTICLE{Larsson91simplicialdecomposition,
author = {Torbjörn Larsson and Michael Patriksson},
title = {Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem},
journal = {Transportation Science},
year = {1991},
volume = {26},
pages = {4--17}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The class of simplicial decomposition (SD) schemes have shown to provide efficient tools for nonlinear network flows. When applied to the traffic assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible flows, and, alternately, master problems are solved over the convex hull of the generated extreme points. We review the development of simplicial decomposition and the closely related column generation methods for the traffic assignment problem; we then present a modified, disaggregated, representation of feasible solutions in SD algorithms for convex problems over Cartesian product sets, with application to the symmetric traffic assignment problem. The new algorithm, which is referred to as disaggregate simplicial decomposition (DSD), is given along with a specialized solution method for the disaggregate master problem. Numerical results for several well known test problems and a new one are presented. These experimenta...
