A method is presented that can find the global minimum of very complex condensed matter systems. It is based on the simple principle of exploring the configurational space as fast as possible and of avoiding revisiting known parts of this space. Even though it is not a genetic algorithm, it is not based on thermodynamics. The efficiency of the method depends strongly on the type of moves that are used to hop into new local minima. Moves that find low-barrier escape-paths out of the present minimum generally lead into low energy minima.

1.
G.
Johannesson
,
T.
Bligaard
,
A.
Ruban
,
H.
Skriver
,
K.
Jacobsen
, and
J.
Nörskov
,
Phys. Rev. Lett.
88
,
255506
(
2002
).
2.
S.
Chan
and
K.
Dill
,
Proteins: Struct., Function, Genetics
30
,
2
(
1998
);
http://laplace.compbio.ucsf.edu/danny/Protein/fig-gallery.html
3.
D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning (Addison–Wesley, New York, 1989).
4.
P. Salomon, P. Sibani and R. Frost, Facts, Conjectures and Improvements for Simulated Annealing (SIAM, Philaelphia, 2002).
5.
B.
Berg
and
T.
Neuhaus
,
Phys. Lett. B
267
,
249
(
1991
).
6.
H.
Grubmueller
,
Phys. Rev. E
52
,
2893
(
1995
);
A.
Voter
,
J. Chem. Phys.
106
,
4665
(
1997
).
7.
A.
Laio
and
M.
Parrinello
,
Proc. Natl. Acad. Sci. U.S.A.
99
,
12562
(
2002
).
8.
F. Jensen, Computational Chemistry (Wiley, New York, 1999).
9.
D.
Wales
,
M.
Miller
, and
J.
Doye
,
J. Chem. Phys.
110
,
6896
(
1999
);
J.
Doye
,
M.
Miller
, and
D.
Wales
,
J. Chem. Phys.
111
,
8417
(
1999
).
10.
L.
Munro
and
D.
Wales
,
Phys. Rev. B
59
,
3969
(
1999
).
11.
R.
Malek
and
N.
Mousseau
,
Phys. Rev. E
62
,
7723
(
2000
).
12.
S.
Yoo
and
X.
Zeng
,
J. Chem. Phys.
119
,
1442
(
2003
).
13.
G. T.
Barkema
and
N.
Mousseau
,
Phys. Rev. Lett.
77
,
4358
(
1996
);
N.
Mousseau
and
G. T.
Barkema
,
Phys. Rev. E
57
,
2419
(
1998
).
14.
M.
Sorensen
and
A.
Voter
,
J. Chem. Phys.
112
,
9599
(
2000
).
15.
F.
Montalenti
and
A.
Voter
,
J. Chem. Phys.
116
,
4819
(
2002
).
16.
The basin hopping program that can be obtained from http://www-wales.ch.cam.ac.uk/software.html contains special angular random moves that are more efficient than ordinary three-dimensional random moves.
17.
M. Z.
Bazant
and
E.
Kaxiras
,
Phys. Rev. Lett.
77
,
4370
(
1996
);
M. Z.
Bazant
,
E.
Kaxiras
, and
J. F.
Justo
,
Phys. Rev. B
56
,
8542
(
1997
);
J. F.
Justo
,
M. Z.
Bazant
,
E.
Kaxiras
,
V. V.
Bulatov
, and
S.
Yip
,
Phys. Rev. B
58
,
2539
(
1998
);
S.
Goedecker
,
Comput. Phys. Commun.
148
,
124
(
2002
).
18.
D.
Williams
,
Acta Crystallogr., Sect. A: Found. Crystallogr.
52
,
326
(
1996
);
R.
Wawak
,
J.
Pillardy
,
A.
Liwo
,
K.
Gibson
, and
H.
Scheraga
,
J. Phys. Chem. A
102
,
2904
(
1998
).
19.
D.
Wales
and
J.
Doye
,
J. Phys. Chem. A
101
,
5111
(
1997
);
J.
Doye
and
D.
Wales
,
Phys. Rev. Lett.
80
,
1357
(
1998
);
J.
Doye
,
D.
Wales
, and
M.
Miller
,
J. Chem. Phys.
109
,
8143
(
1998
).
20.
Several runs were terminated after two weeks of running time due to no visible progress toward finding the global minimum. The basin hopping method was done with molecular dynamics moves, which are more efficient than random moves. In the simulated annealing runs the temperature was decreased exponentially.
21.
F.
Wooten
,
K.
Winer
, and
D.
Weaire
,
Phys. Rev. Lett.
54
,
1392
(
1985
);
S.
Goedecker
,
T.
Deutsch
, and
L.
Billard
,
Phys. Rev. Lett.
88
,
235501
(
2002
).
22.
F.
Valiquette
and
N.
Mousseau
,
Phys. Rev. B
68
,
125209
(
2003
).
This content is only available via PDF.
You do not currently have access to this content.