access icon free A New Cockroach Colony Optimization Algorithm for Global Numerical Optimization

Inspired by the behavior of cockroaches in nature, this paper presents a new optimization algorithm called Cockroach colony optimization (CCO). In the CCO algorithm, nests of cockroaches are placed at the “corner” of the search space. The current best solution to the optimization problem called food can split some of the search targets by applying the logistic multi-peak map and the margin control strategies. By using a particular search scheme, the individual cockroaches can accomplish a highly efficient global and local search in each crawling process from a nest to a search target. The paper provides a formal convergence proof for the CCO algorithm. Experiment results show that the CCO algorithm can be applied to solve global numerical optimization problems with the characteristics of quick convergence and high precision.

Inspec keywords: optimisation; biology computing; search engines

Other keywords: cockroach behavior; cockroach colony optimization algorithm; search scheme; global numerical optimization; logistic multipeak map

Subjects: Biology and medical computing; Search engines; Optimisation techniques

http://iet.metastore.ingenta.com/content/journals/10.1049/cje.2016.06.030
Loading

Related content

content/journals/10.1049/cje.2016.06.030
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading