Title: Using hybrid APPM to solve Lennard-Jones cluster problems

Authors: Xu Liu; Zhihua Cui

Addresses: Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technology, Shanxi, 030024, China ' Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technology, Shanxi, 030024, China

Abstract: Lennard-Jones (LJ) cluster is one important problem in chemistry, materials and physics. The main difficulty is the amount of local optima. Recently, an Artificial Plant Photosynthesis and Phototropism Mechanism (APPM) is proposed which simulates the plant growing process. In this paper, APPM is applied to solve LJ cluster problem. To avoid the premature convergence phenomenon, a new strategy, Limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) is employed to increase the local search efficiency. Furthermore, seed technology is also introduced to slow the problem dimension. Simulation results show this new hybrid algorithm is effective for LJ2-LJ17 when compared with other three stochastic algorithms.

Keywords: artificial plant photosynthesis; phototropism mechanism; APPM; L-BFGS; Lennard-Jones clusters; plant growth simulation; local search; seed technology.

DOI: 10.1504/IJWMC.2013.055761

International Journal of Wireless and Mobile Computing, 2013 Vol.6 No.3, pp.236 - 242

Received: 07 Jul 2012
Accepted: 02 Aug 2012
Published online: 11 Oct 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article