RI UFLA (Universidade Federal de Lavras) >
Revistas UFLA >
Infocomp >

Please use this identifier to cite or link to this item: http://repositorio.ufla.br/jspui/handle/1/10128

Title: A new multi-swarm particle swarm optimization and its application to Lennard-Jones problem
???metadata.dc.creator???: Deep, Kusum
Arya, Madhuri
Barak, Shashi
Keywords: Lennard-Jones potential
Parallel particle swarm optimization
Parallel computing
Potencial de Lennard-Jones
Otimização por enxame de partículas paralelas
Computação paralela
Publisher: Editora da UFLA
???metadata.dc.date???: 1-Sep-2010
Citation: DEEP, K.; ARYA, M.; BARAK, S. A new multi-swarm particle swarm optimization and its application to Lennard-Jones problem. INFOCOMP: Journal of Computer Science, Lavras, v. 9, n. 3, p. 52-60, Sept. 2010.
Abstract: Particle swarm optimization (PSO) algorithm is a modern heuristic technique for global optimization. Due to its ease of implementation, excellent effectiveness, and few parameters to adjust it has gained a lot of attention in the recent years. However, with the increasing size and computational complexity of real life optimization problems it takes long solution times and the solution quality also degrades, so there is a constant need to improve its effectiveness and robustness to find better solution in the shortest possible computational time. Parallel computing is a possible way to fulfill this requirement. In this paper we propose a multi-swarm approach to parallelize PSO algorithm (MSPSO). The performance of the proposed algorithm is evaluated using several well-known numerical test problems taken from literature. Then, it is applied to the challenging problem of finding the minimum energy configuration of a cluster of identical atoms interacting through the Lennard-Jones potential. Finding the global minimum of this function is very difficult because of the presence of a large number of local minima, which grows exponentially with molecule size. Computational results for clusters containing 8 and 9 atoms are obtained. The parallel algorithm shows significant speed-up without compromising the accuracy, when compared to the sequential PSO.
Other Identifiers: http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/312
???metadata.dc.language???: eng
Appears in Collections:Infocomp

Files in This Item:

There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

View Statistics


DSpace Software Copyright © 2002-2010  Duraspace - Feedback