A Novel Multi-Objective Competitive Swarm Optimization Algorithm
Prabhujit Mohapatra,
Kedar Nath Das,
Santanu Roy,
Ram Kumar and
Nilanjan Dey
Additional contact information
Prabhujit Mohapatra: VIT University, Vellore, Tamilnadu, India
Kedar Nath Das: NIT Silchar, Silchar, India
Santanu Roy: NIT Silchar, Silchar, India
Ram Kumar: Katihar Engineering College, Katihar, India
Nilanjan Dey: Techno India College of Technology, West Bengal, India
International Journal of Applied Metaheuristic Computing (IJAMC), 2020, vol. 11, issue 4, 114-129
Abstract:
In this article, a new algorithm, namely the multi-objective competitive swarm optimizer (MOCSO), is introduced to handle multi-objective problems. The algorithm has been principally motivated from the competitive swarm optimizer (CSO) and the NSGA-II algorithm. In MOCSO, a pair wise competitive scenario is presented to achieve the dominance relationship between two particles in the population. In each pair wise competition, the particle that dominates the other particle is considered the winner and the other is consigned as the loser. The loser particles learn from the respective winner particles in each individual competition. The inspired CSO algorithm does not use any memory to remember the global best or personal best particles, hence, MOCSO does not need any external archive to store elite particles. The experimental results and statistical tests confirm the superiority of MOCSO over several state-of-the-art multi-objective algorithms in solving benchmark problems.
Date: 2020
References: Add references at CitEc
Citations:
Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAMC.2020100106 (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:jamc00:v:11:y:2020:i:4:p:114-129
Access Statistics for this article
International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin
More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().