Huu Dang Quoc, Loc Nguyen The, Cuong Nguyen Doan, Toan Phan Thanh
{"title":"项目调度问题的一种新的有效差分进化算法","authors":"Huu Dang Quoc, Loc Nguyen The, Cuong Nguyen Doan, Toan Phan Thanh","doi":"10.1109/ICCCI49374.2020.9145982","DOIUrl":null,"url":null,"abstract":"The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical combinational optimization problem that has many practical applications. In this paper, we consider an extension of the RCPSP which called Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP). In the past few years, various approaches have been proposed to solve this problem such as Genetic Algorithm and Ant Colony Optimization. However, reducing the likelihood of premature convergence is the challenge facing researchers. In this paper, we present a novel algorithm called DEM in order to solve the MS-RCPSP problem. Besides using the differential evolution metaheuristic, we also develop the Reassignment function to improve the solution quality at the end of each iteration, so that proposed algorithm converges rapidly to global extremum. Moreover, proposed algorithm also avoids getting trapped in a local extremum. The experiments were conducted to evaluate the performance of the proposed algorithm, as well as to compare the DEM with previous algorithms such as GreedyDO, HAntCO, and GA. Experimental results show that the proposed algorithm can effectively enhance searching efficiently.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"New Effective Differential Evolution Algorithm for the Project Scheduling Problem\",\"authors\":\"Huu Dang Quoc, Loc Nguyen The, Cuong Nguyen Doan, Toan Phan Thanh\",\"doi\":\"10.1109/ICCCI49374.2020.9145982\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical combinational optimization problem that has many practical applications. In this paper, we consider an extension of the RCPSP which called Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP). In the past few years, various approaches have been proposed to solve this problem such as Genetic Algorithm and Ant Colony Optimization. However, reducing the likelihood of premature convergence is the challenge facing researchers. In this paper, we present a novel algorithm called DEM in order to solve the MS-RCPSP problem. Besides using the differential evolution metaheuristic, we also develop the Reassignment function to improve the solution quality at the end of each iteration, so that proposed algorithm converges rapidly to global extremum. Moreover, proposed algorithm also avoids getting trapped in a local extremum. The experiments were conducted to evaluate the performance of the proposed algorithm, as well as to compare the DEM with previous algorithms such as GreedyDO, HAntCO, and GA. Experimental results show that the proposed algorithm can effectively enhance searching efficiently.\",\"PeriodicalId\":153290,\"journal\":{\"name\":\"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)\",\"volume\":\"285 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCI49374.2020.9145982\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCI49374.2020.9145982","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New Effective Differential Evolution Algorithm for the Project Scheduling Problem
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical combinational optimization problem that has many practical applications. In this paper, we consider an extension of the RCPSP which called Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP). In the past few years, various approaches have been proposed to solve this problem such as Genetic Algorithm and Ant Colony Optimization. However, reducing the likelihood of premature convergence is the challenge facing researchers. In this paper, we present a novel algorithm called DEM in order to solve the MS-RCPSP problem. Besides using the differential evolution metaheuristic, we also develop the Reassignment function to improve the solution quality at the end of each iteration, so that proposed algorithm converges rapidly to global extremum. Moreover, proposed algorithm also avoids getting trapped in a local extremum. The experiments were conducted to evaluate the performance of the proposed algorithm, as well as to compare the DEM with previous algorithms such as GreedyDO, HAntCO, and GA. Experimental results show that the proposed algorithm can effectively enhance searching efficiently.