A Slime Mold Solver for Linear Programming Problems

  • Anders Johannson
  • James Zou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7318)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chazelle, B.: Natural Algorithms. In: Proceedings of the 20th Symposium of Discrete Algorithms (2009)Google Scholar
  2. 2.
    Sumpter, D.: Collective Animal Behavior. Princeton University Press (2010)Google Scholar
  3. 3.
    Camazine, S., Deneubourg, J., Franks, N., Sneyd, J., Theraulaz, G., Bonabeau, E.: Self-Organization in Biological Systems. Princeton University Press (2003)Google Scholar
  4. 4.
    Tero, A., Takagi, S., Saigusa, T., Ito, K., Bebber, D., Fricker, M., Yumiki, K., Kobayashi, R., Nakagaki, T.: Rules for biological inspired adaptive network design. Science 327(5964), 439–442 (2010)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Nakagaki, T., Yamada, H., Toth, A.: Maze-solving by an amoeboid organism. Nature 407, 470 (2000)CrossRefGoogle Scholar
  6. 6.
    Nakagaki, T., Tero, A., Kobayashi, R.: A mathematical model for adaptive transport network in path finding by true slime mold. Journal of Theoretical Biology 244(4), 553–564 (2007)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Miyaji, T., Ohnishi, I.: Physarum can solve the shortest path problem on Riemannian surface mathematically rigorously. International Journal of Pure and Applied Mathematics 47(3), 353–369 (2008)MathSciNetMATHGoogle Scholar
  8. 8.
    Ito, K., Johansson, A., Nakagaki, T., Tero, A.: Convergence properties for the Physarum solver. arXiv:1101.5249v1 (2011)Google Scholar
  9. 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. 10.
    Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific (1997)Google Scholar
  11. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Anders Johannson
    • 1
  • James Zou
    • 2
  1. 1.Department of MathematicsUppsala UniversityUppsalaSweden
  2. 2.School of Engineering and Applied SciencesHarvard UniversityCambridgeUnited States of America

Personalised recommendations