A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty

Wenjing Guo; Bilge Atasoy; Wouter Beelaerts van Blokland; Rudy R. Negenborn

doi:10.1007/978-3-030-59747-4_36

A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty

Wenjing Guo^*, Bilge Atasoy, Wouter Beelaerts van Blokland, Rudy R. Negenborn

^*Corresponding author for this work

Transport Engineering and Logistics

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

6 Citations (Scopus)

33 Downloads (Pure)

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.

Original language	English
Title of host publication	Computational Logistics
Subtitle of host publication	Proceedings of the 11th International Conference, ICCL 2020
Editors	Eduardo Lalla-Ruiz, Martijn Mes, Stefan Voß
Place of Publication	Cham, Switzerland
Publisher	Springer
Pages	553-568
ISBN (Electronic)	978-3-030-59747-4
ISBN (Print)	978-3-030-59746-7
DOIs	https://doi.org/10.1007/978-3-030-59747-4_36
Publication status	Published - 2020
Event	11th International Conference on Computational Logistics, ICCL 2020 - Enschede, Netherlands Duration: 28 Sept 2020 → 30 Sept 2020

Publication series

Name	Lecture Notes in Computer Science
Volume	12433
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th International Conference on Computational Logistics, ICCL 2020
Country/Territory	Netherlands
City	Enschede
Period	28/09/20 → 30/09/20

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.

Keywords

Chance-constrained programming
Global intermodal transportation
Shipment matching problem
Travel time uncertainty

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-3-030-59747-4_36

Guo2020_Chapter_AGlobalIntermodalShipmentMatchFinal published version, 1.68 MB

Cite this

Guo, W., Atasoy, B., Beelaerts van Blokland, W., & Negenborn, R. R. (2020). A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty. In E. Lalla-Ruiz, M. Mes, & S. Voß (Eds.), Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020 (pp. 553-568). (Lecture Notes in Computer Science; Vol. 12433). Springer. https://doi.org/10.1007/978-3-030-59747-4_36

Guo, Wenjing ; Atasoy, Bilge ; Beelaerts van Blokland, Wouter et al. / A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty. Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. editor / Eduardo Lalla-Ruiz ; Martijn Mes ; Stefan Voß. Cham, Switzerland : Springer, 2020. pp. 553-568 (Lecture Notes in Computer Science).

@inproceedings{a5b432ca769b41168400d60a89696f6a,

title = "A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty",

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.",

keywords = "Chance-constrained programming, Global intermodal transportation, Shipment matching problem, Travel time uncertainty",

author = "Wenjing Guo and Bilge Atasoy and {Beelaerts van Blokland}, Wouter and Negenborn, {Rudy R.}",

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.; 11th International Conference on Computational Logistics, ICCL 2020 ; Conference date: 28-09-2020 Through 30-09-2020",

year = "2020",

doi = "10.1007/978-3-030-59747-4_36",

language = "English",

isbn = "978-3-030-59746-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "553--568",

editor = "Eduardo Lalla-Ruiz and Martijn Mes and Stefan Vo{\ss}",

booktitle = "Computational Logistics",

}

Guo, W, Atasoy, B , Beelaerts van Blokland, W & Negenborn, RR 2020, A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty. in E Lalla-Ruiz, M Mes & S Voß (eds), Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. Lecture Notes in Computer Science, vol. 12433, Springer, Cham, Switzerland, pp. 553-568, 11th International Conference on Computational Logistics, ICCL 2020, Enschede, Netherlands, 28/09/20. https://doi.org/10.1007/978-3-030-59747-4_36

A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty. / Guo, Wenjing; Atasoy, Bilge ; Beelaerts van Blokland, Wouter et al.
Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. ed. / Eduardo Lalla-Ruiz; Martijn Mes; Stefan Voß. Cham, Switzerland: Springer, 2020. p. 553-568 (Lecture Notes in Computer Science; Vol. 12433).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty

AU - Guo, Wenjing

AU - Atasoy, Bilge

AU - Beelaerts van Blokland, Wouter

AU - Negenborn, Rudy R.

N1 - 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.

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - Chance-constrained programming

KW - Global intermodal transportation

KW - Shipment matching problem

KW - Travel time uncertainty

UR - http://www.scopus.com/inward/record.url?scp=85092234044&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-59747-4_36

DO - 10.1007/978-3-030-59747-4_36

M3 - Conference contribution

AN - SCOPUS:85092234044

SN - 978-3-030-59746-7

T3 - Lecture Notes in Computer Science

SP - 553

EP - 568

BT - Computational Logistics

A2 - Lalla-Ruiz, Eduardo

A2 - Mes, Martijn

A2 - Voß, Stefan

PB - Springer

CY - Cham, Switzerland

T2 - 11th International Conference on Computational Logistics, ICCL 2020

Y2 - 28 September 2020 through 30 September 2020

ER -

Guo W, Atasoy B , Beelaerts van Blokland W , Negenborn RR. A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty. In Lalla-Ruiz E, Mes M, Voß S, editors, Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. Cham, Switzerland: Springer. 2020. p. 553-568. (Lecture Notes in Computer Science). doi: 10.1007/978-3-030-59747-4_36

A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty

Abstract

Publication series

Conference

Bibliographical note

Keywords

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this