A branch and price procedure for the container premarshalling problem

M. Brink, van, G.R.J. Zwaan, van der

Research output: Book/ReportReportAcademic

11 Citations (Scopus)
59 Downloads (Pure)

Abstract

During the loading phase of a vessel, only the containers that are on top of their stack are directly accessible. If the container that needs to be loaded next is not the top container, extra moves have to be performed, resulting in an increased loading time. One way to resolve this issue is via a procedure called premarshalling. The goal of premarshalling is to reshuffle the containers into a desired lay-out prior to the arrival of the vessel, in the minimum number of moves possible. This paper presents an exact algorithm based on branch and bound, that is evaluated on a large set of instances. The complexity of the premarshalling problem is also considered, and this paper shows that the problem at hand is NP-hard, even in the natural case of stacks with fixed height.
Original languageEnglish
Publishers.n.
Number of pages27
Publication statusPublished - 2014

Publication series

NamearXiv
Volume1406.7107 [cs.DS]

Fingerprint

Containers

Cite this

Brink, van, M., & Zwaan, van der, G. R. J. (2014). A branch and price procedure for the container premarshalling problem. (arXiv; Vol. 1406.7107 [cs.DS]). s.n.
Brink, van, M. ; Zwaan, van der, G.R.J. / A branch and price procedure for the container premarshalling problem. s.n., 2014. 27 p. (arXiv).
@book{0ec1e7ce33fe4b3ea11e7a7a008831b1,
title = "A branch and price procedure for the container premarshalling problem",
abstract = "During the loading phase of a vessel, only the containers that are on top of their stack are directly accessible. If the container that needs to be loaded next is not the top container, extra moves have to be performed, resulting in an increased loading time. One way to resolve this issue is via a procedure called premarshalling. The goal of premarshalling is to reshuffle the containers into a desired lay-out prior to the arrival of the vessel, in the minimum number of moves possible. This paper presents an exact algorithm based on branch and bound, that is evaluated on a large set of instances. The complexity of the premarshalling problem is also considered, and this paper shows that the problem at hand is NP-hard, even in the natural case of stacks with fixed height.",
author = "{Brink, van}, M. and {Zwaan, van der}, G.R.J.",
year = "2014",
language = "English",
series = "arXiv",
publisher = "s.n.",

}

Brink, van, M & Zwaan, van der, GRJ 2014, A branch and price procedure for the container premarshalling problem. arXiv, vol. 1406.7107 [cs.DS], s.n.

A branch and price procedure for the container premarshalling problem. / Brink, van, M.; Zwaan, van der, G.R.J.

s.n., 2014. 27 p. (arXiv; Vol. 1406.7107 [cs.DS]).

Research output: Book/ReportReportAcademic

TY - BOOK

T1 - A branch and price procedure for the container premarshalling problem

AU - Brink, van, M.

AU - Zwaan, van der, G.R.J.

PY - 2014

Y1 - 2014

N2 - During the loading phase of a vessel, only the containers that are on top of their stack are directly accessible. If the container that needs to be loaded next is not the top container, extra moves have to be performed, resulting in an increased loading time. One way to resolve this issue is via a procedure called premarshalling. The goal of premarshalling is to reshuffle the containers into a desired lay-out prior to the arrival of the vessel, in the minimum number of moves possible. This paper presents an exact algorithm based on branch and bound, that is evaluated on a large set of instances. The complexity of the premarshalling problem is also considered, and this paper shows that the problem at hand is NP-hard, even in the natural case of stacks with fixed height.

AB - During the loading phase of a vessel, only the containers that are on top of their stack are directly accessible. If the container that needs to be loaded next is not the top container, extra moves have to be performed, resulting in an increased loading time. One way to resolve this issue is via a procedure called premarshalling. The goal of premarshalling is to reshuffle the containers into a desired lay-out prior to the arrival of the vessel, in the minimum number of moves possible. This paper presents an exact algorithm based on branch and bound, that is evaluated on a large set of instances. The complexity of the premarshalling problem is also considered, and this paper shows that the problem at hand is NP-hard, even in the natural case of stacks with fixed height.

M3 - Report

T3 - arXiv

BT - A branch and price procedure for the container premarshalling problem

PB - s.n.

ER -

Brink, van M, Zwaan, van der GRJ. A branch and price procedure for the container premarshalling problem. s.n., 2014. 27 p. (arXiv).