%0 Journal Article
%T Shortest Route planning Algorithm within Dynamic Restricted Searching Area<br>一种动态限制搜索区域的最短路径规划算法*
%A WANG Ya-wen
%A WANG Xi-li
%A CAO Han
%A LI Jian-yuan
%A <br>王亚文
%A 汪西莉
%A 曹菡
%A 李建元
%J 计算机应用研究
%D 2007
%I 
%X A shortest route-planning algorithm within a dynamic restricted searching area was proposed.This algorithm restric-ted the searching area according to the spatial distribution feature of the real road network dynamically,in order to reduce the searching size,reduce the time complexity and spatial complexity,enhance the efficiency.The experiment indicates the algorithm can enhance the efficiency of the shortest route-planning in the city which has a relatively regular real road network greatly.
%K dynamic restricted searching area
%K shortest route-planning algorithm
%K Dijkstra algorithm
%K road networks<br>动态限制搜索区域
%K 最短路径规划算法
%K Dijkstra算法
%K 道路网络
%K 动态
%K 限制搜索区域
%K 路径规划算法
%K Area
%K Searching
%K Restricted
%K Dynamic
%K Algorithm
%K 运行效率
%K 最短路径规划
%K 比较规则
%K 网络结构
%K 道路网络
%K 城市
%K 验证
%K 空间复杂度
%K 时间
%K 规模
%K 空间分布特性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F676EB2313EFABBB6F&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=DF92D298D3FF1E6E&sid=CFAC5CB624A41AFD&eid=C753EB8AC8F551B9&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9