Abstract:
The problem of transportation planning is stated as that of two flows in a network the essential feature of which is interrelationship of the flows. The problem is reduced to a two-level set of simpler problems. To make solutions of these consistent, an iterative algorithm is suggested which is a modification of the Kornau-Liptak algorithm and feature choice coefficients for damping the subproblem solution oscilations and insures a higher rate of convergence.