Modified cuckoo search algorithm for unconstrained optimization problems

  • Authors:
  • Milan Tuba;Milos Subotic;Nadezda Stanarevic

  • Affiliations:
  • Faculty of Computer Science, University Megatrend Belgrade, Serbia;Faculty of Computer Science, University Megatrend Belgrade, Serbia;Faculty of Computer Science, University Megatrend Belgrade, Serbia

  • Venue:
  • ECC'11 Proceedings of the 5th European conference on European computing conference
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents modified cuckoo search (CS) algorithm for unconstrained optimization problems. Young and Deb's cuckoo search algorithm was successfully used on some optimization problems and there is also a corresponding code. We implemented a modified version of this algorithm where the step size is determined from the sorted rather than only permuted fitness matrix. Our modified algorithm was tested on eight standard benchmark functions. Comparison of the pure cuckoo search algorithm and our modified one is presented and it shows improved results by our modification.