• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Proceeding of 2009 international workshop on GIS for transportation >An Optimization Dijkstra Algorithm Based on Two-function Limitation Strategy
【24h】

An Optimization Dijkstra Algorithm Based on Two-function Limitation Strategy

机译：基于二元限制策略的优化Dijkstra算法

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

There are two problems in searching the shortest path by Dijkstra algorithm. One is that the practical application of the result is not satisfactory because of fixed weights; the other is that the time complexity is very high because of searching all nodes. So twofunction limitation strategy is presented. One is that the weights are dynamic evaluated by adaptive function in order to limit the number of bad paths and improve the practicality of Dijkstra algorithm. The other is that the number of reaching nodes is limited by heuristic function according to dynamic weights in order to lower the time complexity. According to the simulation results, we could get the conclusion that two-function limitation strategy can reduce the number of bad paths by 89.2% and improve search efficiency by 58.3%.
机译：用Dijkstra算法搜索最短路径有两个问题。一是由于权重固定，结果的实际应用并不令人满意。二是由于搜索所有节点，时间复杂度很高。因此提出了两种功能限制策略。一种是通过自适应函数对权重进行动态评估，以限制不良路径的数量并提高Dijkstra算法的实用性。另一个是到达节点的数量受启发式函数根据动态权重的限制，以降低时间复杂度。根据仿真结果，可以得出两功能限制策略可以减少不良路径数89.2％，提高搜索效率58.3％的结论。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号