Development of a robust multi-objective model for green capacitated location-routing under crisis conditions

IF 1.3 Q4 ENGINEERING, INDUSTRIAL
Sh. Roosta, Seyed Milad Mirnajafizadeh, Hamid Bazargan Harandi
{"title":"Development of a robust multi-objective model for green capacitated location-routing under crisis conditions","authors":"Sh. Roosta, Seyed Milad Mirnajafizadeh, Hamid Bazargan Harandi","doi":"10.5267/j.jpm.2022.10.001","DOIUrl":null,"url":null,"abstract":"Location-Routing Problem (LRP) is a strategic supply chain design problem aimed at meeting customer demands. LRPs involve selecting one or more depot sites from a set of potential locations and determining the best routes to connect them to demand points. With the rising awareness about the environmental impacts of transportation over the past years, the use of green logistics to mitigate these impacts has become increasingly important. To compensate for a gap in the literature, this paper presents a robust bi-objective mixed-integer linear programming (MILP) model for the green capacitated location-routing problem (G-CLRP) with demand uncertainty and the possibility of failure in depots and routes. The final result of this Robust Multi-Objective Model is to set up the depots and select the routes that offer the highest reliability (Maximizing network service) while imposing the lowest cost and environmental pollution. A Nondominated Sorting Genetic Algorithm (NSGA-II) is used to solve the large-sized instances of the modeled problem. The paper also provides a numerical analysis and a sensitivity analysis of the solutions of the model.","PeriodicalId":42333,"journal":{"name":"Journal of Project Management","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Project Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5267/j.jpm.2022.10.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

Location-Routing Problem (LRP) is a strategic supply chain design problem aimed at meeting customer demands. LRPs involve selecting one or more depot sites from a set of potential locations and determining the best routes to connect them to demand points. With the rising awareness about the environmental impacts of transportation over the past years, the use of green logistics to mitigate these impacts has become increasingly important. To compensate for a gap in the literature, this paper presents a robust bi-objective mixed-integer linear programming (MILP) model for the green capacitated location-routing problem (G-CLRP) with demand uncertainty and the possibility of failure in depots and routes. The final result of this Robust Multi-Objective Model is to set up the depots and select the routes that offer the highest reliability (Maximizing network service) while imposing the lowest cost and environmental pollution. A Nondominated Sorting Genetic Algorithm (NSGA-II) is used to solve the large-sized instances of the modeled problem. The paper also provides a numerical analysis and a sensitivity analysis of the solutions of the model.
危机条件下绿色有能力位置路由鲁棒多目标模型的建立
定位路径问题是一个以满足顾客需求为目标的战略性供应链设计问题。lrp包括从一组潜在地点中选择一个或多个仓库地点,并确定将它们连接到需求点的最佳路线。在过去的几年里,随着人们对交通对环境影响的认识不断提高,使用绿色物流来减轻这些影响变得越来越重要。为了弥补文献上的空白,本文提出了一个鲁棒的双目标混合整数线性规划(MILP)模型,用于具有需求不确定性和仓库和路线故障可能性的绿色有能力定位路由问题(G-CLRP)。该鲁棒多目标模型的最终结果是建立仓库并选择提供最高可靠性(最大化网络服务)的路线,同时施加最低的成本和环境污染。采用非支配排序遗传算法(NSGA-II)求解模型问题的大型实例。本文还对模型的解进行了数值分析和灵敏度分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.70
自引率
5.90%
发文量
16
审稿时长
16 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学术官方微信