¶óÆæÆ®¦¢Ä«Æä¦¢ºí·Î±×¦¢´õº¸±â
¾ÆÄ«µ¥¹Ì Ȩ ¸í»çƯ°­ ´ëÇבּ¸½Ç޹æ Á¶°æ½Ç¹« µ¿¿µ»ó°­ÀÇ Çѱ¹ÀÇ ÀüÅëÁ¤¿ø ÇÐȸº° ³í¹®
ÇÐȸº° ³í¹®

Çѱ¹°Ç¼³°ü¸®ÇÐȸ
Çѱ¹°ÇÃà½Ã°øÇÐȸ
Çѱ¹µµ·ÎÇÐȸ
Çѱ¹»ý¹°È¯°æÁ¶ÀýÇÐȸ
Çѱ¹»ýÅÂÇÐȸ
Çѱ¹¼öÀÚ¿øÇÐȸ
Çѱ¹½Ä¹°ÇÐȸ
Çѱ¹½Ç³»µðÀÚÀÎÇÐȸ
Çѱ¹ÀÚ¿ø½Ä¹°ÇÐȸ
Çѱ¹ÀܵðÇÐȸ
Çѱ¹Á¶°æÇÐȸ
Çѱ¹Áö¹Ý°øÇÐȸ
Çѱ¹ÇÏõȣ¼öÇÐȸ
Çѱ¹È¯°æ»ý¹°ÇÐȸ
Çѱ¹È¯°æ»ýÅÂÇÐȸ

Çѱ¹°Ç¼³°ü¸®ÇÐȸ / v.8, no.6, 2007³â, pp.235-245

( Efficient Elitist Genetic Algorithm for Resource-Constrained Project Scheduling )
; ;
 
ÃÊ ·Ï
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 challenging problems in construction engineering. Main features of the developed algorithm are that the elitist roulette selection operator is developed to preserve the best individual solution for the next generation so as to obtain the improved solution, and that parallel schedule generation scheme is used to generate a feasible solution to the problem. The experimental results on standard problem sets indicate that the proposed algorithm not only produces reasonably good solutions to the problems over the heuristic method and other GA, but also can find the optimal and/or near optimal solutions for the large-sized problems with multiple resources within a reasonable amount of time that will be applicable to the construction industry. This paper will help researchers and/or practitioners in the construction project scheduling software area with alternative means to find the optimal schedules by utilizing the advantages of the Elitist GA.
 
Ű¿öµå
Resources;scheduling;optimization;genetic algorithms;heuristics;project management;
 
Çѱ¹°Ç¼³°ü¸®ÇÐȸ³í¹®Áý / v.8, no.6, 2007³â, pp.235-245
Çѱ¹°Ç¼³°ü¸®ÇÐȸ
ISSN : 2005-6095
UCI : G100:I100-KOI(KISTI1.1003/JNL.JAKO200709905857611)
¾ð¾î : ¿µ¾î
³í¹® Á¦°ø : KISTI Çѱ¹°úÇбâ¼úÁ¤º¸¿¬±¸¿ø
¸ñ·Ïº¸±â
ȸ»ç¼Ò°³ ±¤°í¾È³» ÀÌ¿ë¾à°ü °³ÀÎÁ¤º¸Ãë±Þ¹æÄ§ Ã¥ÀÓÀÇ ÇѰè¿Í ¹ýÀû°íÁö À̸ÞÀÏÁÖ¼Ò ¹«´Ü¼öÁý °ÅºÎ °í°´¼¾ÅÍ
   

ÇÏÀ§¹è³ÊÀ̵¿