Robustness of "cut and splice" genetic algorithms in the structural optimization of atomic clusters

Details Robustness of "cut and splice" genetic algorithms in the structural optimization of atomic clusters Robustness of "cut and splice" genetic algorithms in the structural optimization of atomic clusters

2009-04-09

arxiv.org/abs/0904.1516v1

Physics

Condensed Matter

Materials Science

5 pages including 3 figures; related publications can be found at http://www.fhi-berlin.mpg.de/th/th.html

Scientific paper

We return to the geometry optimization problem of Lennard-Jones clusters to analyze the performance dependence of "cut and splice" genetic algorithms (GAs) on the employed population size. We generally find that admixing twinning mutation moves leads to an improved robustness of the algorithm efficiency with respect to this a priori unknown technical parameter. The resulting very stable performance of the corresponding mutation+mating GA implementation over a wide range of population sizes is an important feature when addressing unknown systems with computationally involved first-principles based GA sampling.

Affiliated with

Also associated with

No associations

Rating

Robustness of "cut and splice" genetic algorithms in the structural optimization of atomic clusters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robustness of "cut and splice" genetic algorithms in the structural optimization of atomic clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of "cut and splice" genetic algorithms in the structural optimization of atomic clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408675