An artificial bee colony algorithm for the resource contrained project scheduling problem
MetadataShow full item record
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. © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Johnson F.; Vargas M.; Misra S.; Paredes F. (Springer Verlag, 2015)
Software project scheduling using the Hyper-Cube ant colony optimization algorithm [Programiranje računarskog projekta primjenom Hyper-Cube algoritma za optimizaciju kolonije mrava] (2020) Crawford B.; Soto R.; Johnson F.; Misra S.; Paredes F.; Olguín E. (Strojarski Facultet, 2015)
A new approach to solve the software project scheduling problem based on max–min ant system (2020) Crawford B.; Soto R.; Johnson F.; Monfroy E.; Paredes F. (Springer Verlag, 2014)