IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5980504.html
   My bibliography  Save this article

A Multiobjective Particle Swarm Optimization Algorithm Based on Competition Mechanism and Gaussian Variation

Author

Listed:
  • Hongli Yu
  • Yuelin Gao
  • Jincheng Wang

Abstract

In order to solve the shortcomings of particle swarm optimization (PSO) in solving multiobjective optimization problems, an improved multiobjective particle swarm optimization (IMOPSO) algorithm is proposed. In this study, the competitive strategy was introduced into the construction process of Pareto external archives to speed up the search process of nondominated solutions, thereby increasing the speed of the establishment of Pareto external archives. In addition, the descending order of crowding distance method is used to limit the size of external archives and dynamically adjust particle parameters; in order to solve the problem of insufficient population diversity in the later stage of algorithm iteration, time-varying Gaussian mutation strategy is used to mutate the particles in external archives to improve diversity. The simulation experiment results show that the improved algorithm has better convergence and stability than the other compared algorithms.

Suggested Citation

  • Hongli Yu & Yuelin Gao & Jincheng Wang, 2020. "A Multiobjective Particle Swarm Optimization Algorithm Based on Competition Mechanism and Gaussian Variation," Complexity, Hindawi, vol. 2020, pages 1-23, December.
    • Handle: RePEc:hin:complx:5980504
    DOI: 10.1155/2020/5980504
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/5980504.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2020/5980504.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/5980504?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:complx:5980504. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.