Optimization of Container Relocation Problem with a Stowage Plan

For a container terminal, the efficiency of container relocation directly affects its operating cost. In this paper, we discuss the restricted Container Relocation Problem with a Stowage Plan (CRPSP). Due to stowage plans, sequences of container retrieval are partially ordered, which are different from fully ordered sequences in traditional CRPs. We first establish two integer programming models. To the best of our knowledge, we are the first to design IP models for restricted CRPSP. Then we design a rule-based greedy algorithm and two look-ahead greedy algorithms. In the experiments, we compare the two proposed IP models. We also compare the performance of three proposed algorithms to that of one existing algorithm on a benchmark data set.