Hybrid Differential Evolution Particle Swarm Optimization Algorithm for Solving Resource Leveling Problem of Multi-project with Fixed Duration

Q4 Engineering
Haixin Wang, Shengsong Wei, Xin Chen, Meijin Zhu, Zuhe Wang
{"title":"Hybrid Differential Evolution Particle Swarm Optimization Algorithm for Solving Resource Leveling Problem of Multi-project with Fixed Duration","authors":"Haixin Wang, Shengsong Wei, Xin Chen, Meijin Zhu, Zuhe Wang","doi":"10.46300/9106.2022.16.99","DOIUrl":null,"url":null,"abstract":"This paper attempts to substitute Resource Leveling Problem (RLP) into multi-project environment and construct Resource Leveling Problem of Multi-project (RLPMP) model with the goal of minimizing the sum of weighted mean square deviations of multi-resource requirements. A two-stage hybrid differential evolution particle swarm optimization algorithm is used to solve the model. In the first stage, differential evolution algorithm is used to produce new individuals, and in the second stage, particle swarm optimization algorithm uses a new speed update formula. In the first stage, in order to ensure that the optimal individual will not be destroyed by crossover and mutation, and to maintain the convergence of differential evolution algorithm, we try to introduce Elitist reservation (ER) strategy into differential evolution algorithm. In the second stage, we use a kind of Particle Swarm Optimization (PSO) algorithm with dynamic inertia weight. Through the dynamic change of inertia weight, the global search and local search ability of the algorithm can be adjusted flexibly. The case verification shows that the hybrid differential evolution particle swarm optimization algorithm can effectively solve the RLPMP model, and then effectively improve the balance of multi-project resources.","PeriodicalId":13929,"journal":{"name":"International Journal of Circuits, Systems and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Circuits, Systems and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46300/9106.2022.16.99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

This paper attempts to substitute Resource Leveling Problem (RLP) into multi-project environment and construct Resource Leveling Problem of Multi-project (RLPMP) model with the goal of minimizing the sum of weighted mean square deviations of multi-resource requirements. A two-stage hybrid differential evolution particle swarm optimization algorithm is used to solve the model. In the first stage, differential evolution algorithm is used to produce new individuals, and in the second stage, particle swarm optimization algorithm uses a new speed update formula. In the first stage, in order to ensure that the optimal individual will not be destroyed by crossover and mutation, and to maintain the convergence of differential evolution algorithm, we try to introduce Elitist reservation (ER) strategy into differential evolution algorithm. In the second stage, we use a kind of Particle Swarm Optimization (PSO) algorithm with dynamic inertia weight. Through the dynamic change of inertia weight, the global search and local search ability of the algorithm can be adjusted flexibly. The case verification shows that the hybrid differential evolution particle swarm optimization algorithm can effectively solve the RLPMP model, and then effectively improve the balance of multi-project resources.
求解固定工期多项目资源均衡问题的混合差分进化粒子群优化算法
本文试图将资源均衡问题(RLP)引入到多项目环境中,以多资源需求加权均方差之和最小为目标,构建多项目资源均衡问题(RLPMP)模型。采用两阶段混合差分进化粒子群优化算法求解该模型。第一阶段采用差分进化算法产生新个体,第二阶段采用粒子群优化算法采用新的速度更新公式。在第一阶段,为了保证最优个体不被交叉和变异破坏,并保持差分进化算法的收敛性,我们尝试在差分进化算法中引入精英保留(ER)策略。在第二阶段,我们使用了一种带有动态惯性权值的粒子群优化算法。通过惯性权值的动态变化,可以灵活调整算法的全局搜索能力和局部搜索能力。实例验证表明,混合差分进化粒子群优化算法能够有效地求解RLPMP模型,进而有效地提高多项目资源的均衡性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Circuits, Systems and Signal Processing
International Journal of Circuits, Systems and Signal Processing Engineering-Electrical and Electronic Engineering
自引率
0.00%
发文量
155
×
引用
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学术官方微信