Solving the container relocation problem by an improved greedy look-ahead heuristic

Bo Jin, Wenbin Zhu, Andrew Lim

Abstract: Highlights•Investigate the container relocation problem, which is a classic problem in container operations in terminals.•Develop a greedy look-ahead heuristic to solve the problem.•Combine a greedy-based framework with a tree search procedure.•Limit the look-ahead tree by the depth and width parameters.•Provide high-quality solutions in a short runtime, especially for large-scale instances.