IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v18y2018i3d10.1007_s12351-018-0401-6.html
   My bibliography  Save this article

Probabilistic evolutionary bound constraint handling for particle swarm optimization

Author

Listed:
  • Amir H. Gandomi

    (Stevens Institute of Technology)

  • Ali R. Kashani

    (Arak University)

Abstract

Keeping the search space between the valid domains is one of the most important necessities for most of the optimization problems. Among the optimization algorithms, particle swarm optimization (PSO) is highly likely to violate boundary limitations easily because of its oscillating behavior. Therefore, PSO is led to be sensitive to bound constraint handling (BCH) method. This matter has not been taken to account very much until now. This study attempt to apply and explore the efficiency of one of the most recent BCH schemes called evolutionary boundary constraint handling (EBCH) on PSO. In addition, probabilistic evolutionary boundary constraint handling (PEBCH) is also introduced in this study as an update on EBCH approach. As a complementary step of previous efforts, in the current document, PSO with both EBCH and PEBCH are utilized to solve several benchmark functions and the results are compared to other approaches in the literature. The results reveal that, in most cases, the EBCH and PEBCH can considerably improve the performance of the PSO algorithm in comparison with other BCH methods.

Suggested Citation

  • Amir H. Gandomi & Ali R. Kashani, 2018. "Probabilistic evolutionary bound constraint handling for particle swarm optimization," Operational Research, Springer, vol. 18(3), pages 801-823, October.
    • Handle: RePEc:spr:operea:v:18:y:2018:i:3:d:10.1007_s12351-018-0401-6
    DOI: 10.1007/s12351-018-0401-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-018-0401-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-018-0401-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nikhil Padhye & Pulkit Mittal & Kalyanmoy Deb, 2015. "Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization," Computational Optimization and Applications, Springer, vol. 62(3), pages 851-890, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Sina Nayeri & Zeinab Sazvar & Jafar Heydari, 2022. "A fuzzy robust planning model in the disaster management response phase under precedence constraints," Operational Research, Springer, vol. 22(4), pages 3571-3605, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Umesh Balande & Deepti Shrimankar, 2019. "SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems," Mathematics, MDPI, vol. 7(3), pages 1-26, March.
    2. Fernanda Nakano Kazama & Aluizio Fausto Ribeiro Araujo & Paulo Barros Correia & Elaine Guerrero-Peña, 2021. "Constraint-guided evolutionary algorithm for solving the winner determination problem," Journal of Heuristics, Springer, vol. 27(6), pages 1111-1150, December.

    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:spr:operea:v:18:y:2018:i:3:d:10.1007_s12351-018-0401-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.