IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v58y2014i3p781-806.html
   My bibliography  Save this article

Advanced particle swarm assisted genetic algorithm for constrained optimization problems

Author

Listed:
  • Manoj Dhadwal
  • Sung Jung
  • Chang Kim

Abstract

A novel hybrid evolutionary algorithm is developed based on the particle swarm optimization (PSO) and genetic algorithms (GAs). The PSO phase involves the enhancement of worst solutions by using the global-local best inertia weight and acceleration coefficients to increase the efficiency. In the genetic algorithm phase, a new rank-based multi-parent crossover is used by modifying the crossover and mutation operators which favors both the local and global exploration simultaneously. In addition, the Euclidean distance-based niching is implemented in the replacement phase of the GA to maintain the population diversity. To avoid the local optimum solutions, the stagnation check is performed and the solution is randomized when needed. The constraints are handled using an effective feasible population based approach. The parameters are self-adaptive requiring no tuning based on the type of problems. Numerical simulations are performed first to evaluate the current algorithm for a set of 24 benchmark constrained nonlinear optimization problems. The results demonstrate reasonable correlation and high quality optimum solutions with significantly less function evaluations against other state-of-the-art heuristic-based optimization algorithms. The algorithm is also applied to various nonlinear engineering optimization problems and shown to be excellent in searching for the global optimal solutions. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Manoj Dhadwal & Sung Jung & Chang Kim, 2014. "Advanced particle swarm assisted genetic algorithm for constrained optimization problems," Computational Optimization and Applications, Springer, vol. 58(3), pages 781-806, July.
    • Handle: RePEc:spr:coopap:v:58:y:2014:i:3:p:781-806
    DOI: 10.1007/s10589-014-9637-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-014-9637-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-014-9637-0?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. Kalyanmoy Deb & Soumil Srivastava, 2012. "A genetic algorithm based augmented Lagrangian method for constrained optimization," Computational Optimization and Applications, Springer, vol. 53(3), pages 869-902, 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. Arnaud Flori & Hamouche Oulhadj & Patrick Siarry, 2022. "QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization," Computational Optimization and Applications, Springer, vol. 82(2), pages 525-559, June.
    2. Gao, Shujun & de Silva, Clarence W., 2018. "Estimation distribution algorithms on constrained optimization problems," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 323-345.

    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. Ana Maria A. C. Rocha & M. Fernanda P. Costa & Edite M. G. P. Fernandes, 2017. "On a smoothed penalty-based algorithm for global optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 561-585, November.
    2. Ana Rocha & M. Costa & Edite Fernandes, 2014. "A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues," Journal of Global Optimization, Springer, vol. 60(2), pages 239-263, October.
    3. Umesh Balande & Deepti Shrimankar, 2020. "An oracle penalty and modified augmented Lagrangian methods with firefly algorithm for constrained optimization problems," Operational Research, Springer, vol. 20(2), pages 985-1010, June.
    4. Asghar Mahdavi & Mohammad Shiri, 2015. "An augmented Lagrangian ant colony based method for constrained optimization," Computational Optimization and Applications, Springer, vol. 60(1), pages 263-276, January.

    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:coopap:v:58:y:2014:i:3:p:781-806. 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.