A Column Generation Algorithm for Optimal Traffic Assignment

T. Leventhal, G. Nemhauser and L. Trotter
Additional contact information
T. Leventhal: Cornell University, Ithaca, New York
G. Nemhauser: Cornell University, Ithaca, New York
L. Trotter: Cornell University, Ithaca, New York

Transportation Science, 1973, vol. 7, issue 2, 168-176

Abstract: A column generation algorithm for solving a class of nonlinear traffic assignment problems is presented. The fundamental advantage of the algorithm is that it does not require the a priori generation of all paths joining each origin-destination pair. The algorithm is capable of handling rather large networks. Computational experience that contrasts column generation with the a priori generation of all paths and compares two different quadratic programming algorithms is reported.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.7.2.168 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:7:y:1973:i:2:p:168-176

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().