Abstract
Resource allocation project scheduling problem (RCPSP) has been one of the challenging subjects among researchers in the last decades. Though several methods have been adopted to solve this problem, however, new metahuristics are available to solve this problem for finding better solution with less computational time. In this paper two new metahuristic algorithms are applied for solving this problem known as charged system search (CSS) and colliding body optimization (CBO). The results show that both of these algorithms find reasonable solutions, however CBO could find the result in a less computational time having a better quality. Two case studies are conducted to evaluate the performance and applicability of the proposed algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
