Rapid Physarum Algorithm for shortest path problem

Zhang, X., Zhang, Y., Zhang, Z., Mahadevan, S., Adamatzky, A. and Deng, Y. (2014) Rapid Physarum Algorithm for shortest path problem. Applied Soft Computing, 23. pp. 19-26. ISSN 1568-4946 Available from: http://eprints.uwe.ac.uk/27006

Full text not available from this repository

Publisher's URL: http://dx.doi.org/10.1016/j.asoc.2014.05.032


As shortest path (SP) problem has been one of the most fundamental network optimization problemsfor a long time, technologies for this problem are still being studied. In this paper, a new method byintegrating a path finding mathematical model, inspired by Physarum polycephalum, with extracted oneheuristic 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 numberof nodes. It is noted that the proposed RPA can find the optimal path as the path finding model does formost networks. What is more, experimental results show that the performance of RPA surpasses the pathfinding model on both iterations and solution time.

Item Type:Article
Uncontrolled Keywords:rapid physarum algorithm, physarum polycephalum, shortest path problem, heuristic rules
Faculty/Department:Faculty of Environment and Technology > Department of Computer Science and Creative Technologies
ID Code:27006
Deposited By: Professor A. Adamatzky
Deposited On:25 Sep 2015 08:28
Last Modified:15 Dec 2016 07:21

Request a change to this item

Document Downloads

Total Document Downloads

More statistics for this item...