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

An Improved Multi-Objective Particle Swarm Optimization Based on Utopia Point Guided Search

Author

Listed:
  • Swapnil Prakash Kapse

    (Department of Mechanical Engineering, Indian Institute of Technology Madras, Chennai, India)

  • Shankar Krishnapillai

    (Department of Mechanical Engineering, Indian Institute of Technology Madras, Chennai, India)

Abstract

This article demonstrates the implementation of a novel local search approach based on Utopia point guided search, thus improving the exploration ability of multi- objective Particle Swarm Optimization. This strategy searches for best particles based on the criteria of seeking solutions closer to the Utopia point, thus improving the convergence to the Pareto-optimal front. The elite non-dominated selected particles are stored in an archive and updated at every iteration based on least crowding distance criteria. The leader is chosen among the candidates in the archive using the same guided search. From the simulation results based on many benchmark tests, the new algorithm gives better convergence and diversity when compared to existing several algorithms such as NSGA-II, CMOPSO, SMPSO, PSNS, DE+MOPSO and AMALGAM. Finally, the proposed algorithm is used to solve mechanical design based multi-objective optimization problems from the literature, where it shows the same advantages.

Suggested Citation

  • Swapnil Prakash Kapse & Shankar Krishnapillai, 2018. "An Improved Multi-Objective Particle Swarm Optimization Based on Utopia Point Guided Search," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 9(4), pages 71-96, October.
  • Handle: RePEc:igg:jamc00:v:9:y:2018:i:4:p:71-96
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2018100104
    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:9:y:2018:i:4:p:71-96. 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.