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

Entropy-Driven Global Best Selection in Particle Swarm Optimization for Many-Objective Software Package Restructuring

Author

Listed:
  • Amarjeet Prajapati
  • Anshu Parashar
  • Sunita
  • Alok Mishra
  • Zeljko Stevic

Abstract

Many real-world optimization problems usually require a large number of conflicting objectives to be optimized simultaneously to obtain solution. It has been observed that these kinds of many-objective optimization problems (MaOPs) often pose several performance challenges to the traditional multi-objective optimization algorithms. To address the performance issue caused by the different types of MaOPs, recently, a variety of many-objective particle swarm optimization (MaOPSO) has been proposed. However, external archive maintenance and selection of leaders for designing the MaOPSO to real-world MaOPs are still challenging issues. This work presents a MaOPSO based on entropy-driven global best selection strategy (called EMPSO) to solve the many-objective software package restructuring (MaOSPR) problem. EMPSO makes use of the entropy and quality indicator for the selection of global best particle. To evaluate the performance of the proposed approach, we applied it over the five MaOSPR problems. We compared it with eight variants of MaOPSO, which are based on eight different global best selection strategies. The results indicate that the proposed EMPSO is competitive with respect to the existing global best selection strategies based on variants of MaOPSO approaches.

Suggested Citation

  • Amarjeet Prajapati & Anshu Parashar & Sunita & Alok Mishra & Zeljko Stevic, 2021. "Entropy-Driven Global Best Selection in Particle Swarm Optimization for Many-Objective Software Package Restructuring," Complexity, Hindawi, vol. 2021, pages 1-11, December.
    • Handle: RePEc:hin:complx:3974635
    DOI: 10.1155/2021/3974635
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/3974635.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/complexity/2021/3974635.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/3974635?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:3974635. 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.