Loading...
Improved discrete cuckoo search for the resource-constrained project scheduling problem
Bibiks, Kirils Hu, Yim Fun Pillai, Prashant Smith, A.
Bibiks, Kirils
Hu, Yim Fun
Pillai, Prashant
Smith, A.
Publication Date
2018-08
End of Embargo
Supervisor
Rights
Crown Copyright © 2018 Published by Elsevier B.V. All rights reserved. Reproduced in accordance with the publisher's self-archiving policy. This manuscript version is made available under the CC-BY-NC-ND 4.0 license.
Peer-Reviewed
Yes
Open Access status
Accepted for publication
2018-04-24
Institution
Department
Awarded
Embargo end date
Additional title
Abstract
An Improved Discrete Cuckoo Search (IDCS) is proposed in this paper to solve resource-constrained project scheduling problems (RCPSPs). The original Cuckoo Search (CS) was inspired by the breeding behaviour of some cuckoo species and was designed specifically for application in continuous optimisation problems, in which the algorithm had been demonstrated to be effective. The proposed IDCS aims to improve the original CS for solving discrete scheduling problems by reinterpreting its key elements: solution representation scheme, Lévy flight and solution improvement operators. An event list solution representation scheme has been used to present projects and a novel event movement and an event recombination operator has been developed to ensure better quality of received results and improve the efficiency of the algorithm. Numerical results have demonstrated that the proposed IDCS can achieve a competitive level of performance compared to other state-of-the-art metaheuristics in solving a set of benchmark instances from a well-known PSPLIB library, especially in solving complex benchmark instances.
Version
Accepted manuscript
Citation
Bibiks K, Hu YF, Li J-P et al (2018) Improved discrete cuckoo search for the resource-constrained project scheduling problem. Applied Soft Computing. 69: 493-503.
Link to publisher’s version
Link to published version
Link to Version of Record
Type
Article