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

A Hybrid Particle Swarm Optimization-Cuckoo Search Algorithm and Its Engineering Applications

Author

Listed:
  • Jinjin Ding
  • Qunjin Wang
  • Qian Zhang
  • Qiubo Ye
  • Yuan Ma

Abstract

This paper deals with the hybrid particle swarm optimization-Cuckoo Search (PSO-CS) algorithm which is capable of solving complicated nonlinear optimization problems. It combines the iterative scheme of the particle swarm optimization (PSO) algorithm and the searching strategy of the Cuckoo Search (CS) algorithm. Details of the PSO-CS algorithm are introduced; furthermore its effectiveness is validated by several mathematical test functions. It is shown that Lévy flight significantly influences the algorithm’s convergence process. In the second part of this paper, the proposed PSO-CS algorithm is applied to two different engineering problems. The first application is nonlinear parameter identification for the motor drive servo system. As a result, a precise nonlinear Hammerstein model is obtained. The second one is reactive power optimization for power systems, where the total loss of the researched IEEE 14-bus system is minimized using PSO-CS approach. Simulation and experimental results demonstrate that the hybrid optimal algorithm is capable of handling nonlinear optimization problems with multiconstraints and local optimal with better performance than PSO and CS algorithms.

Suggested Citation

  • Jinjin Ding & Qunjin Wang & Qian Zhang & Qiubo Ye & Yuan Ma, 2019. "A Hybrid Particle Swarm Optimization-Cuckoo Search Algorithm and Its Engineering Applications," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-12, March.
  • Handle: RePEc:hin:jnlmpe:5213759
    DOI: 10.1155/2019/5213759
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/5213759.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/5213759.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/5213759?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ibrahim Al-Shourbaji & Na Helian & Yi Sun & Samah Alshathri & Mohamed Abd Elaziz, 2022. "Boosting Ant Colony Optimization with Reptile Search Algorithm for Churn Prediction," Mathematics, MDPI, vol. 10(7), pages 1-21, March.

    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:jnlmpe:5213759. 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.