Guo Wenjing, Atasoy Bilge, van Blokland Wouter Beelaerts, Negenborn Rudy R
Department of Maritime and Transport Technology, Delft University of Technology, Delft, The Netherlands.
Department of Analytics, Operations and Information Technologies, University of Quebec at Montreal and CIRRELT, Montreal, Canada.
Flex Serv Manuf J. 2022;34(2):483-517. doi: 10.1007/s10696-021-09428-5. Epub 2021 Aug 6.
This paper investigates a dynamic and stochastic shipment matching problem faced by network operators in hinterland synchromodal transportation. We consider a platform that receives contractual and spot shipment requests from shippers, and receives multimodal services from carriers. The platform aims to provide optimal matches between shipment requests and multimodal services within a finite horizon under spot request uncertainty. Due to the capacity limitation of multimodal services, the matching decisions made for current requests will affect the ability to make good matches for future requests. To solve the problem, this paper proposes an anticipatory approach which consists of a rolling horizon framework that handles dynamic events, a sample average approximation method that addresses uncertainties, and a progressive hedging algorithm that generates solutions at each decision epoch. Compared with the greedy approach which is commonly used in practice, the anticipatory approach has total cost savings up to 8.18% under realistic instances. The experimental results highlight the benefits of incorporating stochastic information in dynamic decision making processes of the synchromodal matching system.
本文研究了内陆同步多式联运中网络运营商面临的动态随机货物匹配问题。我们考虑一个平台，该平台接收来自托运人的合同和现货货物请求，并接收来自承运人的多式联运服务。该平台旨在在现货请求不确定的情况下，在有限的时间范围内提供货物请求与多式联运服务之间的最优匹配。由于多式联运服务的能力限制，为当前请求做出的匹配决策将影响为未来请求做出良好匹配的能力。为了解决该问题，本文提出了一种预期方法，该方法由处理动态事件的滚动时域框架、解决不确定性的样本平均近似方法以及在每个决策时刻生成解决方案的渐进套期保值算法组成。与实际中常用的贪婪方法相比，在实际实例下，预期方法的总成本节省高达8.18%。实验结果突出了在同步多式联运匹配系统的动态决策过程中纳入随机信息的好处。
