不确定条件下定位-路由三层供应链网络设计

Leila Hashemi, Armin Mahmoodi, Milad Jasemi, R. Millar, J. Laliberté
{"title":"不确定条件下定位-路由三层供应链网络设计","authors":"Leila Hashemi, Armin Mahmoodi, Milad Jasemi, R. Millar, J. Laliberté","doi":"10.1108/ijicc-08-2021-0163","DOIUrl":null,"url":null,"abstract":"PurposeIn the present research, location and routing problems, as well as the supply chain, which includes manufacturers, distributor candidate sites and retailers, are explored. The goal of addressing the issue is to reduce delivery times and system costs for retailers so that routing and distributor location may be determined.Design/methodology/approachBy adding certain unique criteria and limits, the issue becomes more realistic. Customers expect simultaneous deliveries and pickups, and retail service start times have soft and hard time windows. Transportation expenses, noncompliance with the soft time window, distributor construction, vehicle purchase or leasing, and manufacturing costs are all part of the system costs. The problem's conceptual model is developed and modeled first, and then General Algebraic Modeling System software (GAMS) and Multiple Objective Particle Swarm Optimization (MOPSO) and non-dominated sorting genetic algorithm II (NSGAII) algorithms are used to solve it in small dimensions.FindingsAccording to the mathematical model's solution, the average error of the two suggested methods, in contrast to the exact answer, is less than 0.7%. In addition, the performance of algorithms in terms of deviation from the GAMS exact solution is pretty satisfactory, with a divergence of 0.4% for the biggest problem (N = 100). As a result, NSGAII is shown to be superior to MOSPSO.Research limitations/implicationsSince this paper deals with two bi-objective models, the priorities of decision-makers in selecting the best solution were not taken into account, and each of the objective functions was given an equal weight based on the weighting procedures. The model has not been compared or studied in both robust and deterministic modes. This is because, with the exception of the variable that indicates traffic mode uncertainty, all variables are deterministic, and the uncertainty character of demand in each level of the supply chain is ignored.Practical implicationsThe suggested model's conclusions are useful for any group of decision-makers concerned with optimizing production patterns at any level. The employment of a diverse fleet of delivery vehicles, as well as the use of stochastic optimization techniques to define the time windows, demonstrates how successful distribution networks are in lowering operational costs.Originality/valueAccording to a multi-objective model in a three-echelon supply chain, this research fills in the gaps in the link between routing and location choices in a realistic manner, taking into account the actual restrictions of a distribution network. The model may reduce the uncertainty in vehicle performance while choosing a refueling strategy or dealing with diverse traffic scenarios, bringing it closer to certainty. In addition, two modified MOPSO and NSGA-II algorithms are presented for solving the model, with the results compared to the exact GAMS approach for medium- and small-sized problems.","PeriodicalId":352072,"journal":{"name":"Int. J. Intell. Comput. Cybern.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Designing a locating-routing three-echelon supply chain network under uncertainty\",\"authors\":\"Leila Hashemi, Armin Mahmoodi, Milad Jasemi, R. Millar, J. Laliberté\",\"doi\":\"10.1108/ijicc-08-2021-0163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PurposeIn the present research, location and routing problems, as well as the supply chain, which includes manufacturers, distributor candidate sites and retailers, are explored. The goal of addressing the issue is to reduce delivery times and system costs for retailers so that routing and distributor location may be determined.Design/methodology/approachBy adding certain unique criteria and limits, the issue becomes more realistic. Customers expect simultaneous deliveries and pickups, and retail service start times have soft and hard time windows. Transportation expenses, noncompliance with the soft time window, distributor construction, vehicle purchase or leasing, and manufacturing costs are all part of the system costs. The problem's conceptual model is developed and modeled first, and then General Algebraic Modeling System software (GAMS) and Multiple Objective Particle Swarm Optimization (MOPSO) and non-dominated sorting genetic algorithm II (NSGAII) algorithms are used to solve it in small dimensions.FindingsAccording to the mathematical model's solution, the average error of the two suggested methods, in contrast to the exact answer, is less than 0.7%. In addition, the performance of algorithms in terms of deviation from the GAMS exact solution is pretty satisfactory, with a divergence of 0.4% for the biggest problem (N = 100). As a result, NSGAII is shown to be superior to MOSPSO.Research limitations/implicationsSince this paper deals with two bi-objective models, the priorities of decision-makers in selecting the best solution were not taken into account, and each of the objective functions was given an equal weight based on the weighting procedures. The model has not been compared or studied in both robust and deterministic modes. This is because, with the exception of the variable that indicates traffic mode uncertainty, all variables are deterministic, and the uncertainty character of demand in each level of the supply chain is ignored.Practical implicationsThe suggested model's conclusions are useful for any group of decision-makers concerned with optimizing production patterns at any level. The employment of a diverse fleet of delivery vehicles, as well as the use of stochastic optimization techniques to define the time windows, demonstrates how successful distribution networks are in lowering operational costs.Originality/valueAccording to a multi-objective model in a three-echelon supply chain, this research fills in the gaps in the link between routing and location choices in a realistic manner, taking into account the actual restrictions of a distribution network. The model may reduce the uncertainty in vehicle performance while choosing a refueling strategy or dealing with diverse traffic scenarios, bringing it closer to certainty. In addition, two modified MOPSO and NSGA-II algorithms are presented for solving the model, with the results compared to the exact GAMS approach for medium- and small-sized problems.\",\"PeriodicalId\":352072,\"journal\":{\"name\":\"Int. J. Intell. Comput. Cybern.\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Intell. Comput. Cybern.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ijicc-08-2021-0163\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Intell. Comput. Cybern.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijicc-08-2021-0163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在本研究中,定位和路线问题,以及供应链,其中包括制造商,分销商候选地点和零售商,进行了探讨。解决这个问题的目标是减少零售商的交货时间和系统成本,以便确定路线和分销商的位置。通过添加某些独特的标准和限制,问题变得更加现实。客户希望同时送货和取货,零售服务的开始时间有软时间窗口和硬时间窗口。运输费用、不符合软时间窗口、分销商建设、车辆购买或租赁以及制造成本都是系统成本的一部分。首先建立了该问题的概念模型并对其进行了建模,然后利用通用代数建模系统软件(GAMS)和多目标粒子群优化算法(MOPSO)和非支配排序遗传算法II (NSGAII)在小维度上进行了求解。根据数学模型的解,与精确答案相比,两种建议方法的平均误差小于0.7%。此外,在偏离GAMS精确解方面,算法的性能相当令人满意,最大问题(N = 100)的偏离度为0.4%。结果表明,NSGAII优于MOSPSO。由于本文处理的是两个双目标模型,因此没有考虑决策者在选择最优方案时的优先级,并且根据加权程序赋予每个目标函数相同的权重。该模型尚未在鲁棒和确定性模式下进行比较或研究。这是因为,除了表示交通方式不确定性的变量外,所有变量都是确定性的,忽略了供应链各层次需求的不确定性特征。实际意义所建议的模型的结论是有用的任何一组决策者关心优化生产模式在任何水平。使用不同的运输车队,以及使用随机优化技术来定义时间窗口,证明了分销网络在降低运营成本方面是如何成功的。原创性/价值本研究根据三梯队供应链的多目标模型,考虑到配送网络的实际限制,以现实的方式填补了路线选择和位置选择之间的联系空白。该模型可以减少车辆在选择加油策略或处理多种交通场景时性能的不确定性,使其更接近确定性。此外,提出了两种改进的MOPSO和NSGA-II算法来求解该模型,并将结果与中小型问题的精确GAMS方法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing a locating-routing three-echelon supply chain network under uncertainty
PurposeIn the present research, location and routing problems, as well as the supply chain, which includes manufacturers, distributor candidate sites and retailers, are explored. The goal of addressing the issue is to reduce delivery times and system costs for retailers so that routing and distributor location may be determined.Design/methodology/approachBy adding certain unique criteria and limits, the issue becomes more realistic. Customers expect simultaneous deliveries and pickups, and retail service start times have soft and hard time windows. Transportation expenses, noncompliance with the soft time window, distributor construction, vehicle purchase or leasing, and manufacturing costs are all part of the system costs. The problem's conceptual model is developed and modeled first, and then General Algebraic Modeling System software (GAMS) and Multiple Objective Particle Swarm Optimization (MOPSO) and non-dominated sorting genetic algorithm II (NSGAII) algorithms are used to solve it in small dimensions.FindingsAccording to the mathematical model's solution, the average error of the two suggested methods, in contrast to the exact answer, is less than 0.7%. In addition, the performance of algorithms in terms of deviation from the GAMS exact solution is pretty satisfactory, with a divergence of 0.4% for the biggest problem (N = 100). As a result, NSGAII is shown to be superior to MOSPSO.Research limitations/implicationsSince this paper deals with two bi-objective models, the priorities of decision-makers in selecting the best solution were not taken into account, and each of the objective functions was given an equal weight based on the weighting procedures. The model has not been compared or studied in both robust and deterministic modes. This is because, with the exception of the variable that indicates traffic mode uncertainty, all variables are deterministic, and the uncertainty character of demand in each level of the supply chain is ignored.Practical implicationsThe suggested model's conclusions are useful for any group of decision-makers concerned with optimizing production patterns at any level. The employment of a diverse fleet of delivery vehicles, as well as the use of stochastic optimization techniques to define the time windows, demonstrates how successful distribution networks are in lowering operational costs.Originality/valueAccording to a multi-objective model in a three-echelon supply chain, this research fills in the gaps in the link between routing and location choices in a realistic manner, taking into account the actual restrictions of a distribution network. The model may reduce the uncertainty in vehicle performance while choosing a refueling strategy or dealing with diverse traffic scenarios, bringing it closer to certainty. In addition, two modified MOPSO and NSGA-II algorithms are presented for solving the model, with the results compared to the exact GAMS approach for medium- and small-sized problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信