An alternative approach for particle swarm optimisation using serendipity Online publication date: Tue, 17-Apr-2018
by Fábio Augusto Procópio Paiva; Josè Alfredo Ferreira Costa; Cláudio Rodrigues Muniz Silva
International Journal of Bio-Inspired Computation (IJBIC), Vol. 11, No. 2, 2018
Abstract: In the study of metaheuristic techniques, it is very common to deal with a problem known as premature convergence. This problem is widely studied in swarm intelligence algorithms such as particle swarm optimisation (PSO). Most approaches to the problem consider the generation and/or positioning of individuals in the search space randomly. This paper approaches the issue using the concept of serendipity and its adaptation in this new context. Several strategies that implement serendipity were evaluated in order to develop a PSO variant based on this concept. The results were compared with the traditional PSO considering the quality of the solutions and the ability to find global optimum. The new algorithm was also compared with a PSO variant of the literature. The experiments showed promising results related to the criteria mentioned above, but there is the need for additional adjustments to decrease the runtime.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook