A K-shortest-paths-based algorithm for stochastic traffic assignment model and comparison of computation precision with existing methods

One of the key issues of stochastic traffic assignment (STA) is to make the flow pattern consistent with the practical results. In this paper, the author makes a summary of STOCH algorithm and puts forward a new algorithm to solve the problem of stochastic traffic assignment called k-shortest-paths-based method. First, the paper discussed the widely used STOCH algorithm, especially for “single-pass” and “double-pass” procedures. Case studies with multi-OD pairs are analyzed to demonstrate the steps and advantages in “single-pass” method. Then, the paper presents the “k-shortest-paths-based method”, which not only solves all the stochastic numerical models and improve some drawbacks existed in the current STOCH algorithms, but also posses merits of flexibility, though with a modestly higher computational requirements. The detail explanation on the design idea and steps of the algorithm is given. Finally, the time complexity of various algorithms mentioned in this paper is illustrated.