Target-guided algorithms for the container pre-marshalling problem

doi:10.1016/j.omega.2014.12.002

Return

Target-guided algorithms for the container pre-marshalling problem

2015-06-01

PRE

Ning Wang

Bo Jin *

Andrew Lim

DOI：10.1016/j.omega.2014.12.002

Original

Original request for help

Save

Abstract

En 中文

The container pre-marshalling problem (CPMP) aims to rearrange containers in a bay with the least movement effort; thus, in the final layout, containers are piled according to a predetermined order. Previous researchers, without exception, assumed that all the stacks in a bay are functionally identical. Such a classical problem setting is reexamined in this paper. Moreover, a new problem, the CPMP with a dummy stack (CPMPDS) is proposed. At terminals with transfer lanes, a bay includes a row of ordinary stacks and a dummy stack. The dummy stack is actually the bay space that is reserved for trucks. Therefore, containers can be shipped out from the bay. During the pre-marshalling process, the dummy stack temporarily stores containers as an ordinary stack. However, the dummy stack must be emptied at the end of pre-marshalling. In this paper, target-guided algorithms are proposed to handle both the classical CPMP and new CPMPDS. All the proposed algorithms guarantee termination. Experimental results in terms of the CPMP show that the proposed algorithms surpass the state-of-the-art algorithm. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Container pre-marshalling problem

Target-guided algorithm

Dummy stack

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.