The container relocation problem is a challenging combinatorial optimisation problem
tasked with finding a sequence of container relocations required to retrieve all containers by …

In many container terminals, containers are piled vertically and horizontally in the terminal
yard, limited mainly by the dimensions of the yard crane. Import and export containers are …

The enormous amount of containers handled at ports hampers the efficiency of terminal
operations. The optimization of crane movements is crucial for speeding up the loading and …

The container relocation problem, also known as the block (s) relocation problem, is one of
the most studied optimization problems in container terminals. The problem aims at …

Problems of stacking items or goods occur in a plenty of applications, such as container
terminals, warehouses, and steel plants. A lot of research has been done in this area in …

The container relocation problem (CRP) is an NP-hard combinatorial optimisation problem
that arises in yard management. The problem is concerned with loading all containers from …

The pre-marshalling problem has been extensively studied in recent years with the aim of
minimizing the number of movements needed to rearrange a bay of containers. Time is a …

We consider the block relocation problem (BRP), a combinatorial optimization problem that
may arise in storage systems where items are organized in stacks. The objective is to …

In container terminals, containers are often moved to other stacks in order to access
containers that need to leave the terminal earlier. We propose a new optimization model in …

This paper proposes a family of Markov models to analytically characterize the distribution of
the number of relocations per retrieval in a container depot. We focus on empty container …