Title: Investigating the application of opposition concept to colonial competitive algorithm

Authors: Hamid Reza Lashgarian Azad; Nader Shetab Boushehri; Naser Mollaverdi

Addresses: Department of Industrial and Systems Engineering, Isfahan University of Technology, Esteghlal Square, Isfahan 84156-83111, Iran. ' Department of Industrial and Systems Engineering, Isfahan University of Technology, Esteghlal Square, Isfahan 84156-83111, Iran. ' Department of Industrial and Systems Engineering, Isfahan University of Technology, Esteghlal Square, Isfahan 84156-83111, Iran

Abstract: Evolutionary algorithms (EAs) are well-known optimisation approaches to deal with non-linear and complex problems. However, these population-based algorithms are computationally expensive due to the slow nature of the evolutionary process. This paper presents a novel algorithm to accelerate colonial competitive algorithm (CCA). The proposed opposition-based CCA (OCCA) employs opposition-based learning (OBL) for population initialisation and also for generation jumping. In this work, opposite countries and colonies have been utilised to improve the convergence rate of CCA. A comprehensive set of 15 complex benchmark functions including a wide range of dimensions is employed for experimental verification. The influences of dimensionality and population size are also investigated. Experimental results confirm that the OCCA outperforms the original CCA in terms of convergence speed and robust.

Keywords: opposition-based learning; OBL; colonial competitive algorithm; CCA; opposite countries; opposite colonies; population initialisation; generation jumping.

DOI: 10.1504/IJBIC.2012.049897

International Journal of Bio-Inspired Computation, 2012 Vol.4 No.5, pp.319 - 329

Received: 02 Jan 2012
Accepted: 14 Jul 2012
Published online: 22 Sep 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article