An ABC-Genetic method to solve resource constrained project scheduling problem

Reza Akbari, Vahid Zeighami, Ismail Akbari

Abstract


The aim of this work is to study the effect of hybridization on the performance of the Artificial Bee Colony (ABC) as arecently introduced metaheuristic for solving Resource Constrained Project Scheduling Problem (RCPSP). For thispurpose the ABC is combined with the Genetic Algorithm (GA). At the initial time, the algorithm generates a set ofschedules randomly. The initial solution is evaluated against constraints and the infeasible solutions are resolved tofeasible ones. Then, the initial schedules will be improved iteratively using hybrid method until termination condition ismet. The proposed method works by interleaving the ABC and GA search processes. The GA method updates schedulesby considering the best solution found by the ABC approach. Next the ABC approach picks the solutions found by GAsearch. A new approach is used by the algorithm to maintain the priorities of the activities in feasible ranges. Theperformance of the proposed algorithm is compared against a set of state-of-art algorithms. The simulation results showedthat the proposed algorithm provides an efficient way for solving RCPSP and produce competitive results compared toother algorithms investigated in this work.

Full Text: PDF DOI: 10.5430/air.v1n2p185

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Artificial Intelligence Research

ISSN 1927-6974 (Print)   ISSN 1927-6982 (Online)

Copyright © Sciedu Press 
To make sure that you can receive messages from us, please add the 'Sciedu.ca' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.