More-for-Less Paradox in Time Minimization Transportation Problem with Mixed Constraints

Q3 Business, Management and Accounting American Journal of Mathematical and Management Sciences Pub Date : 2022-01-27 DOI:10.1080/01966324.2022.2027302
Swati Agarwal, Shaurav Sharma
{"title":"More-for-Less Paradox in Time Minimization Transportation Problem with Mixed Constraints","authors":"Swati Agarwal, Shaurav Sharma","doi":"10.1080/01966324.2022.2027302","DOIUrl":null,"url":null,"abstract":"Abstract In emergency situations, such as at the time of the outbreak of infectious viruses (COVID-19, SARS, Ebola, MERS, etc.), strike of natural disasters (Earthquakes, tsunamis, cyclones, etc.), wars, terrorist attacks, etc., where distributing essential goods and services in minimum possible time is a major logistical challenge, the concept of more-for-less paradox could be helpful. In a minimization type transportation problem, this paradoxical situation occurs when the value of objective function falls below the optimum value by shipping a large number of total goods. In this article, a unified algorithm is developed to identify and resolve the existence of paradoxical situation in the time minimization transportation problem with mixed constraints using right-hand side parametric formulation. Using this prior approach, the paradoxical solution (if exists) can be found first, followed by an optimal solution. If the paradoxical part does not exist, it gets neglected. The conditions governing the existence of more transportation flow in less shipping time enable the decision-maker to extend the optimal solution in search of more-for-less opportunity at the time of emergency. The validity of an algorithm has been tested through numerical illustrations and by computational observations on matlab.","PeriodicalId":35850,"journal":{"name":"American Journal of Mathematical and Management Sciences","volume":"42 1","pages":"69 - 85"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Journal of Mathematical and Management Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01966324.2022.2027302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract In emergency situations, such as at the time of the outbreak of infectious viruses (COVID-19, SARS, Ebola, MERS, etc.), strike of natural disasters (Earthquakes, tsunamis, cyclones, etc.), wars, terrorist attacks, etc., where distributing essential goods and services in minimum possible time is a major logistical challenge, the concept of more-for-less paradox could be helpful. In a minimization type transportation problem, this paradoxical situation occurs when the value of objective function falls below the optimum value by shipping a large number of total goods. In this article, a unified algorithm is developed to identify and resolve the existence of paradoxical situation in the time minimization transportation problem with mixed constraints using right-hand side parametric formulation. Using this prior approach, the paradoxical solution (if exists) can be found first, followed by an optimal solution. If the paradoxical part does not exist, it gets neglected. The conditions governing the existence of more transportation flow in less shipping time enable the decision-maker to extend the optimal solution in search of more-for-less opportunity at the time of emergency. The validity of an algorithm has been tested through numerical illustrations and by computational observations on matlab.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
混合约束下时间最小化运输问题的多换少悖论
在传染病(COVID-19、SARS、埃博拉、MERS等)爆发、自然灾害(地震、海啸、飓风等)、战争、恐怖袭击等紧急情况下,在尽可能短的时间内分配基本商品和服务是一项重大的后勤挑战,“多赔少”悖论的概念可能会有所帮助。在最小化型运输问题中,当目标函数的值由于运输了大量的货物总量而低于最优值时,就会出现这种矛盾情况。本文提出了一种统一的算法来识别和解决混合约束下的时间最小化运输问题中存在的悖论情况。使用这种先验方法,可以首先找到矛盾解(如果存在),然后找到最优解。如果矛盾的部分不存在,它就会被忽略。在更短的运输时间内存在更多运输流量的条件使决策者能够在紧急情况下扩展最优解决方案,以寻求更少的机会。通过数值算例和matlab上的计算观察,验证了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
American Journal of Mathematical and Management Sciences
American Journal of Mathematical and Management Sciences Business, Management and Accounting-Business, Management and Accounting (all)
CiteScore
2.70
自引率
0.00%
发文量
5
期刊最新文献
The Unit Omega Distribution, Properties and Its Application Classical and Bayesian Inference of Unit Gompertz Distribution Based on Progressively Type II Censored Data An Alternative Discrete Analogue of the Half-Logistic Distribution Based on Minimization of a Distance between Cumulative Distribution Functions Classical and Bayes Analyses of Autoregressive Model with Heavy-Tailed Error Testing on the Quantiles of a Single Normal Population in the Presence of Several Normal Populations with a Common Variance
×
引用
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