最短路径Auction算法及其在路径诱导中的应用

通过采用C#语言程序，对比传统路径算法，并在实际道路网络和随机网络中进行了试验，测试了算法在求解网络“一对一”最短路径问题时的运算性能．结果表明，Auction算法在求解此类问题时，体现算法自身原理的优势，虽然整体性能表现不及经典的路径算法，即迭代步骤略多，但仍有改进的余地．

Auction Algorithm for Shortest Paths and its Application in Route Guidance

Taking Dijkstra＇s algorithm as a reference, the algorithm＇s performance was tested in the ＂one-to-one＂ shortest path problems via a corresponding computer program coded in C #. The compu- tational tests on the actual networks and random networks show the advantages of Auction algorithm＇ s principle. But its overall performance is not as good as labeling algorithms, i.e. some computational steps of iteration are repeated too many times, affecting the efficiency. Reducing these redundant op- erations, Auction algorithm could be improved.