Abstract—Resource allocation problem (RAP) is an optimum distributing period of limited existing resources. In this problem, there can be two possible cases: the resource is allocated or not. If so, the problem is in 0-1 integer problem class of which decision variables are binary values, and binary optimization algorithms are used to find optimum solutions for these problems. In the literature, various meta-heuristic optimization methods have been proposed for solving continuous or discrete RAP. In this paper, Artificial Bee Colony (ABC) algorithm simulated foraging behavior of real honey bees is studied to optimize RAP. The algorithm is firstly developed to solve numeric optimization problems and cannot be applied to binary problems directly. It requires a modification. In this study, the ABC algorithm has become applicable to solve the RAP and is called Binary Artificial Bee Colony (BABC) algorithm. The BABC algorithm is compared with the binary particle swarm optimization algorithm (BPSO) which is applied to the problem previously. The experimental results showed that the BABC algorithm was superior and can be alternative optimization method for solving RAP.
Index Terms—Artificial bee colony algorithm, binary optimization, meta-heuristic algorithm, resource allocation problem.
Z. Yilmaz is with the Department of Computer Engineering, Selcuk University, Konya, Turkey (e-mail: zuleyhayilmaz@selcuk.edu.tr).
F. Basciftci is with the Department of Computer Engineering, Selcuk University, Konya, Turkey (e-mail: basciftci@selcuk.edu.tr).
[PDF]
Cite: Zuleyha Yilmaz and Fatih Basciftci, "Binary Artificial Bee Colony Algorithm to Solve Single Objective Resource Allocation Problem," International Journal of Future Computer and Communication vol. 7, no. 1, pp. 21-25, 2018.
