Answers are grounded in this paper and cite their sources.
The focus of this paper is on a certain class of equilibrium traffic assignment problems characterized by a path formulation of the associated mathematical programs. In such cases the equilibration iterations would require path enumeration, and are therefore prohibitively expensive. In this paper we prove that a predetermined sequence of step sizes (in a descent direction) would guarantee, under certain regularity conditions, convergence to the equilibrium solution. This algorithm was suggested in the literature without a proof of convergence, which we give here.
No takes yet. Share an insight, caveat, or question.
Powell et al. (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: