A Slime Mold Solver for Linear Programming Problems
Physarum polycephalum (true slime mold) has recently emerged as a fascinating example of biological computation through morphogenesis. Despite being a single cell organism, experiments have observed that through its growth process, the Physarum is able to solve various minimum cost flow problems. This paper analyzes a mathematical model of the Physarum growth dynamics. We show how to encode general linear programming (LP) problems as instances of the Physarum. We prove that under the growth dynamics, the Physarum is guaranteed to converge to the optimal solution of the LP. We further derive an efficient discrete algorithm based on the Physarum model, and experimentally verify its performance on assignment problems.
KeywordsAssignment Problem Linear Program Problem Short Path Problem Slime Mold Physarum Polycephalum
Unable to display preview. Download preview PDF.
- 1.Chazelle, B.: Natural Algorithms. In: Proceedings of the 20th Symposium of Discrete Algorithms (2009)Google Scholar
- 2.Sumpter, D.: Collective Animal Behavior. Princeton University Press (2010)Google Scholar
- 3.Camazine, S., Deneubourg, J., Franks, N., Sneyd, J., Theraulaz, G., Bonabeau, E.: Self-Organization in Biological Systems. Princeton University Press (2003)Google Scholar
- 8.Ito, K., Johansson, A., Nakagaki, T., Tero, A.: Convergence properties for the Physarum solver. arXiv:1101.5249v1 (2011)Google Scholar
- 9.Bonifaci, V., Mehlhorn, K., Varma, G.: Physarum can compute shortest paths. In: Proceedings of the 23th Symposium of Discrete Algorithms (2012)Google Scholar
- 10.Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific (1997)Google Scholar
- 11.Christiano, P., Kelner, J., Madry, A., Spielman, D., Teng, S.: Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (2011)Google Scholar