³í¹®¸í |
Efficient Elitist Genetic Algorithm for Resource-Constrained Project Scheduling |
¼ö·Ï»çÇ× |
Çѱ¹°Ç¼³°ü¸®ÇÐȸ ³í¹®Áý, Vol.8 No.6 (2007-12) |
ÆäÀÌÁö |
½ÃÀÛÆäÀÌÁö(235) ÃÑÆäÀÌÁö(11) |
ÁÖÁ¦¾î |
; Resources ; scheduling ; optimization ; genetic algorithms ; heuristics ; project management |
¿ä¾à1 |
This research study presents the development and application of an Elitist Genetic Algorithm (Elitist GA)for solving the resource-constrained project scheduling problem, which is one of the most challengingproblems in construction engineering. Main features of the developed algorithm are that the elitist rouletteselection operator is developed to preserve the best individual solution for the next generation so as toobtain the improved solution, and that parallel schedule generation scheme is used to generate a feasiblesolution to the problem. The experimental results on standard problem sets indicate that the proposedalgorithm not only produces reasonably good solutions to the problems over the heuristic method and otherGA, but also can find the optimal and/or near optimal solutions for the large-sized problems with multipleresources within a reasonable amount of time that will be applicable to the construction industry. Thispaper will help researchers and/or practitioners in the construction project scheduling software area withalternative means to find the optimal schedules by utilizing the advantages of the Elitist GA. |