CBO and CSS Algorithms for Resource Allocation and Time-Cost Trade-Off

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.