Anticipatory approach for dynamic and stochastic shipment matching in hinterland synchromodal transportation

8Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Guo, W., Atasoy, B., van Blokland, W. B., & Negenborn, R. R. (2022). Anticipatory approach for dynamic and stochastic shipment matching in hinterland synchromodal transportation. Flexible Services and Manufacturing Journal, 34(2), 483–517. https://doi.org/10.1007/s10696-021-09428-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free