IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v9y2018i4d10.1007_s13198-017-0664-y.html
   My bibliography  Save this article

New chaotic flower pollination algorithm for unconstrained non-linear optimization functions

Author

Listed:
  • Arvinder Kaur

    (USICT, GGSIPU)

  • Saibal K. Pal

    (SAG, DRDO)

  • Amrit Pal Singh

    () (USICT, GGSIPU)

Abstract

Abstract Flower pollination algorithm (FPA) is susceptible to local optimum and substandard precision of calculations. Chaotic operator (CO), which is used in local algorithms to optimize the best individuals in the population, can successfully enhance the properties of the flower pollination algorithm. A new chaotic flower pollination algorithm (CFPA) has been proposed in this work. Further FPA and its four proposed variants by using different chaotic maps are tested on nine mathematical benchmark functions of high dimensions. Proposed variants of CFPA are CFPA1, CFPA2, CFPA3 and CFPA4. The result of the experiment indicates that the proposed chaotic flower pollination variant CFPA2 could increase the precision of minimization of function value and CPU time to run an algorithm.

Suggested Citation

  • Arvinder Kaur & Saibal K. Pal & Amrit Pal Singh, 2018. "New chaotic flower pollination algorithm for unconstrained non-linear optimization functions," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(4), pages 853-865, August.
  • Handle: RePEc:spr:ijsaem:v:9:y:2018:i:4:d:10.1007_s13198-017-0664-y
    DOI: 10.1007/s13198-017-0664-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-017-0664-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    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. repec:eee:apmaco:v:252:y:2015:i:c:p:155-165 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)

    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:ijsaem:v:9:y:2018:i:4:d:10.1007_s13198-017-0664-y. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.