.png){kind=icon}
Return
Rapid Physarum Algorithm for shortest path problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2014.05.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Rapid Physarum Algorithm
Physarum polycephalum
Shortest path problem
Heuristic rule
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveIFSJSP: A novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets
PREAI
ShareSaveShareSaveShareSaveShareSave View more