An extended Vogel’s approximation algorithm for efficiently solving Fermatean fuzzy solid transportation problems

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Shivani, Deepika Rani
{"title":"An extended Vogel’s approximation algorithm for efficiently solving Fermatean fuzzy solid transportation problems","authors":"Shivani, Deepika Rani","doi":"10.1007/s00500-024-09812-x","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper aims to solve a solid transportation problem, wherein the uncertain parameters related to the problem are represented using triangular Fermatean fuzzy numbers. Fermatean fuzzy sets offer a relatively novel and wider alternative by providing the decision-makers with more versatile means of managing the uncertain information throughout the decision-making process. As per our literature survey, no algorithm exists in the literature for fuzzy solid transportation problems with parameters as triangular Fermatean fuzzy numbers. Therefore, in this study, the existing Vogel’s approximation method for the initial basic feasible solution (IBFS) of the traditional transportation problems is extended for the Fermatean fuzzy solid transportation problems. Further, a new method for getting the optimal solution from the obtained IBFS is proposed. The computational complexity and operational efficacy of the proposed algorithm are also discussed. Two application examples have been solved to illustrate the practicality of the proposed algorithm. For the comparative study, the problems are also solved with LINGO 20.0 software. The obtained results of IBFS are found to be significantly lower than those obtained by certain existing methods and the optimal values are comparable with those generated by the LINGO 20.0 optimization solver. Through a comparative analysis, it has been found that the proposed algorithm consistently produces optimal transportation costs for both application examples, adding to the novelty of the proposed work. Finally, the conclusion and future scope of this study are described.</p><h3 data-test=\"abstract-sub-heading\">Graphical abstract</h3><p>Graphical depiction of abstract</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"15 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00500-024-09812-x","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

This paper aims to solve a solid transportation problem, wherein the uncertain parameters related to the problem are represented using triangular Fermatean fuzzy numbers. Fermatean fuzzy sets offer a relatively novel and wider alternative by providing the decision-makers with more versatile means of managing the uncertain information throughout the decision-making process. As per our literature survey, no algorithm exists in the literature for fuzzy solid transportation problems with parameters as triangular Fermatean fuzzy numbers. Therefore, in this study, the existing Vogel’s approximation method for the initial basic feasible solution (IBFS) of the traditional transportation problems is extended for the Fermatean fuzzy solid transportation problems. Further, a new method for getting the optimal solution from the obtained IBFS is proposed. The computational complexity and operational efficacy of the proposed algorithm are also discussed. Two application examples have been solved to illustrate the practicality of the proposed algorithm. For the comparative study, the problems are also solved with LINGO 20.0 software. The obtained results of IBFS are found to be significantly lower than those obtained by certain existing methods and the optimal values are comparable with those generated by the LINGO 20.0 optimization solver. Through a comparative analysis, it has been found that the proposed algorithm consistently produces optimal transportation costs for both application examples, adding to the novelty of the proposed work. Finally, the conclusion and future scope of this study are described.

Graphical abstract

Graphical depiction of abstract

Abstract Image

高效求解费尔马特模糊固体运输问题的扩展 Vogel 近似算法
摘要 本文旨在解决一个固体运输问题,其中与该问题有关的不确定参数使用三角形费马泰模糊数表示。Fermatean 模糊集提供了一种相对新颖和更广泛的选择,为决策者在整个决策过程中管理不确定信息提供了更多的手段。根据我们的文献调查,文献中还没有针对参数为三角费马棣模糊数的模糊固体运输问题的算法。因此,在本研究中,将现有的 Vogel 近似方法用于传统运输问题的初始基本可行解(IBFS),并将其扩展用于费马特式模糊固体运输问题。此外,还提出了一种从得到的初始基本可行解中获取最优解的新方法。此外,还讨论了所提算法的计算复杂度和运行效率。为了说明所提算法的实用性,还解决了两个应用实例。为了进行比较研究,还使用 LINGO 20.0 软件解决了这些问题。结果发现,IBFS 得到的结果明显低于某些现有方法得到的结果,而且其最优值与 LINGO 20.0 优化求解器生成的最优值相当。通过对比分析发现,所提出的算法在两个应用实例中都能始终产生最优运输成本,这增加了所提出工作的新颖性。最后,介绍了本研究的结论和未来展望。 图表式摘要图表式摘要描述
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Soft Computing
Soft Computing 工程技术-计算机:跨学科应用
CiteScore
8.10
自引率
9.80%
发文量
927
审稿时长
7.3 months
期刊介绍: Soft Computing is dedicated to system solutions based on soft computing techniques. It provides rapid dissemination of important results in soft computing technologies, a fusion of research in evolutionary algorithms and genetic programming, neural science and neural net systems, fuzzy set theory and fuzzy systems, and chaos theory and chaotic systems. Soft Computing encourages the integration of soft computing techniques and tools into both everyday and advanced applications. By linking the ideas and techniques of soft computing with other disciplines, the journal serves as a unifying platform that fosters comparisons, extensions, and new applications. As a result, the journal is an international forum for all scientists and engineers engaged in research and development in this fast growing field.
×
引用
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学术官方微信