Volume 11, Number 3 and A (Transaction A: Civil Engineering, September 2013)                   IJCE 2013, 11(3 and A): 189-198 | Back to browse issues page


XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Sebt M H, Fazel Zarandi M H, Alipouri Y. Genetic Algorithms to Solve Resource-Constrained Project Scheduling Problems with Variable Activity Durations. IJCE. 2013; 11 (3) :189-198
URL: http://ijce.iust.ac.ir/article-1-908-en.html

Abstract:   (11566 Views)
Resource-Constrained Project Scheduling Problem (RCPSP) is one of the most popular problems in the scheduling phase of any project. This paper tackles the RCPSP in which activity durations can vary within their certain ranges such as RCPSP with variable activity durations. In this paper, we have attempted to find the most suitable hybridization of GA variants to solve the mentioned problem. For this reason, three GA variants (Standard GA, Stud GA and Jumping Gene) were utilized for first GA, and two GA variants (Standard GA, Stud GA) for the second one, and their hybridizations were compared. For this purpose, several comparisons of the following hybridizations of GAs are performed: Standard-Standard GA, Standard-Stud GA, Stud-Standard GA, Stud-Stud GA, Jumping Gene-Standard GA, and Jumping Gene-Stud GA. Simulation results show that implementing Stud-Stud GA hybridization to solve this problem will cause convergence on the minimum project makespan, faster and more accurate than other hybrids. The robustness of the Stud GA in solving the well-known benchmarking RCPSP problems with deterministic activity durations is also analyzed.
Full-Text [PDF 234 kb]   (1504 Downloads)    
Type of Study: Research Paper | Subject: Construction Management

Add your comments about this article : Your username or email:
Write the security code in the box

© 2015 All Rights Reserved | International Journal of Civil Engineering

Designed & Developed by : Yektaweb