Skip to main content

Research Repository

Advanced Search

Rapid Physarum Algorithm for shortest path problem

Zhang, Xiaoge; Zhang, Yajuan; Zhang, Zili; Mahadevan, Sankaran; Adamatzky, Andrew; Deng, Yong

Authors

Xiaoge Zhang

Yajuan Zhang

Zili Zhang

Sankaran Mahadevan

Yong Deng



Abstract

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. © 2014 Elsevier B.V.

Journal Article Type Article
Publication Date Jan 1, 2014
Journal Applied Soft Computing Journal
Print ISSN 1568-4946
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 23
Pages 19-26
APA6 Citation Zhang, X., Zhang, Y., Zhang, Z., Mahadevan, S., Adamatzky, A., & Deng, Y. (2014). Rapid Physarum Algorithm for shortest path problem. Applied Soft Computing, 23, 19-26. https://doi.org/10.1016/j.asoc.2014.05.032
DOI https://doi.org/10.1016/j.asoc.2014.05.032
Keywords rapid physarum algorithm, physarum polycephalum, shortest path problem, heuristic rules
Publisher URL http://dx.doi.org/10.1016/j.asoc.2014.05.032
;