IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v256y2015icp666-701.html
   My bibliography  Save this article

An ideal tri-population approach for unconstrained optimization and applications

Author

Listed:
  • Das, Kedar Nath
  • Parouha, Raghav Prasad

Abstract

The hybridization of Differential Evolution (DE) and Particle Swarm Optimization (PSO) have been well preferred over their individual effort in solving optimization problems. The way of applying DE and PSO in the hybridization process is a big deal to achieve promising solutions. Recently, they have been used simultaneously (i.e. in parallel) on different sub-populations of the same population, instead of applying them alternatively in series over the generation. An attempt is made in this paper to hybrid DE and PSO in parallel, under a ‘tri-population’ environment. Initially, the whole population (in increasing order of fitness) is divided into three groups – inferior group, mid group and superior group. Based on their inherent ability, DE is employed in the inferior and superior groups whereas PSO is used in the mid-group. This proposed method is named as DPD as it uses DE–PSO–DE on the sub-populations of the same population. Two more strategies namely Elitism (to retain the best obtained values so far) and Non Redundant Search (to improve the solution quality) have been incorporated in DPD cycle. The paper is designed with three major aims: (i) investigation of suitable DE-mutation strategies to support DPD, (ii) performance comparison of DPD over state-of-the-art algorithms through a set of benchmark functions and (iii) application of DPD to real life problems. Numerical, statistical and graphical analysis in this paper finally concludes the robustness of the proposed DPD.

Suggested Citation

  • Das, Kedar Nath & Parouha, Raghav Prasad, 2015. "An ideal tri-population approach for unconstrained optimization and applications," Applied Mathematics and Computation, Elsevier, vol. 256(C), pages 666-701.
  • Handle: RePEc:eee:apmaco:v:256:y:2015:i:c:p:666-701
    DOI: 10.1016/j.amc.2015.01.076
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315001083
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.01.076?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. Abbas El Dor & Maurice Clerc & Patrick Siarry, 2012. "A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization," Computational Optimization and Applications, Springer, vol. 53(1), pages 271-295, September.
    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. Raghav Prasad Parouha & Pooja Verma, 2022. "An innovative hybrid algorithm for bound-unconstrained optimization problems and applications," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1273-1336, June.

    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. Kedar Nath Das & Raghav Prasad Parouha, 2016. "Optimization with a novel hybrid algorithm and applications," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 443-473, September.
    2. Loreta Saunoriene & Marius Saunoris & Minvydas Ragulskis, 2023. "Image Hiding in Stochastic Geometric Moiré Gratings," Mathematics, MDPI, vol. 11(8), pages 1-20, April.

    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:eee:apmaco:v:256:y:2015:i:c:p:666-701. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.