Optimizing barge utilization in hinterland container transportation

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

In hinterland container transportation the use of barges is getting more and more important. We propose a real-life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near-optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large-sized instances.

Original languageEnglish
Pages (from-to)253-271
Number of pages19
JournalNaval Research Logistics
Volume66
Issue number3
Early online date5 Apr 2019
DOIs
Publication statusPublished - Apr 2019

Fingerprint

Barges
Integer Program
Container
Linear Program
Containers
Heuristics
Optimal Solution
Assign
Planning
Cost reduction
Costs
Hinterland
Linear program
Container transportation
Integer
Optimal solution
Industry
Model

Keywords

  • heuristic
  • hinterland transportation
  • integer linear programming
  • multimodal transportation

Cite this

@article{a36577560df54ca5937f947b507dbe1a,
title = "Optimizing barge utilization in hinterland container transportation",
abstract = "In hinterland container transportation the use of barges is getting more and more important. We propose a real-life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20{\%}, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near-optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large-sized instances.",
keywords = "heuristic, hinterland transportation, integer linear programming, multimodal transportation",
author = "Zweers, {Bernard G.} and Sandjai Bhulai and {van der Mei}, {Rob D.}",
year = "2019",
month = "4",
doi = "10.1002/nav.21837",
language = "English",
volume = "66",
pages = "253--271",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "John Wiley and Sons Inc.",
number = "3",

}

Optimizing barge utilization in hinterland container transportation. / Zweers, Bernard G.; Bhulai, Sandjai; van der Mei, Rob D.

In: Naval Research Logistics, Vol. 66, No. 3, 04.2019, p. 253-271.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - Optimizing barge utilization in hinterland container transportation

AU - Zweers, Bernard G.

AU - Bhulai, Sandjai

AU - van der Mei, Rob D.

PY - 2019/4

Y1 - 2019/4

N2 - In hinterland container transportation the use of barges is getting more and more important. We propose a real-life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near-optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large-sized instances.

AB - In hinterland container transportation the use of barges is getting more and more important. We propose a real-life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near-optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large-sized instances.

KW - heuristic

KW - hinterland transportation

KW - integer linear programming

KW - multimodal transportation

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

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

U2 - 10.1002/nav.21837

DO - 10.1002/nav.21837

M3 - Article

VL - 66

SP - 253

EP - 271

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 3

ER -