By Topic

Opposition-Based Cuckoo Search Algorithm for Optimization Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pengjun Zhao ; Dept. of Math. & Comput. Sci., Shangluo Univ., Shangluo, China ; Huirong Li

In the paper a novel cuckoo search (CS) algorithm based on the idea of opposition (OCS) algorithm is proposed and attempts to increase the exploration efficiency of the solution space in order to solve optimization problems. The modifications focus on the solution construction phase of the CS algorithm, which organically merges the opposition-based learning into CS algorithm and the OCS algorithm fully uses beneficial information of the best solutions. during the course of evolvement, OCS algorithm has more powerful exploitation capabilities. Simulation and comparisons based on four standard benchmark functions demonstrate the effectiveness, efficiency and robustness of the proposed OCS algorithm.

Published in:

Computational Intelligence and Design (ISCID), 2012 Fifth International Symposium on  (Volume:1 )

Date of Conference:

28-29 Oct. 2012