Open AccessA New Cockroach Colony Optimization Algorithm for Global Numerical Optimization
Author(s) -
Cheng Le,
Han Lixin,
Zeng Xiaoqin,
Bian Yuetang
Publication year - 2017
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2016.06.030
Subject(s) - optimization algorithm , computer science , global optimization , mathematical optimization , algorithm , optimization problem , mathematics
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.