A Column Generation Algorithm for Optimal Traffic Assignment

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.