@inproceedings{becker2016quality,
abstract = {Swarm algorithms are often used for the generation of graphs. The generated graphs are mostly planar, inexpensive and fault-tolerant. In this work we evaluate the graphs produced by a swarm algorithm with respect to the properties and the quality of the found graphs and to the runtime requirements. The algorithm under consideration is essentially a simulation of the foraging of the slime mold Physarum polycephalum. Especially emphasized are the properties of the algorithm, since its deployment in many other works is limited to the existence of a graph solution, not reporting however the quality of the graph and runtime requirements of the algorithm. We compare the quality of the resulting graphs and the runtime of the algorithm to classical algorithms from graph theory. Our results show that the slime mold algorithm has some interesting features, however it is not the best means to construct graphs of large sets of nodes in terms of efficiency of the algorithm or quality of the outcome.},
title = {On the quality of graphs generated by swarm algorithms},
author = {Becker, Matthias},
booktitle = {2016 IEEE Congress on Evolutionary Computation},
doi = {10.1109/CEC.2016.7744262},
year = {2016},
papertype = {fullpaper}
}