机构地区: 中山大学工学院
出 处: 《中山大学学报(自然科学版)》 2007年第5期29-31,40,共4页
摘 要: 提出了一种改进的基于拓扑遍历Logit型多路径交通分配算法。算法将基于拓扑遍历的最短路算法与合理路径的选择相结合,有效减少了最短路的计算次数,提出了与经典Dial算法的单步法计算工作量相等的算法,改进了合理路径的定义并提高了计算精度。通过计算实例对不同算法的效率与合理性进行了比较。 An improved algorithm, based on topological scan for logit multi-path traffic assignment, is proposed. By combining topological scan and definition of reasonable paths, the numbers of shortest path calculation is significantly reduced and improved versions of classical Dial's single-pass algorithm are presented. The efficiency of Dial's algorithm remains, while the definition of "reasonable paths" is improved. Numerical examples are presented to compare the efficiency and reasonability of different algorithms.
关 键 词: 交通工程 型交通分配 算法 拓扑遍历 最短路径
领 域: [交通运输工程]