Modified matrix minima method for subset constrained transportation problem and its performance evaluation with respect to the optimal solution by mathematical model

Raju Prajapati, Jayantika Pal, O. Dubey
{"title":"Modified matrix minima method for subset constrained transportation problem and its performance evaluation with respect to the optimal solution by mathematical model","authors":"Raju Prajapati, Jayantika Pal, O. Dubey","doi":"10.18510/ijsrtm.2023.1114","DOIUrl":null,"url":null,"abstract":"Purpose of the study: The transportation problem has a huge application in logistics. Therefore, dealing a transportation problem with permissible constraints is always an interesting area. In the present paper, we have tried a version of transportation problem which is constrained in nature. We have explored strategies for dealing the subset constrained transportation problem. \nMethodology: An updated version of matrix minima method is proposed in this paper. This version is used for subset constrained transportation problem only. We have also applied the mathematical model for solving the same subset constrained transportation problem. \nMain Findings: The mathematical model gives an optimal solution of the constrained transportation problem with the help of software. It is found that the proposed updated matrix minima method does not guarantee the optimality. However, we use the matrix minima approach for having an idea of the closer feasible solution. It is found that the mathematical model is always a superior way to find an optimal solution. \nApplications of this study: The study has a huge application in logistics. \nNovelty/Originality of this study: An updated version of matrix minima method is proposed. The method is applied on constrained transportation problem and the results are compared with the optimal solution.","PeriodicalId":111225,"journal":{"name":"International Journal of Students' Research in Technology & Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Students' Research in Technology & Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18510/ijsrtm.2023.1114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Purpose of the study: The transportation problem has a huge application in logistics. Therefore, dealing a transportation problem with permissible constraints is always an interesting area. In the present paper, we have tried a version of transportation problem which is constrained in nature. We have explored strategies for dealing the subset constrained transportation problem. Methodology: An updated version of matrix minima method is proposed in this paper. This version is used for subset constrained transportation problem only. We have also applied the mathematical model for solving the same subset constrained transportation problem. Main Findings: The mathematical model gives an optimal solution of the constrained transportation problem with the help of software. It is found that the proposed updated matrix minima method does not guarantee the optimality. However, we use the matrix minima approach for having an idea of the closer feasible solution. It is found that the mathematical model is always a superior way to find an optimal solution. Applications of this study: The study has a huge application in logistics. Novelty/Originality of this study: An updated version of matrix minima method is proposed. The method is applied on constrained transportation problem and the results are compared with the optimal solution.
子集约束运输问题的修正矩阵最小法及其数学模型最优解的性能评价
研究目的:运输问题在物流中有着巨大的应用。因此,处理具有允许约束的运输问题总是一个有趣的领域。在本文中,我们尝试了一个具有约束性质的运输问题。我们探讨了处理子集约束运输问题的策略。方法:本文提出了矩阵最小法的更新版本。此版本仅用于子集约束运输问题。我们还应用数学模型来解决相同的子集约束运输问题。主要发现:该数学模型在软件的帮助下给出了约束运输问题的最优解。结果表明,改进后的矩阵最小法不能保证最优性。然而,我们使用矩阵最小法来获得更接近的可行解。结果表明,数学模型总是寻找最优解的较优方法。本研究的应用:本研究在物流领域具有巨大的应用价值。本研究的新颖性/独创性:提出一种更新版的矩阵最小法。将该方法应用于约束运输问题,并与最优解进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书