Home | Read Online | Amazon | GoodReads | Google Books | PDF (code) | GitHub
This chapter describes Physical Algorithms.
Physical algorithms are those algorithms inspired by a physical process. The described physical algorithm generally belong to the fields of Metaheustics and Computational Intelligence, although do not fit neatly into the existing categories of the biological inspired techniques (such as Swarm, Immune, Neural, and Evolution). In this vein, they could just as easily be referred to as nature inspired algorithms.
The inspiring physical systems range from metallurgy, music, the interplay between culture and evolution, and complex dynamic systems such as avalanches. They are generally stochastic optimization algorithms with a mixtures of local (neighborhood-based) and global search techniques.
There are many other algorithms and classes of algorithm that were not described inspired by natural systems, not limited to:
[Apolloni1989] | B. Apolloni and C. Caravalho and D. De Falco, "Quantum stochastic optimization", Stochastic Processes and their Applications, 1989. |
[Das2005] | A. Das and B. K. Chakrabarti, "Quantum annealing and related optimization methods", Springer, 2005. |
[Ingber1989] | L. Ingber, "Very fast simulated re-annealing", Mathematical and Computer Modelling, 1989. |
[Ingber1996] | L. Ingber, "Adaptive simulated annealing (ASA): Lessons learned", Control and Cybernetics, 1996. |
[Wenzel1999] | W. Wenzel and K. Hamacher, "A Stochastic Tunneling Approach for Global Minimization of Complex\n\tPotential Energy Landscapes", Phys. Rev. Lett., 1999. |
Please Note: This content was automatically generated from the book content and may contain minor differences.