PSO-CGO: A Particle Swarm Algorithm for Cluster Geometry Optimization

Nuno Lourenço and Francisco Baptista Pereira
Additional contact information
Nuno Lourenço: Centro de Informática e Sistemas da Universidade de Coimbra (CISUC), Portugal
Francisco Baptista Pereira: Centro de Informática e Sistemas da Universidade de Coimbra (CISUC) and Instituto Superior de Engenharia de Coimbra, Portugal

International Journal of Natural Computing Research (IJNCR), 2011, vol. 2, issue 1, 1-20

Abstract: In this paper the authors present PSO-CGO, a novel particle swarm algorithm for cluster geometry optimization. The proposed approach combines a steady-state strategy to update solutions with a structural distance measure that helps to maintain population diversity. Also, it adopts a novel rule to update particles, which applies velocity only to a subset of the variables and is therefore able to promote limited modifications in the structure of atomic clusters. Results are promising, as PSO-CGO is able to discover all putative global optima for short-ranged Morse clusters between 30 and 50 atoms. A comprehensive analysis is presented and reveals that the proposed components are essential to enhance the search effectiveness of the PSO.

Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jncr.2011010101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jncr00:v:2:y:2011:i:1:p:1-20

Access Statistics for this article

International Journal of Natural Computing Research (IJNCR) is currently edited by Xuewen Xia

More articles in International Journal of Natural Computing Research (IJNCR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().