The liner shipping berth scheduling problem with transit times

Line Blander Reinhardt; Christian E.M.  Plum; David Pisinger; Mikkel M. Sigurd; Guillaume T.P.  Vial

doi:10.1016/j.tre.2015.12.006

The liner shipping berth scheduling problem with transit times

Line Blander Reinhardt, Christian E.M. Plum, David Pisinger, Mikkel M. Sigurd, Guillaume T.P. Vial

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

590 Downloads (Pure)

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
ISSN	1366-5545
DOIs	https://doi.org/10.1016/j.tre.2015.12.006
Publication status	Published - 2016

Keywords

Speed optimization
Linear approximation
Cubic function
Liner shipping
Transit times

Access to Document

10.1016/j.tre.2015.12.006

SchArticleWeekConsAccepted author manuscript, 534 KBLicence: CC BY-NC-ND

OpenUrl availability

Full text

Cite this

@article{fb134dee439640f898ad98971ea5a848,

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 = "Speed optimization, Linear approximation, Cubic function, Liner shipping, Transit times",

author = "Reinhardt, {Line Blander} and Plum, {Christian E.M.} and David Pisinger and Sigurd, {Mikkel M.} and Vial, {Guillaume T.P.}",

year = "2016",

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 Blander

AU - Plum, Christian E.M.

AU - Pisinger, David

AU - Sigurd, Mikkel M.

AU - Vial, Guillaume T.P.

PY - 2016

Y1 - 2016

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 - Speed optimization

KW - Linear approximation

KW - Cubic function

KW - Liner shipping

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 -

The liner shipping berth scheduling problem with transit times

Abstract

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this