Optimization for bi-objective express transportation network design under multiple topological structures

IF 1.6 3区 工程技术 Q4 ENGINEERING, INDUSTRIAL
Jian Zhong, Xu Wang, Longxiao Li, Sergio García
{"title":"Optimization for bi-objective express transportation network design under multiple topological structures","authors":"Jian Zhong, Xu Wang, Longxiao Li, Sergio García","doi":"10.5267/j.ijiec.2023.2.003","DOIUrl":null,"url":null,"abstract":"With the rapid development of the courier industry, customers are placing higher demands on the cost and delivery time of courier services. Therefore, this paper focuses on the bi-objective express transportation network design problem (BO-ETNDP) to minimize the operation cost and maximum arrival time. A multi-structure parallel design methodology (MS-PDM) is proposed to solve the BO-ETNDP. In this methodology, all topological structures commonly used in designing transportation networks are sorted out. For each topological structure, a novel bi-objective nonlinear mixed-integer optimization model for BO-ETNDP is developed considering the impact of the hub’s sorting efficiency on the operation cost and arrival time. To solve these models, a preference-based multi-objective algorithm (PB-MOA) is devised, which embeds the branch-and-cut algorithm and Pareto dominance theory in the framework of this ranking algorithm. In the case study, the applicability of the proposed methodology is verified in a real-world leading express company. The results show that our methodology can effectively avoid the limitation of solving the BO-ETNDP with a specific structure. Besides, the suitable topology for designing express transportation networks in different scenarios are explored through the sensitivity analysis.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"53 1","pages":"0"},"PeriodicalIF":1.6000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Industrial Engineering Computations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5267/j.ijiec.2023.2.003","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 1

Abstract

With the rapid development of the courier industry, customers are placing higher demands on the cost and delivery time of courier services. Therefore, this paper focuses on the bi-objective express transportation network design problem (BO-ETNDP) to minimize the operation cost and maximum arrival time. A multi-structure parallel design methodology (MS-PDM) is proposed to solve the BO-ETNDP. In this methodology, all topological structures commonly used in designing transportation networks are sorted out. For each topological structure, a novel bi-objective nonlinear mixed-integer optimization model for BO-ETNDP is developed considering the impact of the hub’s sorting efficiency on the operation cost and arrival time. To solve these models, a preference-based multi-objective algorithm (PB-MOA) is devised, which embeds the branch-and-cut algorithm and Pareto dominance theory in the framework of this ranking algorithm. In the case study, the applicability of the proposed methodology is verified in a real-world leading express company. The results show that our methodology can effectively avoid the limitation of solving the BO-ETNDP with a specific structure. Besides, the suitable topology for designing express transportation networks in different scenarios are explored through the sensitivity analysis.
多拓扑结构下双目标快递网络优化设计
随着快递行业的快速发展,客户对快递服务的成本和送达时间提出了更高的要求。因此,本文主要研究以最小化运营成本和最大到达时间为目标的双目标快递运输网络设计问题(BO-ETNDP)。提出了一种多结构并行设计方法(MS-PDM)来解决BO-ETNDP问题。在该方法中,对交通网络设计中常用的所有拓扑结构进行了分类。针对每一种拓扑结构,考虑集线器分拣效率对运行成本和到达时间的影响,建立了BO-ETNDP的双目标非线性混合整数优化模型。为了求解这些模型,设计了一种基于偏好的多目标算法(PB-MOA),该算法将分支切断算法和帕累托优势理论嵌入到排序算法的框架中。在案例研究中,所提出的方法的适用性在现实世界中领先的快递公司进行了验证。结果表明,该方法可以有效地避免用特定结构求解BO-ETNDP的局限性。此外,通过灵敏度分析,探讨了不同场景下适合快递网络设计的拓扑结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.70
自引率
9.10%
发文量
35
审稿时长
20 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学术官方微信