RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Num. Meth. Prog.: Year: Volume: Issue: Page: Find

 Num. Meth. Prog., 2007, Volume 8, Issue 1, Pages 77–87 (Mi vmp472)

Âû÷èñëèòåëüíûå ìåòîäû è ïðèëîæåíèÿ

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

T. V. Panchenko, Yu. Yu. Tarasevich

Astrakhan State University

Abstract: 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.

Keywords: genetic algorithms, Metropolis algorithm, Ising model, solid state physics, optimization.

Full text: PDF file (311 kB)
UDC: 519.68:[5/6]; 538

Citation: T. V. Panchenko, Yu. Yu. Tarasevich, “A comparative performance analysis of genetic algorithms and the Metropolis algorithm in some problems of solid-state physics”, Num. Meth. Prog., 8:1 (2007), 77–87

Citation in format AMSBIB
\Bibitem{PanTar07} \by T.~V.~Panchenko, Yu.~Yu.~Tarasevich \paper A comparative performance analysis of genetic algorithms and the Metropolis algorithm in some problems of solid-state physics \jour Num. Meth. Prog. \yr 2007 \vol 8 \issue 1 \pages 77--87 \mathnet{http://mi.mathnet.ru/vmp472}