I-SOFT – The Best Method for Finding the Best IBFS to Transportation Problems

R. Murugesan
{"title":"I-SOFT – The Best Method for Finding the Best IBFS to Transportation Problems","authors":"R. Murugesan","doi":"10.37622/gjpam/18.1.2022.377-391","DOIUrl":null,"url":null,"abstract":"In this paper, we have improved the performance of the existing SOFTMIN method for finding best initial basic feasible solution (IBFS) to transportation problems (TPs) by imposing two changes / conditions on it. The “Improved SOFTMIN” method is simply called as I-SOFT method. The performance of the I-SOFT over SOFTMIN has been tested on a set of 21 identified and acknowledged “challenging” and “more challenging” TPs. Experimental results validate that the performance of I-SOFT is much better than that of by SOFTMIN. Besides, at present-day the I-SOFT method has been identified and long-established as the best method to find the best IBFS to TPs. This is factual because at present-day no method has been proposed and proved as the best method to find the optimal solution directly to any given TP. 2010","PeriodicalId":198465,"journal":{"name":"Global Journal of Pure and Applied Mathematics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Journal of Pure and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37622/gjpam/18.1.2022.377-391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we have improved the performance of the existing SOFTMIN method for finding best initial basic feasible solution (IBFS) to transportation problems (TPs) by imposing two changes / conditions on it. The “Improved SOFTMIN” method is simply called as I-SOFT method. The performance of the I-SOFT over SOFTMIN has been tested on a set of 21 identified and acknowledged “challenging” and “more challenging” TPs. Experimental results validate that the performance of I-SOFT is much better than that of by SOFTMIN. Besides, at present-day the I-SOFT method has been identified and long-established as the best method to find the best IBFS to TPs. This is factual because at present-day no method has been proposed and proved as the best method to find the optimal solution directly to any given TP. 2010
I-SOFT -寻找运输问题最佳IBFS的最佳方法
在本文中,我们通过对现有的SOFTMIN方法施加两个变化/条件来改进其寻找运输问题(tp)的最佳初始基本可行解(IBFS)的性能。“改进的SOFTMIN”方法简称为I-SOFT方法。I-SOFT在SOFTMIN上的性能已经在一组21个确定并承认的“具有挑战性”和“更具挑战性”的tp上进行了测试。实验结果表明,I-SOFT算法的性能明显优于SOFTMIN算法。此外,目前,I-SOFT方法已被确定并长期确立为寻找最佳IBFS到tp的最佳方法。这是事实,因为目前还没有任何方法被提出并证明是直接找到任何给定TP的最优解的最佳方法。2010
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信