{"title":"I-SOFT -寻找运输问题最佳IBFS的最佳方法","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":"{\"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}","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}
I-SOFT – The Best Method for Finding the Best IBFS to Transportation Problems
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
