用新颖的启发式Dhouib-Matrix-AP1揭示直觉三角模糊环境下的分配问题

Q3 Decision Sciences
S. Dhouib
{"title":"用新颖的启发式Dhouib-Matrix-AP1揭示直觉三角模糊环境下的分配问题","authors":"S. Dhouib","doi":"10.2298/yjor220915005d","DOIUrl":null,"url":null,"abstract":"The Assignment Problem (AP) can be stated as n activities to be assigned to n resources in such a way that the overall cost of assignment is minimized and each activity is assigned to one and only one resource. In real-life, the parameters of the AP are presented as uncertain numbers due to the lack of knowledge, experiences or any other (internal or external) factor. In this paper, the AP is considered under intuitionistic triangular fuzzy number and solved by the novel constructive heuristic Dhouib-Matrix-AP1 (DM-AP1) with a time complexity of O(n). Actually, this paper presents the first enhancement of the novel heuristic DM-AP1 to solve the AP under intuitionistic triangular fuzzy environment. DM-AP1 is composed of three simple steps: computing the total cost, selecting the highest value and finding the minimal element. These steps are repeated in n iterations with the use of a standard deviation statistical metric. Two case studies of AP under intuitionistic triangular fuzzy set are taken from the literature and a step-by-step application of the novel DM-AP1 heuristic is presented for more clarification.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"56 Pt 7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Unravelling the assignment problem under intuitionistic triangular fuzzy environment by the novel heuristic Dhouib-Matrix-AP1\",\"authors\":\"S. Dhouib\",\"doi\":\"10.2298/yjor220915005d\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Assignment Problem (AP) can be stated as n activities to be assigned to n resources in such a way that the overall cost of assignment is minimized and each activity is assigned to one and only one resource. In real-life, the parameters of the AP are presented as uncertain numbers due to the lack of knowledge, experiences or any other (internal or external) factor. In this paper, the AP is considered under intuitionistic triangular fuzzy number and solved by the novel constructive heuristic Dhouib-Matrix-AP1 (DM-AP1) with a time complexity of O(n). Actually, this paper presents the first enhancement of the novel heuristic DM-AP1 to solve the AP under intuitionistic triangular fuzzy environment. DM-AP1 is composed of three simple steps: computing the total cost, selecting the highest value and finding the minimal element. These steps are repeated in n iterations with the use of a standard deviation statistical metric. Two case studies of AP under intuitionistic triangular fuzzy set are taken from the literature and a step-by-step application of the novel DM-AP1 heuristic is presented for more clarification.\",\"PeriodicalId\":52438,\"journal\":{\"name\":\"Yugoslav Journal of Operations Research\",\"volume\":\"56 Pt 7 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Yugoslav Journal of Operations Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2298/yjor220915005d\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Yugoslav Journal of Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/yjor220915005d","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 4

摘要

分配问题(AP)可以描述为将n个活动分配给n个资源,这样分配的总成本最小,并且每个活动分配给一个且只有一个资源。在现实生活中,由于缺乏知识、经验或任何其他(内部或外部)因素,AP的参数呈现为不确定的数字。本文考虑直觉三角模糊数下的AP问题,采用时间复杂度为0 (n)的新型建设性启发式Dhouib-Matrix-AP1 (DM-AP1)求解。实际上,本文首次对启发式算法DM-AP1进行了改进,解决了直觉三角模糊环境下的AP问题。DM-AP1由三个简单步骤组成:计算总成本、选择最大值和寻找最小元素。这些步骤在使用标准偏差统计度量的n次迭代中重复。本文从文献中选取了直觉三角模糊集下AP的两个案例研究,并给出了新的DM-AP1启发式的逐步应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Unravelling the assignment problem under intuitionistic triangular fuzzy environment by the novel heuristic Dhouib-Matrix-AP1
The Assignment Problem (AP) can be stated as n activities to be assigned to n resources in such a way that the overall cost of assignment is minimized and each activity is assigned to one and only one resource. In real-life, the parameters of the AP are presented as uncertain numbers due to the lack of knowledge, experiences or any other (internal or external) factor. In this paper, the AP is considered under intuitionistic triangular fuzzy number and solved by the novel constructive heuristic Dhouib-Matrix-AP1 (DM-AP1) with a time complexity of O(n). Actually, this paper presents the first enhancement of the novel heuristic DM-AP1 to solve the AP under intuitionistic triangular fuzzy environment. DM-AP1 is composed of three simple steps: computing the total cost, selecting the highest value and finding the minimal element. These steps are repeated in n iterations with the use of a standard deviation statistical metric. Two case studies of AP under intuitionistic triangular fuzzy set are taken from the literature and a step-by-step application of the novel DM-AP1 heuristic is presented for more clarification.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Yugoslav Journal of Operations Research
Yugoslav Journal of Operations Research Decision Sciences-Management Science and Operations Research
CiteScore
2.50
自引率
0.00%
发文量
14
审稿时长
24 weeks
×
引用
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学术官方微信