梯形模糊数的一种新的距离和排序方法

M. Jahantigh, S. Hajighasemi
{"title":"梯形模糊数的一种新的距离和排序方法","authors":"M. Jahantigh, S. Hajighasemi","doi":"10.5899/2014/JFSVA-00188","DOIUrl":null,"url":null,"abstract":"This study presents an approximate approach for ranking fuzzy numbers based on the centroid point of a fuzzy number and its area. The total approximate is determined by convex combining of fuzzy number’s relative and its area that based on decision maker’s optimistic perspectives. The proposed approach is simple in terms of computational efforts and is efficient in ranking a large quantity of fuzzy numbers. By a group of examples in [3] demonstrate the accuracy and applicability of the proposed approach. Finally by this approach, a new distance is introduced between two fuzzy numbers.","PeriodicalId":308518,"journal":{"name":"Journal of Fuzzy Set Valued Analysis","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new distance and ranking method for trapezoidal fuzzy numbers\",\"authors\":\"M. Jahantigh, S. Hajighasemi\",\"doi\":\"10.5899/2014/JFSVA-00188\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study presents an approximate approach for ranking fuzzy numbers based on the centroid point of a fuzzy number and its area. The total approximate is determined by convex combining of fuzzy number’s relative and its area that based on decision maker’s optimistic perspectives. The proposed approach is simple in terms of computational efforts and is efficient in ranking a large quantity of fuzzy numbers. By a group of examples in [3] demonstrate the accuracy and applicability of the proposed approach. Finally by this approach, a new distance is introduced between two fuzzy numbers.\",\"PeriodicalId\":308518,\"journal\":{\"name\":\"Journal of Fuzzy Set Valued Analysis\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Fuzzy Set Valued Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5899/2014/JFSVA-00188\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Fuzzy Set Valued Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5899/2014/JFSVA-00188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种基于模糊数质心点及其面积的模糊数近似排序方法。根据决策者的乐观态度,将模糊数的相对值与模糊数的面积进行凸组合来确定总近似。该方法计算量简单,对大量模糊数的排序效率高。通过[3]中的一组实例证明了所提出方法的准确性和适用性。最后,通过该方法引入了两个模糊数之间的新距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new distance and ranking method for trapezoidal fuzzy numbers
This study presents an approximate approach for ranking fuzzy numbers based on the centroid point of a fuzzy number and its area. The total approximate is determined by convex combining of fuzzy number’s relative and its area that based on decision maker’s optimistic perspectives. The proposed approach is simple in terms of computational efforts and is efficient in ranking a large quantity of fuzzy numbers. By a group of examples in [3] demonstrate the accuracy and applicability of the proposed approach. Finally by this approach, a new distance is introduced between two fuzzy numbers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信