面向中国-东盟跨境集装箱运输的多区域卡车调度鲁棒优化

Jie He, Zhiming Fang, Xintong Yan, Yuntao Ye, Hao Zhang, Changjian Zhang
{"title":"面向中国-东盟跨境集装箱运输的多区域卡车调度鲁棒优化","authors":"Jie He,&nbsp;Zhiming Fang,&nbsp;Xintong Yan,&nbsp;Yuntao Ye,&nbsp;Hao Zhang,&nbsp;Changjian Zhang","doi":"10.1016/j.multra.2025.100187","DOIUrl":null,"url":null,"abstract":"<div><div>Container drayage plays an important role in realizing cargo pickup and delivery between container yards and customers. To further describe and optimize the cross-border container drayage between China and the Association of Southeast Asian Nations (ASEAN), this paper studies a multi-regional container drayage problem under travel time uncertainty (MR-CDP-TTU), where multi-regional truck participation and travel time uncertainty are simultaneously considered. We first develop a multi-regional truck scheduling robust optimization model with travel time as the uncertain parameter and the objective of minimizing the total cost. Then, a variable neighborhood tabu search algorithm (VNTSA) is designed by introducing a greedy insertion method to generate the initial solution and structurally combining the tabu search algorithm with the variable neighborhood search algorithm. Finally, comparison and sensitivity analysis is conducted on the cross-border container drayage instances from a China's international logistics company. The results demonstrate that the designed algorithm outperforms in best value, average value, and standard deviation, which indicate that the algorithm can generate quality and stable solutions for the MR-CDP-TTU. Furthermore, the method proposed in this study enables China-ASEAN cross-border logistics to rationally schedule the multi-regional trucks according to their risk attitudes and the maximum deviations of travel time.</div></div>","PeriodicalId":100933,"journal":{"name":"Multimodal Transportation","volume":"4 1","pages":"Article 100187"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust optimization of multi-regional truck scheduling for China-ASEAN cross-border container drayage\",\"authors\":\"Jie He,&nbsp;Zhiming Fang,&nbsp;Xintong Yan,&nbsp;Yuntao Ye,&nbsp;Hao Zhang,&nbsp;Changjian Zhang\",\"doi\":\"10.1016/j.multra.2025.100187\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Container drayage plays an important role in realizing cargo pickup and delivery between container yards and customers. To further describe and optimize the cross-border container drayage between China and the Association of Southeast Asian Nations (ASEAN), this paper studies a multi-regional container drayage problem under travel time uncertainty (MR-CDP-TTU), where multi-regional truck participation and travel time uncertainty are simultaneously considered. We first develop a multi-regional truck scheduling robust optimization model with travel time as the uncertain parameter and the objective of minimizing the total cost. Then, a variable neighborhood tabu search algorithm (VNTSA) is designed by introducing a greedy insertion method to generate the initial solution and structurally combining the tabu search algorithm with the variable neighborhood search algorithm. Finally, comparison and sensitivity analysis is conducted on the cross-border container drayage instances from a China's international logistics company. The results demonstrate that the designed algorithm outperforms in best value, average value, and standard deviation, which indicate that the algorithm can generate quality and stable solutions for the MR-CDP-TTU. Furthermore, the method proposed in this study enables China-ASEAN cross-border logistics to rationally schedule the multi-regional trucks according to their risk attitudes and the maximum deviations of travel time.</div></div>\",\"PeriodicalId\":100933,\"journal\":{\"name\":\"Multimodal Transportation\",\"volume\":\"4 1\",\"pages\":\"Article 100187\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-01-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Multimodal Transportation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2772586325000012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Multimodal Transportation","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772586325000012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

集装箱拖运在实现集装箱堆场与客户之间的货物装卸中起着重要的作用。为了进一步描述和优化中国与东盟之间的跨境集装箱运输,本文研究了考虑旅行时间不确定性(MR-CDP-TTU)的多区域集装箱运输问题,其中同时考虑了多区域卡车参与和旅行时间不确定性。首先建立了以行程时间为不确定参数,以总成本最小为目标的多区域货车调度鲁棒优化模型。然后,引入贪婪插入法生成初始解,将禁忌搜索算法与可变邻域搜索算法在结构上结合,设计了一种可变邻域禁忌搜索算法(VNTSA)。最后,对中国某国际物流公司的跨境集装箱拖运实例进行对比和敏感性分析。结果表明,所设计的算法在最优值、平均值和标准差方面都优于其他算法,表明该算法能够生成高质量、稳定的MR-CDP-TTU解。此外,本文提出的方法使中国-东盟跨境物流能够根据其风险态度和旅行时间的最大偏差,对多区域卡车进行合理调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust optimization of multi-regional truck scheduling for China-ASEAN cross-border container drayage
Container drayage plays an important role in realizing cargo pickup and delivery between container yards and customers. To further describe and optimize the cross-border container drayage between China and the Association of Southeast Asian Nations (ASEAN), this paper studies a multi-regional container drayage problem under travel time uncertainty (MR-CDP-TTU), where multi-regional truck participation and travel time uncertainty are simultaneously considered. We first develop a multi-regional truck scheduling robust optimization model with travel time as the uncertain parameter and the objective of minimizing the total cost. Then, a variable neighborhood tabu search algorithm (VNTSA) is designed by introducing a greedy insertion method to generate the initial solution and structurally combining the tabu search algorithm with the variable neighborhood search algorithm. Finally, comparison and sensitivity analysis is conducted on the cross-border container drayage instances from a China's international logistics company. The results demonstrate that the designed algorithm outperforms in best value, average value, and standard deviation, which indicate that the algorithm can generate quality and stable solutions for the MR-CDP-TTU. Furthermore, the method proposed in this study enables China-ASEAN cross-border logistics to rationally schedule the multi-regional trucks according to their risk attitudes and the maximum deviations of travel time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.10
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信