DocumentCode
2650582
Title
A method to solve shortest path finding in directed graph based on an amoeboid organism
Author
Xiaoge Zhang ; Zhang, Yajuan ; Zhang, Zili ; Deng, Yong
Author_Institution
Sch. of Comput. & Inf. Sci., Southwest Univ., Chongqing, China
fYear
2012
fDate
23-25 May 2012
Firstpage
3699
Lastpage
3702
Abstract
The slime mold Physarum polycephalum has been used to find the shortest path between the source and target point in a given labyrinth. However, the classical algorithm can´t deal with the shortest path problem in directed graphs. In this paper, a modified model is proposed to solve the shortest path problem in directed graphs using the true slime mold Physarum polycephalum. Some numerical examples are illustrated the efficiency of the proposed method.
Keywords
cellular biophysics; directed graphs; microorganisms; amoeboid organism-based directed graph; labyrinth; shortest path finding; slime mold Physarum polycephalum; source point; target point; Adaptive systems; Conductivity; Educational institutions; Electron tubes; Mathematical model; Organisms; Directed graph; Physarum polycephalum; Shortest path finding;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (CCDC), 2012 24th Chinese
Conference_Location
Taiyuan
Print_ISBN
978-1-4577-2073-4
Type
conf
DOI
10.1109/CCDC.2012.6243094
Filename
6243094
Link To Document