An Effective Approach for Solving Multi-objective Transportation Problem

IF 0.9 Q3 STATISTICS & PROBABILITY
Lakhveer Kaur, Sukhveer Singh, Ashok Singh Bhandari, Sandeep Singh, M. Ram
{"title":"An Effective Approach for Solving Multi-objective Transportation Problem","authors":"Lakhveer Kaur, Sukhveer Singh, Ashok Singh Bhandari, Sandeep Singh, M. Ram","doi":"10.13052/jrss0974-8024.1618","DOIUrl":null,"url":null,"abstract":"In this present study, a transportation problem is considered such that the total cost and time of transportation are minimized without taking into account their priorities. In literature, there are less techniques available for finding the efficient solutions of multi-objective transportation problem. So, we developed a heuristic algorithm to find most efficient solution of multi-objective transportation problem, which gives efficient solution with minimum difference from ideal solution. Firstly, we aim at formulating a multi-objective transportation problems along with a novel algorithm to find efficient solutions. The proposed algorithm gives optimal solution faster in comparison to other available techniques in literature for the given multi-objective transportation problem. Moreover, it avoids the degeneracy as well as requires low computational effort. Furthermore, an illustrative example is provided to show the feasibility and applicability of the proposed approach and compare the results with the existing approaches to show the effectiveness of it.","PeriodicalId":42526,"journal":{"name":"Journal of Reliability and Statistical Studies","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Reliability and Statistical Studies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13052/jrss0974-8024.1618","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0

Abstract

In this present study, a transportation problem is considered such that the total cost and time of transportation are minimized without taking into account their priorities. In literature, there are less techniques available for finding the efficient solutions of multi-objective transportation problem. So, we developed a heuristic algorithm to find most efficient solution of multi-objective transportation problem, which gives efficient solution with minimum difference from ideal solution. Firstly, we aim at formulating a multi-objective transportation problems along with a novel algorithm to find efficient solutions. The proposed algorithm gives optimal solution faster in comparison to other available techniques in literature for the given multi-objective transportation problem. Moreover, it avoids the degeneracy as well as requires low computational effort. Furthermore, an illustrative example is provided to show the feasibility and applicability of the proposed approach and compare the results with the existing approaches to show the effectiveness of it.
解决多目标交通问题的有效方法
在本研究中,考虑的是一个运输问题,即在不考虑运输总成本和时间优先级的情况下,使其最小化。在文献中,找到多目标运输问题有效解决方案的技术较少。因此,我们开发了一种启发式算法来寻找多目标运输问题的最有效解,它能给出与理想解差异最小的有效解。首先,我们旨在提出一个多目标运输问题,同时提出一种新的算法来寻找有效的解决方案。对于给定的多目标运输问题,与文献中的其他现有技术相比,所提出的算法能更快地给出最优解。此外,该算法还避免了退化问题,而且计算量小。此外,还提供了一个示例来说明所提方法的可行性和适用性,并将结果与现有方法进行比较,以显示其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.60
自引率
12.50%
发文量
24
×
引用
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学术官方微信