An Artificial Bee Colony Algorithm for the Resource Contrained Project Scheduling Problem
We present an approach to solve the Resource Constrained Project Scheduling Problem. This problem consists on executing a group of activities limited by constraints. Precedence relationships force to some activities to begin after the finalization of others. In addition, processing every activity requires a predefined amount of limited resources. The target of this problem is to minimize the duration of whole project. In this paper, an approach based on Artificial Bee Colony algorithm for the Resource Constrained Project Scheduling Problem is presented. That algorithm is one of the most recent algorithms in the domain of the collective intelligence who was motivated by the intelligent behavior observed in the domestic bees to take the process of forage. Thus, ABC combines methods of local search and global search, trying to balance the process of the exploration and exploitation of the space of search.
KeywordsArtificial bee colony Metaheuristic Project scheduling
Broderick Crawford is supported by Grant CONICYT/ FONDECYT/REGULAR/1140897, Ricardo Soto is supported by Grant CONICYT/FONDECYT/INICIACION/11130459, Franklin Johnson is supported by Postgraduate Grant PUCV 2014.
- 5.Herbots, J., Herroelen, W., Leus, R.: Experimental investigation of the applicability of ant colony optimization algorithms for project scheduling. DTEW Res. Rep. 0459, 1–25 (2004)Google Scholar
- 6.Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report, Technical report-tr06, Erciyes university, Engineering Faculty, Computer Engineering Department (2005)Google Scholar