IDEAS home Printed from https://ideas.repec.org/a/igg/jcini0/v19y2025i1p1-24.html
   My bibliography  Save this article

Integrated Learning Particle Swarm Optimization Algorithm Based on Clustering

Author

Listed:
  • Kexin Lin

    (Shenzhen Institute of Information Technology, China)

  • Tie Cai

    (Shenzhen Institute of Information Technology, China)

  • Hui Wang

    (Shenzhen Institute of Information Technology, China)

  • Wei Li

    (Jiangxi University of Science and Technology, China)

  • Cao Wei

    (Shenzhen Institute of Information Technology, China)

Abstract

The particle swarm optimization algorithm is widely recognized for its few adjustable parameters and high flexibility. However, it still has some limitations. This paper proposes an integrated learning particle swarm optimization algorithm based on clustering, referred to as ILPSO-C. Using the adaptive learning rate clustering strategy, the population is dynamically divided into multiple subpopulations, each of which adjusts its learning rate based on the problem characteristics. The algorithm's adaptability is further improved through an adaptive parameter tuning strategy. A multimodal learning interaction mechanism introduces information sharing between subpopulations. Finally, a stalled activation strategy encourages the algorithm to escape local optima. The performance of ILPSO-C is evaluated on the CEC 2017 and CEC 2022 benchmark suites and the economic dispatch problem of power systems. Experimental results show that ILPSO-C outperforms other algorithms.

Suggested Citation

  • Kexin Lin & Tie Cai & Hui Wang & Wei Li & Cao Wei, 2025. "Integrated Learning Particle Swarm Optimization Algorithm Based on Clustering," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 19(1), pages 1-24, January.
  • Handle: RePEc:igg:jcini0:v:19:y:2025:i:1:p:1-24
    as

    Download full text from publisher

    File URL: https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCINI.381298
    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:jcini0:v:19:y:2025:i:1:p:1-24. 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.