We present a new algorithm for non-equilibrium traffic assignment problems based on the dynamic generating of the shortest paths between every O-D pair.
提出了基于最短路动态生成的一种新的非平衡交通分配迭代算法。
We present a new algorithm for non-equilibrium traffic assignment problems based on the dynamic generating of the shortest paths between every O-D pair.
提出了基于最短路动态生成的一种新的非平衡交通分配迭代算法。
应用推荐