Freight consolidation in intermodal networks with reloads

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
28 Downloads (Pure)

Abstract

Intermodal networks offer much flexibility in transport planning, and have the potential to efficiently consolidate goods, even if these goods have distinct pickup locations and destinations. Typically, there is an abundant amount of feasible routes and consolidation opportunities, which makes it challenging to quickly identify good solutions. We propose a planning algorithm for dynamic pickup- and delivery problems in intermodal networks, where freight is consolidated by means of reloads to reduce both costs and emissions. Based on an enumerative arc-expansion procedure, a large number of intermodal routes is generated for each order, of which we store the k best. We subsequently evaluate consolidation opportunities for the k best routes by applying a decision tree structure, taking into account reload operations, timetables, and synchronization of departure windows. Compared to direct road transport, numerical experiments on various virtual problem instances show an average cost saving of 34 %, and an average reduction in CO 2 emissions of 30 %. Furthermore, we test our algorithm on a real-life case of a leading logistics service provider based in the Netherlands, which yields significant benefits as well, both in terms of costs and environmental impact.
Original languageEnglish
Pages (from-to)452-485
Number of pages34
JournalFlexible services and manufacturing journal
Volume30
Issue number3
Early online date28 Sep 2016
DOIs
Publication statusPublished - Sep 2018

Fingerprint

Consolidation
Pickups
Costs
Planning
Decision trees
Environmental impact
Logistics
Synchronization
Freight
Experiments
Road transport
Average cost
Logistics service providers
Numerical experiment
Cost savings
The Netherlands
Destination
Decision tree
Pickup and delivery

Keywords

  • UT-Hybrid-D

Cite this

@article{5290718e32334250a04ee6bcad80e05a,
title = "Freight consolidation in intermodal networks with reloads",
abstract = "Intermodal networks offer much flexibility in transport planning, and have the potential to efficiently consolidate goods, even if these goods have distinct pickup locations and destinations. Typically, there is an abundant amount of feasible routes and consolidation opportunities, which makes it challenging to quickly identify good solutions. We propose a planning algorithm for dynamic pickup- and delivery problems in intermodal networks, where freight is consolidated by means of reloads to reduce both costs and emissions. Based on an enumerative arc-expansion procedure, a large number of intermodal routes is generated for each order, of which we store the k best. We subsequently evaluate consolidation opportunities for the k best routes by applying a decision tree structure, taking into account reload operations, timetables, and synchronization of departure windows. Compared to direct road transport, numerical experiments on various virtual problem instances show an average cost saving of 34 {\%}, and an average reduction in CO 2 emissions of 30 {\%}. Furthermore, we test our algorithm on a real-life case of a leading logistics service provider based in the Netherlands, which yields significant benefits as well, both in terms of costs and environmental impact.",
keywords = "UT-Hybrid-D",
author = "{van Heeswijk}, W.J.A. and M.R.K. Mes and J.M.J. Schutten and W.H.M. Zijm",
note = "Springer deal",
year = "2018",
month = "9",
doi = "10.1007/s10696-016-9259-1",
language = "English",
volume = "30",
pages = "452--485",
journal = "Flexible services and manufacturing journal",
issn = "1936-6582",
publisher = "Springer",
number = "3",

}

Freight consolidation in intermodal networks with reloads. / van Heeswijk, W.J.A. (Corresponding Author); Mes, M.R.K.; Schutten, J.M.J.; Zijm, W.H.M.

In: Flexible services and manufacturing journal, Vol. 30, No. 3, 09.2018, p. 452-485.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Freight consolidation in intermodal networks with reloads

AU - van Heeswijk, W.J.A.

AU - Mes, M.R.K.

AU - Schutten, J.M.J.

AU - Zijm, W.H.M.

N1 - Springer deal

PY - 2018/9

Y1 - 2018/9

N2 - Intermodal networks offer much flexibility in transport planning, and have the potential to efficiently consolidate goods, even if these goods have distinct pickup locations and destinations. Typically, there is an abundant amount of feasible routes and consolidation opportunities, which makes it challenging to quickly identify good solutions. We propose a planning algorithm for dynamic pickup- and delivery problems in intermodal networks, where freight is consolidated by means of reloads to reduce both costs and emissions. Based on an enumerative arc-expansion procedure, a large number of intermodal routes is generated for each order, of which we store the k best. We subsequently evaluate consolidation opportunities for the k best routes by applying a decision tree structure, taking into account reload operations, timetables, and synchronization of departure windows. Compared to direct road transport, numerical experiments on various virtual problem instances show an average cost saving of 34 %, and an average reduction in CO 2 emissions of 30 %. Furthermore, we test our algorithm on a real-life case of a leading logistics service provider based in the Netherlands, which yields significant benefits as well, both in terms of costs and environmental impact.

AB - Intermodal networks offer much flexibility in transport planning, and have the potential to efficiently consolidate goods, even if these goods have distinct pickup locations and destinations. Typically, there is an abundant amount of feasible routes and consolidation opportunities, which makes it challenging to quickly identify good solutions. We propose a planning algorithm for dynamic pickup- and delivery problems in intermodal networks, where freight is consolidated by means of reloads to reduce both costs and emissions. Based on an enumerative arc-expansion procedure, a large number of intermodal routes is generated for each order, of which we store the k best. We subsequently evaluate consolidation opportunities for the k best routes by applying a decision tree structure, taking into account reload operations, timetables, and synchronization of departure windows. Compared to direct road transport, numerical experiments on various virtual problem instances show an average cost saving of 34 %, and an average reduction in CO 2 emissions of 30 %. Furthermore, we test our algorithm on a real-life case of a leading logistics service provider based in the Netherlands, which yields significant benefits as well, both in terms of costs and environmental impact.

KW - UT-Hybrid-D

U2 - 10.1007/s10696-016-9259-1

DO - 10.1007/s10696-016-9259-1

M3 - Article

VL - 30

SP - 452

EP - 485

JO - Flexible services and manufacturing journal

JF - Flexible services and manufacturing journal

SN - 1936-6582

IS - 3

ER -