Rapid Physarum Algorithm for shortest path problem

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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

29 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)19-26
Number of pages8
JournalApplied Soft Computing Journal
Publication statusPublished - Oct 2014
Externally publishedYes


  • Heuristic rule
  • Physarum polycephalum
  • Rapid Physarum Algorithm
  • Shortest path problem

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Rapid Physarum Algorithm for shortest path problem'. Together they form a unique fingerprint.

Cite this