LINDO Procedure for Dijkstras Algorithm for Shortest Paths in Traffic Planning
Dijkstras algorithm is usually used to calculate the shortest path (the shortest travel time or the shortest distance or the minimum cost) in traffic planning. But the calculation of Dijkstras algorithm is complex. The calculation is very complex when the road network is more than 30 nodes. The LINDO procedure for Dijkstras algorithm is simple and practicable. The LINDO procedure is given in this paper. To evaluate the LINDO procedure of our proposed, we experiment a number of test problems. The computational results are compared with the results before optimization and show that the effectiveness and applicability of the proposed procedure.
traffic planning shortest path Dijkstras algorithm LINDO procedure
Miao Xiaokun Jin Hui
College of Automobile and Transportation Engineering, Liaoning University of Technology, Jinzhou 121001 China
国际会议
武汉
英文
941-944
2010-06-06（万方平台首次上网日期，不代表论文的发表时间）