Abstract

In prior work we have given an intuitive development of Transfer Decomposition, a decomposition of the traffic assignment problem into two traffic assignment problems. The intent of this paper is to provide a rigorous basis for this technique by establishing that it is a generalized Benders decomposition. As an illustration of the result, we give a decomposition algorithm that is based on the familiar Frank-Wolfe method.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call