Stochastic Dynamic Traffic Assignment Problem

摘要

This paper presents a method for solving a stochastic version of the dynamic traffic assignment problem. It shows that a globally optimal solution may be obtained by a sequence of linear optimizations. A decomposition algorithm for this procedure is presented that efficiently solves large-scale problems. Solution examples with up to sixty-six thousand variables are described.