Compact Artificial Bee Colony

Another version of Artificial Bee Colony (ABC) optimization algorithm, which is called the Compact Artificial Bee Colony (cABC) optimization, for numerical optimization problems, is proposed in this paper. Its aim is to address to the computational requirements of the hardware devices with limited resources such as memory size or low price. A probabilistic representation random of the collection behavior of social bee colony is inspired to employ for this proposed algorithm, in which the replaced population with the probability vector updated based on single competition. These lead to the entire algorithm functioning applying a modest memory usage. The simulations compare both algorithms in terms of solution quality, speed and saving memory. The results show that cABC can solve the optimization despite a modest memory usage as good performance as original ABC (oABC) displays with its complex population-based algorithm. It is used the same as what is needed for storing space with six solutions.