Abstract
This paper compares the performance of two evolutionary computation paradigms, genetic algorithms (GAs) and particle swarm optimization (PSO), on the problem of finding ground states of Ising spin glasses. The algorithms are tested on various configurations of J = ±1 Ising spin glasses on 2D and 3D lattices with nearest neighbor interactions and periodic boundaries. For configurations on 2D lattices, the performance of GAs and PSO was studied in the absence, as well as in the presence of an external magnetic field. For configurations on 3D lattices, the performance was also studied for different values of the coupling constant J. Results indicate that PSO outperforms GAs with respect to the quality of the solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, C.A., Jones, K.F., Ryan, J.: A Two-Dimensional Genetic Algorithm for the Ising Problem. Complex Systems 5, 327–333 (1991)
Barahona, F.: On the Computational Complexity of Ising Spin Glass Models. Phys. A: Math. Gen. 15, 3241–3253 (1982)
Clerc, M.: Particle Swarm Optimization. HERMES Science Publishing Ltd, London (2006)
Eberhart, R.C., Kennedy, J., Shi, Y.: Swarm Intelligence. Morgan Kaufmann (2001)
Fischer, S.: A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model. In: Genetic and Evolutionary Computation – GECCO-2004, Part I, Lecture Notes in Computer Science, vol. 3102, pp. 1100–1112. Springer-Verlag, Seattle, WA, USA (2004)
Fischer, S., Wegener, I.: The Ising Model on the Ring: Mutation versus Recombination. In: Genetic and Evolutionary Computation – GECCO-2004, Part I, Lecture Notes in Computer Science, vol. 3102, pp. 1113–1124. Springer-Verlag, Seattle, WA, USA (2004)
Goodman, S., Hedetniemi, S.: Eulerian walks in graphs. SIAM J. Computing 2 (1973)
Hadlock, F.: Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM Journal on Computing 4(3), 221–225 (1975)
Hartmann, A.K.: Ground-State Clusters of Two-, Three- and Four-dimensional ± j Ising Spin Glasses. Physical Review E 63, 016,106 (2001)
Hartmann, A.K., Weigt, M.: Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics. Wiley (2005)
Holland, J.H.: Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor, MI (1975)
den Hollander, F., Toninelli, F.: Spin glasses: A mystery about to be solved. Eur. Math. Soc. Newsl. 56, 13–17 (2005)
Huang, K.: Statistical Mechanics, 2nd ed. John Wiley & Sons Inc. (1987)
Istrail, S.: Universality of Intractability of the Partition Functions of the Ising Model Across Non-Planar Lattices. In: Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC00), pp. 87–96. ACM Press, Portland, Oregon (2000)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, vol. 5, pp. 4104–4109. IEEE Press, Piscataway NJ, USA (1997)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer-Verlag, New York (1996)
Onsager, L.: Crystal statistics in a two-dimensional model with an order-disorder transition. Phys. Rev. 65 (1944)
Orlova, G.I., Dorfman, Y.G.: Finding the maximum cut in a graph. Engr. Cybernetics 10 (1972)
Pelikan, M., Goldberg, D.E.: Hierarchical BOA Solves Ising Spin Glasses and MAXSAT. In: E.C.P. et al (ed.) Genetic and Evolutionary Computation – GECCO-2003, LNCS, vol. 2724, pp. 1271–1282. Springer-Verlag, Chicago (2003)
Prügel-Bennett, A., Shapiro, J.L.: The Dynamics of a Genetic Algorithm for Simple Random Ising Systems. Physica D 1462, 76–114 (1997)
Simone, C.D., Diehl, M., Junger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of Ising spin glasses: New experimental results with a branch and cut algorithm. Journal of Statistical Physics 80(3), 487–496 (1995)
Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, vol. 2, pp. 1161–1167. ACM Press, Washington DC, USA (2005)
Sutton, P., Hunter, D., Jan, N.: The ground state energy of the ± J spin glass from the genetic algorithm. Journal de Physique I France 4, 1281–1285 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Băutu, A., Băutu, E. (2008). Searching Ground States of Ising Spin Glasses with Genetic Algorithms and Binary Particle Swarm Optimization. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78987-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-78987-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78986-4
Online ISBN: 978-3-540-78987-1
eBook Packages: EngineeringEngineering (R0)