The Artificial Bee Colony (ABC) algorithm is a powerful continuous optimization tool that has been proposed in the past few years. Many studies have shown the ABC superiority in terms of performance when compared to other well-known optimization algorithms. In this paper, the implementation of a Cooperative ABC (CABC) algorithm that is based on the explicit space decomposition approach is investigated. Both the ABC algorithm and its cooperative versions are applied to a well-known set of classical benchmark functions.