Development of a Novel Fuzzy Hierarchical Location-Routing Optimization Model Considering Reliability

IF 3.6 Q2 MANAGEMENT
Javid Ghahremani-Nahr, Hamed Nozari, Maryam Rahmaty, Parvaneh Zeraati Foukolaei, Azita Sherejsharifi
{"title":"Development of a Novel Fuzzy Hierarchical Location-Routing Optimization Model Considering Reliability","authors":"Javid Ghahremani-Nahr, Hamed Nozari, Maryam Rahmaty, Parvaneh Zeraati Foukolaei, Azita Sherejsharifi","doi":"10.3390/logistics7030064","DOIUrl":null,"url":null,"abstract":"Background: This paper discusses the optimization of a novel fuzzy hierarchical location-routing problem, taking into consideration reliability. The mathematical model presented aims to determine the optimal locations of production centers and warehouses, as well as the optimal routing of vehicles, in order to minimize total costs. Methods: Because of the uncertainty surrounding the demand and transportation cost parameters, a fuzzy programming method was employed to control the model. To solve the mathematical model, both GA and PSO algorithms were used. Results: The results show that as the uncertainty rate increases, the total costs also increase. Additionally, the results indicate that the maximum relative difference percentage between the solutions of the GA and PSO, and the optimal solutions are 0.587 and 0.792, respectively. On the other hand, analysis of numerical examples demonstrates that the Baron Solver is unable to solve large-scale numerical examples. Conclusions: By comparing the results of GA and PSO, it is observed that PSO was able to solve numerical examples in less time than GA, while GA obtained better results than PSO. Therefore, the TOPSIS method was used to rank the different solution methods, which resulted in GA being recognized as an effective algorithm with a utility weight of 0.972.","PeriodicalId":56264,"journal":{"name":"Logistics-Basel","volume":null,"pages":null},"PeriodicalIF":3.6000,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logistics-Basel","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/logistics7030064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 1

Abstract

Background: This paper discusses the optimization of a novel fuzzy hierarchical location-routing problem, taking into consideration reliability. The mathematical model presented aims to determine the optimal locations of production centers and warehouses, as well as the optimal routing of vehicles, in order to minimize total costs. Methods: Because of the uncertainty surrounding the demand and transportation cost parameters, a fuzzy programming method was employed to control the model. To solve the mathematical model, both GA and PSO algorithms were used. Results: The results show that as the uncertainty rate increases, the total costs also increase. Additionally, the results indicate that the maximum relative difference percentage between the solutions of the GA and PSO, and the optimal solutions are 0.587 and 0.792, respectively. On the other hand, analysis of numerical examples demonstrates that the Baron Solver is unable to solve large-scale numerical examples. Conclusions: By comparing the results of GA and PSO, it is observed that PSO was able to solve numerical examples in less time than GA, while GA obtained better results than PSO. Therefore, the TOPSIS method was used to rank the different solution methods, which resulted in GA being recognized as an effective algorithm with a utility weight of 0.972.
一种考虑可靠性的模糊分层定位路由优化模型的建立
背景:本文讨论了一种考虑可靠性的模糊分层定位路由优化问题。提出的数学模型旨在确定生产中心和仓库的最优位置,以及车辆的最优路线,以使总成本最小化。方法:考虑需求和运输成本参数的不确定性,采用模糊规划方法对模型进行控制。为了求解数学模型,采用了遗传算法和粒子群算法。结果:结果表明,随着不确定率的增加,总成本也随之增加。结果表明,遗传算法与粒子群算法解的最大相对差百分比为0.587,最优解为0.792。另一方面,数值算例分析表明,Baron求解器无法求解大规模数值算例。结论:通过比较遗传算法和粒子群算法的结果可以看出,粒子群算法比遗传算法能够在更短的时间内求解数值样例,而遗传算法的结果优于粒子群算法。因此,采用TOPSIS方法对不同的求解方法进行排序,结果GA被认为是一种有效的算法,其效用权值为0.972。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Logistics-Basel
Logistics-Basel Multiple-
CiteScore
6.60
自引率
0.00%
发文量
0
审稿时长
11 weeks
×
引用
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学术官方微信