Loading...
Discrete flower pollination algorithm for resource constrained project scheduling problem
Bibiks, Kirils Hu, Yim Fun
Bibiks, Kirils
Hu, Yim Fun
Publication Date
2015-07
End of Embargo
Supervisor
Rights
Copyright © IJCSIS. This is an open access journal distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Peer-Reviewed
Yes
Open Access status
openAccess
Accepted for publication
Institution
Department
Awarded
Embargo end date
Additional title
Abstract
In this paper, a new population-based and nature-inspired metaheuristic algorithm, Discrete Flower Pollination Algorithm (DFPA), is presented to solve the Resource Constrained Project Scheduling Problem (RCPSP). The DFPA is a modification of existing Flower Pollination Algorithm adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts, such as flower, global pollination, Lévy flight, local pollination. The proposed DFPA is then tested on sets of benchmark instances and its performance is compared against other existing metaheuristic algorithms. The numerical results have shown that the proposed algorithm is efficient and outperforms several other popular metaheuristic algorithms, both in terms of quality of the results and execution time. Being discrete, the proposed algorithm can be used to solve any other combinatorial optimization problems.
Version
Published version
Citation
Bibiks K, Li J-P and Hu F (2015) Discrete flower pollination algorithm for resource constrained project scheduling problem. International Journal of Computer Science and Information Security. 13(7): 8-19.
Link to publisher’s version
Link to published version
Link to Version of Record
Type
Article
Qualification name
Notes
Awarded 'Best paper of the Month'