New Effective Differential Evolution Algorithm for the Project Scheduling Problem

Huu Dang Quoc, Loc Nguyen The, Cuong Nguyen Doan, Toan Phan Thanh
{"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}
引用次数: 6

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.
项目调度问题的一种新的有效差分进化算法
资源约束项目调度问题(RCPSP)是一个经典的组合优化问题,具有许多实际应用。本文考虑了多技能资源约束项目调度问题的一个扩展,即多技能资源约束项目调度问题。在过去的几年里,人们提出了各种方法来解决这个问题,如遗传算法和蚁群优化。然而,减少过早收敛的可能性是研究人员面临的挑战。本文提出了一种新的DEM算法来解决MS-RCPSP问题。除了使用微分进化元启发式算法外,我们还开发了重新分配函数来提高每次迭代结束时的解质量,使算法快速收敛到全局极值。此外,该算法还避免了陷入局部极值。通过实验来评估所提出算法的性能,并将DEM与之前的算法(如GreedyDO、HAntCO和GA)进行比较。实验结果表明,该算法能有效地提高搜索效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信