Optimizing Container Reshuffle Operations in Container Yards Based on Dynamic Programming

Abstract

Based on the multiple phase characteristics of container reshuffle operations, the paper establishes a dynamic programming model according to both the initial stock positions and the picking sequence of containers. Then a directed weight figure is put forward through connecting different states by the order. The paper uses the bi-recursive algorithm, which combines the sequential recursive algorithm with the inverted recursive algorithm, to solve the problem. The optimization of container relocation scheduling is realized by avoiding the second relocation for the same container and minimizing the total relocating time.