IDEAS home Printed from
   My bibliography  Save this paper

Global optimization of some difficult benchmark functions by cuckoo-hostco-evolution meta-heuristics



This paper proposes a novel method of global optimization based on cuckoo-host co-evaluation. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 96 benchmark functions (of which the results of 30 relatively harder problems have been reported). The proposed method is comparable to the Differential Evolution method of global optimization.

Suggested Citation

  • Mishra, SK, 2012. "Global optimization of some difficult benchmark functions by cuckoo-hostco-evolution meta-heuristics," MPRA Paper 40615, University Library of Munich, Germany.
  • Handle: RePEc:pra:mprapa:40615

    Download full text from publisher

    File URL:
    File Function: original version
    Download Restriction: no

    File URL:
    File Function: revised version
    Download Restriction: no

    References listed on IDEAS

    1. Viswanathan, G.M & Bartumeus, F & V. Buldyrev, Sergey & Catalan, J & Fulco, U.L & Havlin, Shlomo & da Luz, M.G.E & Lyra, M.L & Raposo, E.P & Eugene Stanley, H, 2002. "Lévy flight random searches in biological phenomena," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 314(1), pages 208-213.
    2. Mishra, Sudhanshu, 2006. "Some new test functions for global optimization and performance of repulsive particle swarm method," MPRA Paper 2718, University Library of Munich, Germany.
    3. Mishra, SK, 2006. "Performance of Differential Evolution and Particle Swarm Methods on Some Relatively Harder Multi-modal Benchmark Functions," MPRA Paper 449, University Library of Munich, Germany.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Cuckoo-Host Co-Evolution; Cuckoo Search; Global Optimization; Differential Evolution; Levy flight; Benchmark functions;

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C87 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Econometric Software
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:pra:mprapa:40615. 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: (Joachim Winter) or (Rebekah McClure). General contact details of provider: .

    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.