A Branch and Price Procedure for the Container Premarshalling Problem

Brink, Martijn van; Zwaan, Ruben van der

doi:10.1007/978-3-662-44777-2_66

Cited by 10 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lee and Hsu [2] proposed an integer programming formulation of the premarshalling problem and, recently, van Brink and van der Zwaan [24] proposed a branch-and-price algorithm. The blocks world problem [25], [26] that has been studied primarily in the artificial intelligence community is quite similar to the premarshalling problem.…”

Section: Literature Reviewmentioning

confidence: 99%

A Faster Branch-and-Bound Algorithm for the Block Relocation Problem

Tanaka

Takii

2016

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

The block relocation problem, which is also known as the container relocation problem, is an optimization problem to find an optimal sequence of operations for retrieving blocks (containers) from a container yard in a given order. The objective function to be minimized is the number of necessary relocations. In this study, we propose an efficient exact algorithm for two variants of the block relocation problem, those with distinct and duplicate retrieval priorities. In the former problem, the retrieval order of blocks is uniquely provided, whereas in the latter problem, it is given only among groups of blocks. The primary contribution of this study is a tighter lower bound of the number of relocations than existing ones. This enables us to construct a faster branch-and-bound algorithm. Its effectiveness is demonstrated by extensive numerical experiments. Note to Practitioners-A container terminal plays an important role in logistics chains by offering a temporary storage location for containers. Containers transported to a container terminal by vessels, trucks, or trains are stored in container yards. They are piled up vertically to form several stacks. A gantry crane is commonly used to move containers in a container yard, which can access only the topmost containers.When the container that we want to retrieve next from the yard is not on the top of a stack, those stacked above it should be relocated to other stacks. The reduction of such undesirable relocation operations is crucial in container operational decisions because the throughput of cranes is one of the key factors that affect the overall efficiency of container terminals. The algorithm proposed in this paper enables us to obtain an optimal relocation plan that minimizes the number of required relocations in a shorter computation time. When the number of stacks is not large, we can solve the problem to optimality without resorting to heuristic or metaheuristic approaches that only search for near-optimal solutions. Index Terms-Block relocation problem, branch-and-bound algorithm, container terminal, lower bound.Manuscript

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Faster Branch-and-Bound Algorithm for the Block Relocation Problem

Tanaka

Takii

2016

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

show abstract

“…In Chapter 3, which is based on Van Brink and Van der Zwaan [78], the Container Premarshalling problem is discussed. For this problem we are given a container yard filled with containers.…”

Section: Container Premarshallingmentioning

confidence: 99%

Essays on practical computational methods for operational planning

Brink

View full text Add to dashboard Cite

People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract