%0 Journal Article
%T Time-dependent road network and the minimum time path planning algorithm<br>一种时间依赖路网最小时间路径规划算法研究
%A SUN Ao
%A ZHU Gui-bin
%A JIANG Tie
%A SHI Ming-yi
%A <br>孙　奥
%A 朱桂斌
%A 江　铁
%A 史名一
%J 计算机应用研究
%D 2012
%I 
%X It has great significance of the algorithm about the shortest path planning based on the time-dependent road networkTDN. Because it can guide people to travel, solve the urban traffic and other issues. This paper proposed a structure array TDN road network to solve the minimum time path planning algorithm on the basis of previous algorithm. Firstly, it introduced the basic principle of the algorithm and the structure of the array. Then focuses on the implementation and some of the key steps of the algorithm. At last, it used MapX to test based on VC++ environment. The experiment results show that it has high search efficiency. It can adapt to the traffic changes and basically meet the needs of people.
%K path planning
%K minimal time
%K time-dependent road network
%K travel time
%K structure array<br>路径规划
%K 最小时间
%K 时间依赖路网
%K 行程时间
%K 结构体数组
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=AB5C24B90CF8948F1C4E0DC86776368F&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=708DD6B15D2464E8&sid=D6B1B2F1DB0EEAAC&eid=6C2EBACCB14BF1EF&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9