AdaL-PSO 一种针对多技能资源受限项目调度问题的新自适应算法

Phan Thanh Toan, Do Van Tuan
{"title":"AdaL-PSO 一种针对多技能资源受限项目调度问题的新自适应算法","authors":"Phan Thanh Toan, Do Van Tuan","doi":"10.15625/2525-2518/17919","DOIUrl":null,"url":null,"abstract":"MS-RCPSP is a combinatorial optimization problem that has many practical applications, this problem has been proven to belong to the NP-hard class, the approach to solving this problem is to use algorithms to find approximate solution. This paper proposed a New Adaptive Local Particle Swarm Optimization algorithm for the MS-RCPSP problem. The solution for the class of NP-Hard problems is to find approximate solutions using metaheuristic algorithms. However, most metaheuristic-based algorithms have a weakness that can be fallen into local extreme after a number of evolution generations. In this paper, we adopted a new adaptive nonlinear weight update strategy based on fitness value and new neighborhood topology for Particle Swarm Optimization algorithm, thereby helping to prevent PSO from falling into local extremes. The new algorithm is called AdaL-PSO. A numerical analysis is carried out using iMOPSE benchmark dataset and is compared with some other early algorithms. Results presented suggest the prospect of our proposed algorithm.","PeriodicalId":23553,"journal":{"name":"Vietnam Journal of Science and Technology","volume":"22 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AdaL-PSO A New Adaptive Algorithm for the Multi-Skilled Resource-Constrained Project Scheduling Problem\",\"authors\":\"Phan Thanh Toan, Do Van Tuan\",\"doi\":\"10.15625/2525-2518/17919\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"MS-RCPSP is a combinatorial optimization problem that has many practical applications, this problem has been proven to belong to the NP-hard class, the approach to solving this problem is to use algorithms to find approximate solution. This paper proposed a New Adaptive Local Particle Swarm Optimization algorithm for the MS-RCPSP problem. The solution for the class of NP-Hard problems is to find approximate solutions using metaheuristic algorithms. However, most metaheuristic-based algorithms have a weakness that can be fallen into local extreme after a number of evolution generations. In this paper, we adopted a new adaptive nonlinear weight update strategy based on fitness value and new neighborhood topology for Particle Swarm Optimization algorithm, thereby helping to prevent PSO from falling into local extremes. The new algorithm is called AdaL-PSO. A numerical analysis is carried out using iMOPSE benchmark dataset and is compared with some other early algorithms. Results presented suggest the prospect of our proposed algorithm.\",\"PeriodicalId\":23553,\"journal\":{\"name\":\"Vietnam Journal of Science and Technology\",\"volume\":\"22 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Vietnam Journal of Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15625/2525-2518/17919\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vietnam Journal of Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15625/2525-2518/17919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

MS-RCPSP 是一个有很多实际应用的组合优化问题,该问题已被证明属于 NP-困难类,解决该问题的方法是使用算法寻找近似解。本文针对 MS-RCPSP 问题提出了一种新的自适应局部粒子群优化算法。NP-Hard 类问题的解决方案是使用元启发式算法找到近似解。然而,大多数基于元启发式的算法都有一个弱点,那就是在进化若干代后会陷入局部极端。在本文中,我们为粒子群优化算法采用了一种基于适应度值和新邻域拓扑的新自适应非线性权重更新策略,从而有助于防止 PSO 陷入局部极端。新算法被称为 AdaL-PSO。利用 iMOPSE 基准数据集进行了数值分析,并与其他一些早期算法进行了比较。结果表明,我们提出的算法前景广阔。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
AdaL-PSO A New Adaptive Algorithm for the Multi-Skilled Resource-Constrained Project Scheduling Problem
MS-RCPSP is a combinatorial optimization problem that has many practical applications, this problem has been proven to belong to the NP-hard class, the approach to solving this problem is to use algorithms to find approximate solution. This paper proposed a New Adaptive Local Particle Swarm Optimization algorithm for the MS-RCPSP problem. The solution for the class of NP-Hard problems is to find approximate solutions using metaheuristic algorithms. However, most metaheuristic-based algorithms have a weakness that can be fallen into local extreme after a number of evolution generations. In this paper, we adopted a new adaptive nonlinear weight update strategy based on fitness value and new neighborhood topology for Particle Swarm Optimization algorithm, thereby helping to prevent PSO from falling into local extremes. The new algorithm is called AdaL-PSO. A numerical analysis is carried out using iMOPSE benchmark dataset and is compared with some other early algorithms. Results presented suggest the prospect of our proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.50
自引率
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学术官方微信