ABSTRACT
In this chapter, a brief description of the basic Artificial Bee Colony (ABC) is provided and modified versions of the basic algorithm for various kinds of problems including constrained, multi-objective and combinatorial problems are described in terms of representation, local search operator, selection operator, objective function definition. In the second part of the chapter, an application of the ABC algorithm to a real world problem, software requirements selection, is addressed by considering the representation, objective function definition, local search and selection operators. We demonstrate the profit and satisfied cost produced by the software requirements determined by the ABC algorithm.
