Inherited competitive swarm optimizer for large-scale optimization problems

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a new Inherited Competitive Swarm Optimizer (ICSO) is proposed for solving large-scale global optimization (LSGO) problems. The algorithm is basically motivated by both the human learning principles and the mechanism of competitive swarm optimizer (CSO). In human learning principle, characters pass on from parents to the offspring due to the ‘process of inheritance’. This concept of inheritance is integrated with CSO for faster convergence where the particles in the swarm undergo through a tri-competitive mechanism based on their fitness differences. The particles are thus divided into three groups namely winner, superior loser, and inferior loser group. In each instances, the particles in the loser group are guided by the winner particles in a cascade manner. The performance of ICSO has been tested over CEC2008 benchmark problems. The statistical analysis of the empirical results confirms the superiority of ICSO over many state-of-the-art algorithms including the basic CSO.

Cite

CITATION STYLE

APA

Mohapatra, P., Das, K. N., & Roy, S. (2019). Inherited competitive swarm optimizer for large-scale optimization problems. In Advances in Intelligent Systems and Computing (Vol. 741, pp. 85–95). Springer Verlag. https://doi.org/10.1007/978-981-13-0761-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free