°ÇÃ൵½Ã°ø°£¿¬±¸¼Ò

Architecture & Urban Research Institute

pdf¿ø¹®º¸±â ¿¡·¯ ÇØ°á¹æ¹ý ¹Ù·Î°¡±â



¹®ÇåȨ > ¿¬±¸³í¹® > »ó¼¼

[¿ø¹®º¸±â½Ã ¼ÒºñµÇ´Â Æ÷ÀÎÆ® : 100 Æ÷ÀÎÆ®] ¹Ì¸®º¸±â Àοë

Çѱ¹°Ç¼³°ü¸®ÇÐȸ|³í¹®Áý 2007³â 12¿ù

³í¹®¸í Efficient Elitist Genetic Algorithm for Resource-Constrained Project Scheduling
ÀúÀÚ¸í ±èÁøÀÌ(Kim, Jin-Lee)
¹ßÇà»ç Çѱ¹°Ç¼³°ü¸®ÇÐȸ
¼ö·Ï»çÇ× Çѱ¹°Ç¼³°ü¸®ÇÐȸ ³í¹®Áý, Vol.8 No.6 (2007-12)
ÆäÀÌÁö ½ÃÀÛÆäÀÌÁö(235) ÃÑÆäÀÌÁö(11)
ISSN 1229-7534
ÁÖÁ¦ºÐ·ù ½Ã°ø(Àû»ê)
ÁÖÁ¦¾î ; 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.
¼ÒÀåó Çѱ¹°Ç¼³°ü¸®ÇÐȸ
¾ð¾î ¿µ¾î
ºÐ¼®¼­Áö
°Ç¼³°ü¸® > ÇÁ·ÎÁ§Æ®°ü¸® > °øÁ¤°ü¸®

ÀÌ ¿¬±¸´Â °Ç¼³ ¿£Áö´Ï¾î¸µ »ê¾÷ÀÇ °¡Àå ¾î·Á¿î ¹®Á¦ÁßÀÇ ÇϳªÀÎ ÀÚ¿øÁ¦¾à ÇÁ·ÎÁ§Æ®ÀÇ ½ºÄÉÁÙ¸µ ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇÑ ¿¤¸®Æ¼½ºÆ® À¯Àü ¾Ë°í¸®Áò(Elitist Genetic Algorithm ; Elitist GA) °³¹ß°ú Àû¿ë¹æ¹ý¿¡ ´ëÇÏ¿© ¿¬±¸ÇÏ¿´´Ù. °³¹ßµÈ ¾Ë·Î¸®ÁòÀÇ °¡Àå Å« Ư¡Àº elitist roulette selection operator°¡ ÀÌÈÄ ½Ãµµ(generation)¿¡¼­ °³¼±µÈ ÇØ¸¦ ¾òµµ·Ï ÃÖÀûÀÇ °³º° ÇØ¸¦ ±â¾ïÇϵµ·Ï °³¹ßµÈ °ÍÀÌ´Ù. ¶ÇÇÑ parallel schedule generation scheme°¡ ½ÇÇà °¡´ÉÇÑ ÇØ¸¦ ã±â À§ÇØ »ç¿ëµÇ¾ú´Ù.