Using hybrid APPM to solve Lennard-Jones cluster problems
by Xu Liu; Zhihua Cui
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 6, No. 3, 2013

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.

Online publication date: Sat, 11-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com