IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v11y2020i4p114-129.html
   My bibliography  Save this article

A Novel Multi-Objective Competitive Swarm Optimization Algorithm

Author

Listed:
  • 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)

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.

Suggested Citation

  • Prabhujit Mohapatra & Kedar Nath Das & Santanu Roy & Ram Kumar & Nilanjan Dey, 2020. "A Novel Multi-Objective Competitive Swarm Optimization Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 11(4), pages 114-129, October.
    • Handle: RePEc:igg:jamc00:v:11:y:2020:i:4:p:114-129
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2020100106
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:11:y:2020:i:4:p:114-129. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.