期刊名称：Advances in Mechanical Engineering and its Applications
印刷版ISSN：2167-6380
出版年度：2012
卷号：2
期号：4
页码：251-254
语种：English
出版社：World Science Publisher
摘要：Through modifying Auction Algorithm for the static shortest path, a new searching algorithm based on dynamic travel time was proposed. Taking the deviation between the searching in the static traffic network and the dynamic travel time related to the actual traffic into consideration, the searching of shortest paths in the dynamic network was chose. Firstly, the general spatial traffic network was enlarged to time-space network based on the definite expanding principles. Through this enlargement, the problem of searching dynamic shortest paths can be translated into the general shortest path problem. This translation can supply a basis for using the static shortest path searching methods in the dynamic traffic network. Then the new auction algorithm used for searching dynamic shortest paths was proposed that was concise without the help of the time-space network. Finally, the applicability of the new algorithm’s was proved by a simple example.
