Particle swarm optimisation with adaptive neighbourhood search for solving multi-objective optimisation problems
by Layak Ali; Samrat L. Sabat
International Journal of Swarm Intelligence (IJSI), Vol. 2, No. 1, 2016

Abstract: This paper proposes a new variant of PSO algorithm with adaptive neighbourhood search of Pareto solutions to solve multi-objective optimisation problems. This algorithm essentially consists of identifying the particles responsible for worst solution and accelerating these particles towards the best solution in an adaptive manner. This concept is hybridised with the updation strategy of non-dominated solution using crowding distance. Performance of the proposed algorithm is demonstrated by solving standard multi-objective benchmark problems including CEC 2009. In particular we compare our method with two recent algorithms by considering the inverted generational distance, spacing, convergence and diversity as the performance metrics. The proposed algorithm is also compared with recent state of art methods in terms of inverted generational distance. The results demonstrate that the proposed algorithm is quite competitive in terms of the mentioned performance indicators as compared to other algorithms.

Online publication date: Thu, 30-Jun-2016

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 Swarm Intelligence (IJSI):
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