在集装箱供应不确定的情况下优化双层列车的装载

IF 8.8 1区 工程技术 Q1 ECONOMICS
ManWo Ng , Yu-Chi Lee , Dung-Ying Lin
{"title":"在集装箱供应不确定的情况下优化双层列车的装载","authors":"ManWo Ng ,&nbsp;Yu-Chi Lee ,&nbsp;Dung-Ying Lin","doi":"10.1016/j.tre.2025.104016","DOIUrl":null,"url":null,"abstract":"<div><div>This paper contributes to the literature on the operations management of double stack trains by introducing a new, real-world research problem that arises when loading trains at marine container terminals with on-dock rail service. Specifically, in this research we model the reality that containers that need to be loaded on railcars can be unavailable at the time of loading, while optimizing the assignment of railcars to hubs and trains, and containers to railcars. To this end, we propose a two stage stochastic program that aims to minimize the number of well cars used when container availability is uncertain (first stage) while also maximizing their space utilization when taking corrective actions (second stage). For its solution, a tailored integer L-shaped solution method is presented. Algorithmic performance and managerial insights are highlighted in a series of numerical experiments. Findings include: 1) The proposed L-shaped method is superior compared to a state-of-the-art commercial solver (up to 5 times faster in our experiments). 2) It is beneficial for the rail manager to prioritize making available 40-foot containers versus 20-foot containers. 3) The higher the probability of container availability in the second stage, the more well cars should be made available in the first stage.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104016"},"PeriodicalIF":8.8000,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing the loading of double stack trains under uncertain container availability\",\"authors\":\"ManWo Ng ,&nbsp;Yu-Chi Lee ,&nbsp;Dung-Ying Lin\",\"doi\":\"10.1016/j.tre.2025.104016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper contributes to the literature on the operations management of double stack trains by introducing a new, real-world research problem that arises when loading trains at marine container terminals with on-dock rail service. Specifically, in this research we model the reality that containers that need to be loaded on railcars can be unavailable at the time of loading, while optimizing the assignment of railcars to hubs and trains, and containers to railcars. To this end, we propose a two stage stochastic program that aims to minimize the number of well cars used when container availability is uncertain (first stage) while also maximizing their space utilization when taking corrective actions (second stage). For its solution, a tailored integer L-shaped solution method is presented. Algorithmic performance and managerial insights are highlighted in a series of numerical experiments. Findings include: 1) The proposed L-shaped method is superior compared to a state-of-the-art commercial solver (up to 5 times faster in our experiments). 2) It is beneficial for the rail manager to prioritize making available 40-foot containers versus 20-foot containers. 3) The higher the probability of container availability in the second stage, the more well cars should be made available in the first stage.</div></div>\",\"PeriodicalId\":49418,\"journal\":{\"name\":\"Transportation Research Part E-Logistics and Transportation Review\",\"volume\":\"196 \",\"pages\":\"Article 104016\"},\"PeriodicalIF\":8.8000,\"publicationDate\":\"2025-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part E-Logistics and Transportation Review\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1366554525000572\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part E-Logistics and Transportation Review","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1366554525000572","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

本文通过引入具有码头铁路服务的海运集装箱码头装载列车时出现的一个新的、现实世界的研究问题,对双栈列车的运行管理文献做出了贡献。具体来说,在本研究中,我们模拟了需要装载在轨道车辆上的集装箱在装载时可能不可用的现实,同时优化了轨道车辆到枢纽和火车的分配,以及集装箱到轨道车辆的分配。为此,我们提出了一个两阶段的随机方案,旨在最大限度地减少集装箱可用性不确定时(第一阶段)使用的井车数量,同时在采取纠正措施时(第二阶段)最大化其空间利用率。针对其求解,提出了一种量身定制的整数l型求解方法。在一系列数值实验中强调了算法性能和管理见解。研究结果包括:1)与最先进的商业求解器相比,所提出的l形方法优越(在我们的实验中快了5倍)。2)对于铁路管理者来说,优先提供40英尺的集装箱而不是20英尺的集装箱是有益的。3)第二阶段集装箱可用概率越高,第一阶段应提供的井车越多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimizing the loading of double stack trains under uncertain container availability
This paper contributes to the literature on the operations management of double stack trains by introducing a new, real-world research problem that arises when loading trains at marine container terminals with on-dock rail service. Specifically, in this research we model the reality that containers that need to be loaded on railcars can be unavailable at the time of loading, while optimizing the assignment of railcars to hubs and trains, and containers to railcars. To this end, we propose a two stage stochastic program that aims to minimize the number of well cars used when container availability is uncertain (first stage) while also maximizing their space utilization when taking corrective actions (second stage). For its solution, a tailored integer L-shaped solution method is presented. Algorithmic performance and managerial insights are highlighted in a series of numerical experiments. Findings include: 1) The proposed L-shaped method is superior compared to a state-of-the-art commercial solver (up to 5 times faster in our experiments). 2) It is beneficial for the rail manager to prioritize making available 40-foot containers versus 20-foot containers. 3) The higher the probability of container availability in the second stage, the more well cars should be made available in the first stage.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
16.20
自引率
16.00%
发文量
285
审稿时长
62 days
期刊介绍: Transportation Research Part E: Logistics and Transportation Review is a reputable journal that publishes high-quality articles covering a wide range of topics in the field of logistics and transportation research. The journal welcomes submissions on various subjects, including transport economics, transport infrastructure and investment appraisal, evaluation of public policies related to transportation, empirical and analytical studies of logistics management practices and performance, logistics and operations models, and logistics and supply chain management. Part E aims to provide informative and well-researched articles that contribute to the understanding and advancement of the field. The content of the journal is complementary to other prestigious journals in transportation research, such as Transportation Research Part A: Policy and Practice, Part B: Methodological, Part C: Emerging Technologies, Part D: Transport and Environment, and Part F: Traffic Psychology and Behaviour. Together, these journals form a comprehensive and cohesive reference for current research in transportation science.
×
引用
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学术官方微信