Corpus ID: 236469458

Automated Design of Heuristics for the Container Relocation Problem

  title={Automated Design of Heuristics for the Container Relocation Problem},
  author={Mrko DJurasevi'c and Mateja DJumi'c},
The container relocation problem is a challenging combinatorial optimisation problem tasked with finding a sequence of container relocations required to retrieve all containers by a given order. Due to the complexity of this problem, heuristic methods are often applied to obtain acceptable solutions in a small amount of time. These include relocation rules (RRs) that determine the relocation moves that need to be performed to efficiently retrieve the next container based on certain yard… Expand


This paper focuses on the two-dimensional, static, offline and restricted CRP of real-world yard container bays and applies Genetic Algorithm to find the best sequence of container retrievals according to these four rules in order to minimize the number of relocations within the bay. Expand
G-CREM: A GRASP approach to solve the container relocation problem for multibays
A myopic function specially designed to produce feasible candidate solutions with a structure that allows a local search procedure to optimize relocations is used to solve the Container Relocation Problem for multiple bays. Expand
A chain heuristic for the Blocks Relocation Problem
A new heuristic approach is proposed in which when deciding where to relocate a block the authors also take into account the properties of the block that will be moved next, which is illustrated by improving the Min–Max heuristic for the BRP. Expand
Container relocation problem with time windows for container departure
A stochastic dynamic programming model is proposed to calculate the minimum expected number of reshuffles for a stack of containers which all have departure time windows and a heuristic called the expected reshuffling index (ERI) is developed and evaluated. Expand
Container Relocation Problem: Approximation, Asymptotic, and Incomplete Information
This paper combines the A* algorithm with sampling technique to solve this two-stage stochastic optimization problem of the Container Relocation Problem, and shows that the algorithm is fast and the error due to sampling and pruning is reasonably small. Expand
A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan
A two step greedy algorithm for the BRLP that uses a heuristic approach to recognize undesirable properties of a solution and remove them and is extended towards the GRASP metaheuristic. Expand
A mathematical formulation and complexity considerations for the blocks relocation problem
This paper first proves NP-hardness of the BRP as well as a special case, closing open research questions, and proposes a simple heuristic based upon a set of relocation rules that is used to generate “good” quality solutions for larger instances in very short computational time. Expand
A tree search procedure for the container relocation problem
A heuristic tree search procedure for the container relocation problem (CRP) that is compared to all known solution approaches for the CRP and turns out to be very competitive. Expand
The container retrieval problem with respect to relocation
Abstract The demand for container terminal yards is growing significantly faster than the supply of available land; therefore, containers are typically stacked high to better utilize the land spaceExpand
A heuristic for retrieving containers from a yard
A three-phase heuristic to solve for an optimized working plan for a crane to retrieve all the containers from a given yard according to a given order and the number of movements approaches the lower bound in most cases. Expand