Show simple item record

dc.contributor.authorBibiks, Kirils*
dc.contributor.authorLi, Jian-Ping*
dc.contributor.authorHu, Yim Fun*
dc.date.accessioned2016-10-20T11:07:09Z
dc.date.available2016-10-20T11:07:09Z
dc.date.issued2015-07
dc.identifier.citationBibiks 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.en_US
dc.identifier.urihttp://hdl.handle.net/10454/9991
dc.descriptionYesen_US
dc.description.abstractIn 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.en_US
dc.description.sponsorshipInnovate UKen_US
dc.language.isoenen_US
dc.relation.isreferencedbyhttps://sites.google.com/site/ijcsis/vol-13-no-7-jul-2015en_US
dc.rightsCopyright © 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.en_US
dc.subjectFlower pollination algorithm; Discrete flower pollination algorithm; Combinatorial optimization; Resource constrained project scheduling problem; Evolutionary computingen_US
dc.titleDiscrete flower pollination algorithm for resource constrained project scheduling problemen_US
dc.status.refereedYesen_US
dc.typeArticleen_US
dc.type.versionpublished version paperen_US
dc.description.publicnotesAwarded 'Best paper of the Month'en_US
refterms.dateFOA2018-07-27T01:56:49Z


Item file(s)

Thumbnail
Name:
Hu_et_al_IJCSIS.pdf
Size:
1.012Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record