Continuous extremal optimization for Lennard-Jones Clusters
arXiv:cond-mat/0411428 · doi:10.1103/PhysRevE.72.016702
Abstract
In this paper, we explore a general-purpose heuristic algorithm for finding high-quality solutions to continuous optimization problems. The method, called continuous extremal optimization(CEO), can be considered as an extension of extremal optimization(EO) and is consisted of two components, one is with responsibility for global searching and the other is with responsibility for local searching. With only one adjustable parameter, the CEO's performance proves competitive with more elaborate stochastic optimization procedures. We demonstrate it on a well known continuous optimization problem: the Lennerd-Jones clusters optimization problem.
5 pages and 3 figures
References in corpus (9)
- Molecular geometry optimization with a genetic algorithm
- Optimization with Extremal Dynamics
- Nature's Way of Optimizing
- Unbiased Global Optimization of Lennard-Jones Clusters for N <= 201 by Conformational Space Annealing Method
- Extremal Optimization for Graph Partitioning
- Extremal Optimization at the Phase Transition of the 3-Coloring Problem
- Extremal Optimization of Graph Partitioning at the Percolation Threshold
- Improved extremal optimization for the Ising spin glass
- Jamming Model for the Extremal Optimization Heuristic