A modified algorithm for full fuzzy transportation problem with simple additive weighting

M. Sam’an, Farikhin, B. Surarso, Solichin Zaki
{"title":"A modified algorithm for full fuzzy transportation problem with simple additive weighting","authors":"M. Sam’an, Farikhin, B. Surarso, Solichin Zaki","doi":"10.1109/ICOIACT.2018.8350745","DOIUrl":null,"url":null,"abstract":"How to allocate fuzzy transportation costs that has same ranking value on Fuzzy Transportation Algorithm in solving the problem of Full Fuzzy Transportation is to arbitrarily chosen for transportation costs. Whereas this way affects the base cell to be determined allocate maximum approximate fuzzy quantity unit. Then, the Modified Fuzzy Transportation Algorithm indicated by adding weights using SAW technique so that there will be no similar fuzzy transportation costs. To illustrate the proposed modification algorithm a case study is solved and obtained result are compared with the result of the existing algorithm. Since the proposed algorithm is a direct extension of the classical method so the proposed modification algorithm is very easy to understand and realistic to apply for solving FFTP occurring in real life situation for a decision maker.","PeriodicalId":6660,"journal":{"name":"2018 International Conference on Information and Communications Technology (ICOIACT)","volume":"35 1","pages":"684-688"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information and Communications Technology (ICOIACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIACT.2018.8350745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

How to allocate fuzzy transportation costs that has same ranking value on Fuzzy Transportation Algorithm in solving the problem of Full Fuzzy Transportation is to arbitrarily chosen for transportation costs. Whereas this way affects the base cell to be determined allocate maximum approximate fuzzy quantity unit. Then, the Modified Fuzzy Transportation Algorithm indicated by adding weights using SAW technique so that there will be no similar fuzzy transportation costs. To illustrate the proposed modification algorithm a case study is solved and obtained result are compared with the result of the existing algorithm. Since the proposed algorithm is a direct extension of the classical method so the proposed modification algorithm is very easy to understand and realistic to apply for solving FFTP occurring in real life situation for a decision maker.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有简单加性加权的全模糊运输问题的改进算法
在求解全模糊运输问题时,如何对模糊运输算法中具有相同排序值的模糊运输成本进行分配,就是对运输成本进行任意选择。而这种方式影响了待确定的基单元分配最大近似模糊量单元。然后,利用SAW技术增加权值,提出改进模糊运输算法,使不存在相似的模糊运输成本。为了说明所提出的修正算法,通过实例分析,并与现有算法的结果进行了比较。由于所提出的算法是经典方法的直接扩展,因此所提出的修正算法易于理解,适用于决策者解决现实生活中发生的FFTP问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data Normalization and Database Design for Joglosemar Tourism Management of fault tolerance and traffic congestion in cloud data center Development of smart public transportation system in Jakarta city based on integrated IoT platform Improving the quality of enterprise IT goals using COBIT 5 prioritization approach Data mining technique with cluster anaysis use K-means algorithm for LQ45 index on Indonesia stock exchange
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1