IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v266y2015icp1083-1092.html

Cuckoo search algorithm based on frog leaping local search and chaos theory

Author

Listed:
  • Liu, Xueying
  • Fu, Meiling

Abstract

Cuckoo algorithm is a novel optimization algorithm in the field of heuristic intelligence algorithms. Given the strong random leaping in solution space search, careful local searches are susceptible to falling into the local optimum. Thus, the latter phase of the optimization slows down and the accuracy diminishes. To improve the performance of the algorithm, this paper proposes an improved cuckoo search that utilizes chaos theory to enhance the variety of the initial population. Then, this study introduces inertia weight into the Lévy flight random search to improve global searching capability. Finally, it applies the local search mechanism of the frog leaping algorithm to enhance local search and further improve the search speed and convergence precision of the algorithm. Typical test functions are employed to verify the performance of the improved algorithm. Comparison results with other algorithms indicate that the improved algorithm displays strong optimizing accuracy and high speed. Furthermore, this algorithm is confirmed to be convergent.

Suggested Citation

  • Liu, Xueying & Fu, Meiling, 2015. "Cuckoo search algorithm based on frog leaping local search and chaos theory," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 1083-1092.
    • Handle: RePEc:eee:apmaco:v:266:y:2015:i:c:p:1083-1092
    DOI: 10.1016/j.amc.2015.06.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630031500822X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.06.041?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Francisco J. Solis & Roger J.-B. Wets, 1981. "Minimization by Random Search Techniques," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 19-30, February.
    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. Amiri, M. & Khanmohammadi, S. & Badamchizadeh, M.A., 2018. "Floating search space: A new idea for efficient solving the Economic and emission dispatch problem," Energy, Elsevier, vol. 158(C), pages 564-579.
    2. Miranda-Colorado, Roger, 2020. "Parameter identification of conservative Hamiltonian systems using first integrals," Applied Mathematics and Computation, Elsevier, vol. 369(C).

    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. Shelley D. Dionne & Hiroki Sayama & Francis J. Yammarino, 2019. "Diversity and Social Network Structure in Collective Decision Making: Evolutionary Perspectives with Agent-Based Simulations," Complexity, Hindawi, vol. 2019, pages 1-16, March.
    2. Ricardo Navarro & Chyon Hae Kim, 2020. "Niching Multimodal Landscapes Faster Yet Effectively: VMO and HillVallEA Benefit Together," Mathematics, MDPI, vol. 8(5), pages 1-37, April.
    3. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    4. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    5. Regis, Rommel G., 2010. "Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1187-1202, December.
    6. E. A. Tsvetkov & R. A. Krymov, 2022. "Pure Random Search with Virtual Extension of Feasible Region," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 575-595, November.
    7. Hvattum, Lars Magnus & Glover, Fred, 2009. "Finding local optima of high-dimensional functions using direct search methods," European Journal of Operational Research, Elsevier, vol. 195(1), pages 31-45, May.
    8. Rinnooy Kan, A. H. G. & Timmer, G. T., 1985. "Stochastic Global Optimization Methods Part I: Clustering Methods," Econometric Institute Archives 272329, Erasmus University Rotterdam.
    9. Dillenburger, Steven P. & Cochran, Jeffery K. & Cammarano, Vincent R., 2013. "Minimizing supply airdrop collateral damage risk," Socio-Economic Planning Sciences, Elsevier, vol. 47(1), pages 9-19.
    10. de Oliveira Nogueira, Tiago & Palacio, Gilderlânio Barbosa Alves & Braga, Fabrício Damasceno & Maia, Pedro Paulo Nunes & de Moura, Elineudo Pinho & de Andrade, Carla Freitas & Rocha, Paulo Alexandre C, 2022. "Imbalance classification in a scaled-down wind turbine using radial basis function kernel and support vector machines," Energy, Elsevier, vol. 238(PC).
    11. Taymaz, Erol, 1993. "A Calibration Algorithm for Micro-Simulation Models," Working Paper Series 374, Research Institute of Industrial Economics.
    12. Prietula, Michael J. & Watson, Harry S., 2008. "When behavior matters: Games and computation in A Behavioral Theory of the Firm," Journal of Economic Behavior & Organization, Elsevier, vol. 66(1), pages 74-94, April.
    13. Xiong, Xiaoping & Qing, Guohua, 2023. "A hybrid day-ahead electricity price forecasting framework based on time series," Energy, Elsevier, vol. 264(C).
    14. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    15. Soumya D. Mohanty & Ethan Fahnestock, 2021. "Adaptive spline fitting with particle swarm optimization," Computational Statistics, Springer, vol. 36(1), pages 155-191, March.
    16. Giulia Pedrielli & K. Selcuk Candan & Xilun Chen & Logan Mathesen & Alireza Inanalouganji & Jie Xu & Chun-Hung Chen & Loo Hay Lee, 2019. "Generalized Ordinal Learning Framework (GOLF) for Decision Making with Future Simulated Data," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(06), pages 1-35, December.
    17. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    18. Pradeep Anand Ravindranath & Stefano Forli & David S Goodsell & Arthur J Olson & Michel F Sanner, 2015. "AutoDockFR: Advances in Protein-Ligand Docking with Explicitly Specified Binding Site Flexibility," PLOS Computational Biology, Public Library of Science, vol. 11(12), pages 1-28, December.
    19. Yang, Yao Wen & Xu, Jian Feng & Soh, Chee Kiong, 2006. "An evolutionary programming algorithm for continuous global optimization," European Journal of Operational Research, Elsevier, vol. 168(2), pages 354-369, January.
    20. Tvrdik, Josef & Krivy, Ivan & Misik, Ladislav, 2007. "Adaptive population-based search: Application to estimation of nonlinear regression parameters," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 713-724, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:266:y:2015:i:c:p:1083-1092. 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.