Details
Original language | English |
---|---|
Title of host publication | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
Pages | 285-291 |
Number of pages | 7 |
ISBN (electronic) | 978-1-4244-7835-4 |
Publication status | Published - 2011 |
Event | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 - New Orleans, LA, United States Duration: 5 Jun 2011 → 8 Jun 2011 |
Publication series
Name | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
---|
Abstract
In this work we evaluate slime mold inspired algorithms, that gained a lot of attention in renowned journals recently, for their ability to construct fault tolerant connection networks. In previous work, experiments with a real slime mold Physarum polycephalum as well as computer simulations based on a tube model of the slime mold showed, that the slime mold (and simulations thereof) is able to construct fault tolerant and efficient transport networks similar to the actual Tokyo rail system [1]. However the quality of the solutions of the real slime mold show big variations, and the tubular computer simulation does not seem to reproduce the natural slime mold very well, since the constructed networks do not show the variety of the naturally build ones, instead they show a heavy dependence of one simulation parameter. Thus in our work we present a different approach for construction of fault tolerant connection networks for the Tokyo rail system using an agent based simulation of Physarum polycephalum. Analysis of the results show that the agent based simulation reproduces the variance in the behavior of the natural slime mold much better. Analyzing the cost benefit ratio of bio-inspired network construction we however conclude that it might be worth to consider classical efficient computational algorithms for the problem of constructing minimal fault tolerant networks.
Keywords
- nature inspired algorithms, physarum polycephalum, slime mold
ASJC Scopus subject areas
- Computer Science(all)
- Computational Theory and Mathematics
- Mathematics(all)
- Theoretical Computer Science
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
2011 IEEE Congress of Evolutionary Computation, CEC 2011. 2011. p. 285-291 5949630 (2011 IEEE Congress of Evolutionary Computation, CEC 2011).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Design of fault tolerant networks with agent-based simulation of Physarum polycephalum
AU - Becker, Matthias
PY - 2011
Y1 - 2011
N2 - In this work we evaluate slime mold inspired algorithms, that gained a lot of attention in renowned journals recently, for their ability to construct fault tolerant connection networks. In previous work, experiments with a real slime mold Physarum polycephalum as well as computer simulations based on a tube model of the slime mold showed, that the slime mold (and simulations thereof) is able to construct fault tolerant and efficient transport networks similar to the actual Tokyo rail system [1]. However the quality of the solutions of the real slime mold show big variations, and the tubular computer simulation does not seem to reproduce the natural slime mold very well, since the constructed networks do not show the variety of the naturally build ones, instead they show a heavy dependence of one simulation parameter. Thus in our work we present a different approach for construction of fault tolerant connection networks for the Tokyo rail system using an agent based simulation of Physarum polycephalum. Analysis of the results show that the agent based simulation reproduces the variance in the behavior of the natural slime mold much better. Analyzing the cost benefit ratio of bio-inspired network construction we however conclude that it might be worth to consider classical efficient computational algorithms for the problem of constructing minimal fault tolerant networks.
AB - In this work we evaluate slime mold inspired algorithms, that gained a lot of attention in renowned journals recently, for their ability to construct fault tolerant connection networks. In previous work, experiments with a real slime mold Physarum polycephalum as well as computer simulations based on a tube model of the slime mold showed, that the slime mold (and simulations thereof) is able to construct fault tolerant and efficient transport networks similar to the actual Tokyo rail system [1]. However the quality of the solutions of the real slime mold show big variations, and the tubular computer simulation does not seem to reproduce the natural slime mold very well, since the constructed networks do not show the variety of the naturally build ones, instead they show a heavy dependence of one simulation parameter. Thus in our work we present a different approach for construction of fault tolerant connection networks for the Tokyo rail system using an agent based simulation of Physarum polycephalum. Analysis of the results show that the agent based simulation reproduces the variance in the behavior of the natural slime mold much better. Analyzing the cost benefit ratio of bio-inspired network construction we however conclude that it might be worth to consider classical efficient computational algorithms for the problem of constructing minimal fault tolerant networks.
KW - nature inspired algorithms
KW - physarum polycephalum
KW - slime mold
UR - http://www.scopus.com/inward/record.url?scp=80052013320&partnerID=8YFLogxK
U2 - 10.1109/CEC.2011.5949630
DO - 10.1109/CEC.2011.5949630
M3 - Conference contribution
AN - SCOPUS:80052013320
SN - 978-1-4244-7834-7
T3 - 2011 IEEE Congress of Evolutionary Computation, CEC 2011
SP - 285
EP - 291
BT - 2011 IEEE Congress of Evolutionary Computation, CEC 2011
T2 - 2011 IEEE Congress of Evolutionary Computation, CEC 2011
Y2 - 5 June 2011 through 8 June 2011
ER -