The liner shipping berth scheduling problem with transit times

Line Reinhardt; Christian Edinger Munk Plum; David Pisinger; Mikkel Sigurd; Guillaume Vial

doi:10.1016/j.tre.2015.12.006

The liner shipping berth scheduling problem with transit times

Line Reinhardt, Christian Edinger Munk Plum, David Pisinger, Mikkel Sigurd, Guillaume Vial

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

In this paper speed optimization of an existing liner shipping network is solved by adjusting the port berth times. The objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times. To avoid too many changes to the time table, changes of port berth times are only accepted if they lead to savings above a threshold value. Since the fuel consumption of a vessel is a non-linear convex function of the speed, it is approximated by a piecewise linear function. The developed model is solved using exact methods in less than two minutes for large instances. Computational experiments on real-size liner shipping networks are presented showing that fuels savings in the magnitude 2–10% can be obtained. The work has been carried out in collaboration with Maersk Line and the tests instances are confirmed to be representative of real-life networks.

Original language	English
Journal	Transportation Research. Part E: Logistics and Transportation Review
Volume	86
Pages (from-to)	116-128
Number of pages	14
ISSN	1366-5545
DOIs	https://doi.org/10.1016/j.tre.2015.12.006
Publication status	Published - Feb 2016
Externally published	Yes

Link to document

10.1016/j.tre.2015.12.006

Cite this

@article{ea92ddcce174440cb0c4f4fbf93e56f3,

title = "The liner shipping berth scheduling problem with transit times",

abstract = "In this paper speed optimization of an existing liner shipping network is solved by adjusting the port berth times. The objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times. To avoid too many changes to the time table, changes of port berth times are only accepted if they lead to savings above a threshold value. Since the fuel consumption of a vessel is a non-linear convex function of the speed, it is approximated by a piecewise linear function. The developed model is solved using exact methods in less than two minutes for large instances. Computational experiments on real-size liner shipping networks are presented showing that fuels savings in the magnitude 2–10% can be obtained. The work has been carried out in collaboration with Maersk Line and the tests instances are confirmed to be representative of real-life networks.",

keywords = "Cubic function, Linear approximation, Liner shipping, Speed optimization, Transit times",

author = "Line Reinhardt and Plum, {Christian Edinger Munk} and David Pisinger and Mikkel Sigurd and Guillaume Vial",

year = "2016",

month = feb,

doi = "10.1016/j.tre.2015.12.006",

language = "English",

volume = "86",

pages = "116--128",

journal = "Transportation Research. Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Pergamon Press",

}

TY - JOUR

T1 - The liner shipping berth scheduling problem with transit times

AU - Reinhardt, Line

AU - Plum, Christian Edinger Munk

AU - Pisinger, David

AU - Sigurd, Mikkel

AU - Vial, Guillaume

PY - 2016/2

Y1 - 2016/2

N2 - In this paper speed optimization of an existing liner shipping network is solved by adjusting the port berth times. The objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times. To avoid too many changes to the time table, changes of port berth times are only accepted if they lead to savings above a threshold value. Since the fuel consumption of a vessel is a non-linear convex function of the speed, it is approximated by a piecewise linear function. The developed model is solved using exact methods in less than two minutes for large instances. Computational experiments on real-size liner shipping networks are presented showing that fuels savings in the magnitude 2–10% can be obtained. The work has been carried out in collaboration with Maersk Line and the tests instances are confirmed to be representative of real-life networks.

AB - In this paper speed optimization of an existing liner shipping network is solved by adjusting the port berth times. The objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times. To avoid too many changes to the time table, changes of port berth times are only accepted if they lead to savings above a threshold value. Since the fuel consumption of a vessel is a non-linear convex function of the speed, it is approximated by a piecewise linear function. The developed model is solved using exact methods in less than two minutes for large instances. Computational experiments on real-size liner shipping networks are presented showing that fuels savings in the magnitude 2–10% can be obtained. The work has been carried out in collaboration with Maersk Line and the tests instances are confirmed to be representative of real-life networks.

KW - Cubic function

KW - Linear approximation

KW - Liner shipping

KW - Speed optimization

KW - Transit times

U2 - 10.1016/j.tre.2015.12.006

DO - 10.1016/j.tre.2015.12.006

M3 - Journal article

SN - 1366-5545

VL - 86

SP - 116

EP - 128

JO - Transportation Research. Part E: Logistics and Transportation Review

JF - Transportation Research. Part E: Logistics and Transportation Review

ER -