摘要
提出一种动态限制搜索区域的最短路径规划算法,它是根据实际道路网络的空间分布特性,动态限制搜索区域,以降低算法的搜索规模,降低算法的时间复杂度和空间复杂度,提高算法的运行效率。实验证明,对于实际城市道路网络结构相对比较规则的最短路径规划,此算法极大地提高了规划的效率。
A shortest route-planning algorithm within a dynamic restricted searching area was proposed. This algorithm restricted 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.
出处
《计算机应用研究》
CSCD
北大核心
2007年第7期89-91,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(40471102)
