多路径配流模型的一种改进算法

An Improved Algorithm for Multi-Route Traffic Assignment Model

在多路径配流模型中,出行者对每条备选路径的理解阻抗是随机的,经典的STOCH算法通过正向和反向两次搜索最短路径来寻找有效路径.用选择枝的概念简单叙述Logit选择模型,在对经典STOCH算法深刻分析的基础上,提出了一种求解多路径配流问题的改进算法,该算法只需一次反向搜索即可完成有效路径的寻找,从而提高了求解速度,最后给出了算例求解.

In multiroute traffic assignment model, the travel impedance of each route between origin and destination that the customers perceived is a stochastic variable. In classical STOCH (stochastic assignment) algorithm, the valid routes are found through looking both forward and backward for the shortest route. Firstly, this paper introduces the LOGIT multiroute assignment model through alternative concept, and then puts forward an improved algorithm of multiroute assignment problem basing on deep analysis of classical STOCH algorithm. The improved algorithm can accomplish finding out the valid routes only through searching backward for the shortest route, so it increases the speed of solving the problem. Finally the process of resolving an example is given in this paper.