.png){kind=icon}
返回
Rapid Physarum Algorithm for shortest path problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2014.05.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As shortest path (SP) problem has been one of the most fundamental network optimization problems for a long time, technologies for this problem are still being studied. In this paper, a new method by integrating a path finding mathematical model, inspired by Physarum polycephalum, with extracted one heuristic rule to solve SP problem has been proposed, which is called Rapid Physarum Algorithm (RPA). Simulation experiments have been carried out on three different network topologies with varying number of nodes. It is noted that the proposed RPA can find the optimal path as the path finding model does for most networks. What is more, experimental results show that the performance of RPA surpasses the path finding model on both iterations and solution time. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Rapid Physarum Algorithm
Physarum polycephalum
Shortest path problem
Heuristic rule
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
Navigation of a free-ranging mobile robot using heuristic local path-planning algorithm基于启发式局部路径规划算法的自由测距移动机器人导航
PREAI
分享收藏
IFSJSP: A novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets
PREAI
分享收藏分享收藏
查看更多内容