A comparative performance analysis of genetic algorithms and the Metropolis algorithm in some problems of solid-state physics

The application of genetic algorithms to the optimization problems of solid-state physics is considered. A genetic algorithm is described and compared with the Metropolis algorithm for the Ising model with the absolute value of atom spins equal to 1. Some basic questions arising when using the genetic algorithms in solid-state physics are discussed.