IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v9y2018i1p20-38.html
   My bibliography  Save this article

On the Convergence and Diversity of Pareto Fronts Using Swarm Intelligence Metaheuristics for Constrained Search Space

Author

Listed:
  • Kamel Zeltni

    (Constantine 2 - Abdelhamid Mehri University, Constantine, Algeria)

  • Souham Meshoul

    (Constantine 2 - Abdelhamid Mehri University, Constantine, Algeria)

  • Heyam H. Al-Baity

    (King Saud University, Riyadh, Saudi Arabia)

Abstract

This article reviews existing constraint-handling techniques then presents a new design for Swarm Intelligence Metaheuristics (SIM) to deal with constrained multi-objective optimization problems (CMOPs). This new design aims to investigate potential effects of leader concepts that characterize the dynamic of SIM in the hope to help the population to reach Pareto optimal solutions in a constrained search space. The new leader-based constraint handling mechanism is incorporated in Constrained Multi-Objective Cuckoo Search (C-MOCS) and Constrained Multi-Objective Particle Swarm Optimization (C-MOPSO) as specific instances of a more general class of SIMs. The experimental results are carried out using a set of six well-known test functions and two performance metrics. The convergence and diversity of C-MOCS and C-MOPSO are analysed and compared to the well-known Multi-Objective Evolutionary Algorithm (MOEA) NSGA-II and discussed based on the obtained results.

Suggested Citation

  • Kamel Zeltni & Souham Meshoul & Heyam H. Al-Baity, 2018. "On the Convergence and Diversity of Pareto Fronts Using Swarm Intelligence Metaheuristics for Constrained Search Space," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 9(1), pages 20-38, January.
    • Handle: RePEc:igg:jsir00:v:9:y:2018:i:1:p:20-38
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2018010102
    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:jsir00:v:9:y:2018:i:1:p:20-38. 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.