一种新的基于析取图的多目标资源约束项目调度问题元启发式方法

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Min Hu , Min Zhou , Zikai Zhang , Liping Zhang , Yingli Li
{"title":"一种新的基于析取图的多目标资源约束项目调度问题元启发式方法","authors":"Min Hu ,&nbsp;Min Zhou ,&nbsp;Zikai Zhang ,&nbsp;Liping Zhang ,&nbsp;Yingli Li","doi":"10.1016/j.swevo.2025.101939","DOIUrl":null,"url":null,"abstract":"<div><div>In the implementation of projects, human resources play a crucial role. The effective assignment of multi-skilled staff among project scheduling can enhance the enterprise competitiveness. Hence, this work addresses the resource-constrained project scheduling problem with multi-skilled staff (MS-RCPSP) to minimize project completion time and total salary cost. A position-based mixed-integer linear programming model, a disjunctive graph model and a novel disjunctive-graph-based objective-guided nearest neighborhood search (DO-NNS) algorithm are proposed. The algorithm includes a resource-oriented encoding, a critical path method-based decoding and a nearest neighborhood search mechanism. By analyzing the disjunctive graph model, this work mines six relational attributes and three properties. Further, this algorithm uses these properties to design three objective-guided neighborhood search operators to enhance its performance. Moreover, the enhanced population update strategy is developed to enhance the quality of Pareto solutions. Finally, the experimental results demonstrate that the improvements are effective and the DO-NNS is superior to five latest multi-objective algorithms in terms of achieving higher-quality Pareto solutions.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"95 ","pages":"Article 101939"},"PeriodicalIF":8.2000,"publicationDate":"2025-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel disjunctive-graph-based meta-heuristic approach for multi-objective resource-constrained project scheduling problem with multi-skilled staff\",\"authors\":\"Min Hu ,&nbsp;Min Zhou ,&nbsp;Zikai Zhang ,&nbsp;Liping Zhang ,&nbsp;Yingli Li\",\"doi\":\"10.1016/j.swevo.2025.101939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In the implementation of projects, human resources play a crucial role. The effective assignment of multi-skilled staff among project scheduling can enhance the enterprise competitiveness. Hence, this work addresses the resource-constrained project scheduling problem with multi-skilled staff (MS-RCPSP) to minimize project completion time and total salary cost. A position-based mixed-integer linear programming model, a disjunctive graph model and a novel disjunctive-graph-based objective-guided nearest neighborhood search (DO-NNS) algorithm are proposed. The algorithm includes a resource-oriented encoding, a critical path method-based decoding and a nearest neighborhood search mechanism. By analyzing the disjunctive graph model, this work mines six relational attributes and three properties. Further, this algorithm uses these properties to design three objective-guided neighborhood search operators to enhance its performance. Moreover, the enhanced population update strategy is developed to enhance the quality of Pareto solutions. Finally, the experimental results demonstrate that the improvements are effective and the DO-NNS is superior to five latest multi-objective algorithms in terms of achieving higher-quality Pareto solutions.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"95 \",\"pages\":\"Article 101939\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650225000975\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225000975","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在项目的实施中,人力资源发挥着至关重要的作用。多技能人员在项目调度中的有效分配可以提高企业的竞争力。因此,本研究解决了多技能员工(MS-RCPSP)资源受限的项目调度问题,以最大限度地减少项目完成时间和总工资成本。提出了一种基于位置的混合整数线性规划模型、析取图模型和一种基于析取图的目标引导最近邻搜索算法。该算法包括面向资源的编码、基于关键路径方法的解码和最近邻搜索机制。通过对析取图模型的分析,挖掘了6个关系属性和3个性质。进一步,该算法利用这些特性设计了三个目标引导的邻域搜索算子,以提高算法的性能。此外,为了提高Pareto解的质量,提出了改进的种群更新策略。最后,实验结果表明,改进是有效的,在获得更高质量的Pareto解方面,DO-NNS优于五种最新的多目标算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A novel disjunctive-graph-based meta-heuristic approach for multi-objective resource-constrained project scheduling problem with multi-skilled staff

A novel disjunctive-graph-based meta-heuristic approach for multi-objective resource-constrained project scheduling problem with multi-skilled staff
In the implementation of projects, human resources play a crucial role. The effective assignment of multi-skilled staff among project scheduling can enhance the enterprise competitiveness. Hence, this work addresses the resource-constrained project scheduling problem with multi-skilled staff (MS-RCPSP) to minimize project completion time and total salary cost. A position-based mixed-integer linear programming model, a disjunctive graph model and a novel disjunctive-graph-based objective-guided nearest neighborhood search (DO-NNS) algorithm are proposed. The algorithm includes a resource-oriented encoding, a critical path method-based decoding and a nearest neighborhood search mechanism. By analyzing the disjunctive graph model, this work mines six relational attributes and three properties. Further, this algorithm uses these properties to design three objective-guided neighborhood search operators to enhance its performance. Moreover, the enhanced population update strategy is developed to enhance the quality of Pareto solutions. Finally, the experimental results demonstrate that the improvements are effective and the DO-NNS is superior to five latest multi-objective algorithms in terms of achieving higher-quality Pareto solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信