Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/25011
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Industrial and Systems Engineering | - |
dc.creator | Zhang, X | - |
dc.creator | Wang, Q | - |
dc.creator | Adamatzky, A | - |
dc.creator | Chan, FTS | - |
dc.creator | Mahadevan, S | - |
dc.creator | Deng, Y | - |
dc.date.accessioned | 2015-05-26T08:16:57Z | - |
dc.date.available | 2015-05-26T08:16:57Z | - |
dc.identifier.issn | 2356-6140 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/25011 | - |
dc.language.iso | en | en_US |
dc.publisher | Hindawi Publishing Corporation | en_US |
dc.rights | Copyright © 2014 Xiaoge Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. | en_US |
dc.rights | The following article: Zhang, X., Wang, Q., Adamatzky, A., Chan, F. T., Mahadevan, S., & Deng, Y. (2014). An improved physarum polycephalum algorithm for the shortest path problem. The Scientific World Journal, 2014, is available at https//doi.org/10.1155/2014/487069 | en_US |
dc.title | An improved Physarum polycephalum algorithm for the shortest path problem | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 2014 | en_US |
dc.identifier.doi | 10.1155/2014/487069 | en_US |
dcterms.abstract | Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P. polycephalum is originally famous as a computing biological substrate due to its alleged ability to approximate shortest path from its inoculation site to a source of nutrients. Several algorithms were designed based on properties of the slime mould. Many of the Physarum-inspired algorithms suffer from a low converge speed. To accelerate the search of a solution and reduce a number of iterations we combined an original model of Physarum-inspired path solver with a new a parameter, called energy. We undertook a series of computational experiments on approximating shortest paths in networks with different topologies, and number of nodes varying from 15 to 2000. We found that the improved Physarum algorithm matches well with existing Physarum-inspired approaches yet outperforms them in number of iterations executed and a total running time. We also compare our algorithm with other existing algorithms, including the ant colony optimization algorithm and Dijkstra algorithm. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | The scientific world journal, 2014, v. 2014, 487069 | - |
dcterms.isPartOf | The scientific world journal | - |
dcterms.issued | 2014 | - |
dc.identifier.isi | WOS:000333917600001 | - |
dc.identifier.scopus | 2-s2.0-84899435228 | - |
dc.identifier.pmid | 24982960 | - |
dc.identifier.eissn | 1537-744X | en_US |
dc.identifier.rosgroupid | r69004 | - |
dc.description.ros | 2013-2014 > Academic research: refereed > Publication in refereed journal | en_US |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhang_Improved_physarum_polycephalum.pdf | 2.92 MB | Adobe PDF | View/Open |
Page views
128
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
115
Citations as of Apr 14, 2024
SCOPUSTM
Citations
22
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
6
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.