Abstract Much interest has recently been shown in the combination of the distribution and assignment models. In this paper we adopt a generalized Benders' decomposition to solve this combined problem for a system optimized assignment with linear link costs and explicit capacity constraints on link flows. The master problem which is generated is used to show that the combined problem can be viewed as a modified distribution problem, of gravity form, with a minimax instead of a linear objective function. An algorithm for solving the master problem is discussed, and some computational results presented.
An algorithm for the combined distribution and assignment problem
Transportation Research Part B: Methodological ; 15 , 1 ; 21-33
1979-10-22
13 pages
Article (Journal)
Electronic Resource
English
An Algorithm for the Combined Distribution and Assignment Model
British Library Conference Proceedings | 1998
|Algorithm for Equilibrium Transit Assignment Problem
Transportation Research Record | 2005
|