Title
A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty
Author
Guo, W. (TU Delft Transport Engineering and Logistics)
Atasoy, B. (TU Delft Transport Engineering and Logistics) ![ORCID 0000-0002-1606-9841 ORCID 0000-0002-1606-9841](/sites/all/themes/tud_repo3/img/icons/orcid_16x16.png)
Beelaerts van Blokland, W.W.A. (TU Delft Transport Engineering and Logistics)
Negenborn, R.R. (TU Delft Transport Engineering and Logistics) ![ORCID 0000-0001-9784-1225 ORCID 0000-0001-9784-1225](/sites/all/themes/tud_repo3/img/icons/orcid_16x16.png)
Contributor
Lalla-Ruiz, Eduardo (editor)
Mes, Martijn (editor)
Voß, Stefan (editor)
Date
2020
Abstract
Global intermodal transportation involves the movement of shipments between inland terminals located in different continents by using ships, barges, trains, trucks, or any combination among them through integrated planning at a network level. One of the challenges faced by global operators is the matching of shipment requests with transport services in an integrated global network. The characteristics of the global intermodal shipment matching problem include acceptance and matching decisions, soft time windows, capacitated services, and transshipments between multimodal services. The objective of the problem is to maximize the total profits which consist of revenues, travel costs, transfer costs, storage costs, delay costs, and carbon tax. Travel time uncertainty has significant effects on the feasibility and profitability of matching plans. However, travel time uncertainty has not been considered in global intermodal transport yet leading to significant delays and infeasible transshipments. To fill in this gap, this paper proposes a chance-constrained programming model in which travel times are assumed stochastic. We conduct numerical experiments to validate the performance of the stochastic model in comparison to a deterministic model and a robust model. The experiment results show that the stochastic model outperforms the benchmarks in total profits.
Subject
Chance-constrained programming
Global intermodal transportation
Shipment matching problem
Travel time uncertainty
To reference this document use:
http://resolver.tudelft.nl/uuid:a5b432ca-769b-4116-8400-d60a89696f6a
DOI
https://doi.org/10.1007/978-3-030-59747-4_36
Publisher
Springer, Cham, Switzerland
Embargo date
2021-03-22
ISBN
978-3-030-59746-7
Source
Computational Logistics: Proceedings of the 11th International Conference, ICCL 2020
Event
11th International Conference on Computational Logistics, ICCL 2020, 2020-09-28 → 2020-09-30, Enschede, Netherlands
Series
Lecture Notes in Computer Science, 0302-9743, 12433
Bibliographical note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Part of collection
Institutional Repository
Document type
conference paper
Rights
© 2020 W. Guo, B. Atasoy, W.W.A. Beelaerts van Blokland, R.R. Negenborn