The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks
Abstract
Using insights from biological processes could help to design new optimization techniques for long-standing computational problems. This paper exploits a cellular computing model in the slime mold physarum polycephalum to solve the Steiner tree problem which is an important NP-hard problem in various applications, especially in network design. Inspired by the path-finding and network formation capability of physarum, we develop a new optimization algorithm, named as the physarum optimization, with low complexity and high parallelism. To validate and evaluate our proposed models and algorithm, we further apply the physarum optimization to the minimal exposure problem which is a fundamental problem corresponding to the worst-case coverage in wireless sensor networks. Complexity analysis and simulation results show that our proposed algorithm could achieve good performance with low complexity. Moreover, the core mechanism of our physarum optimization also may provide a useful starting point to develop some practical distributed algorithms for network design.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maze—solving by an amoeboid organism
Nakagaki, T., Yamada, H., & Tóth, Á. (2000) · Nature · doi:10.1038/35035159 · Cited by 1,022
Cited by
Industrial Internet: A Survey on the Enabling Technologies, Applications, and Challenges
Li, J.-Q., Yu, F. R., Deng, G., Luo, C., Ming, Z., & Yan, Q. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2691349 · Cited by 472
A Hybrid Path Planning Method in Unmanned Air/Ground Vehicle (UAV/UGV) Cooperative Systems
Li, J., Deng, G., Luo, C., Lin, Q., Yan, Q., & Ming, Z. (2016) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2016.2623666 · Cited by 306
Metadata
- Authors
- Liu, L., Song, Y., Zhang, H., Ma, H., & Vasilakos, A. V.
- Venue
- IEEE Transactions on Computers
- Published
- 2015-03
- Volume
- 64
- Issue
- 3
- Pages
- 818-831
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2015244507
- Cited by
- 236
- References
- 1
- FWCI
- 21.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks. https://app.cochat.ai/papers/10.1109/tc.2013.229
- The paper
- Liu, L., Song, Y., Zhang, H., Ma, H., & Vasilakos, A. V. (2015). Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2013.229
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.