Two-stage search algorithm for the inbound container unloading and stacking problem

This study focuses on the inbound container unloading and stacking problem at container terminals and achieves both a reasonable unloading sequence and the optimal yard stacking distribution. A formulation is proposed as the relational expression between the expected number of rehandles and the stacking height. Based on the formulation, an integer programming model is established to both find the optimal stacking distribution and unloading sequence and attempt to minimize the expected number of rehandles. The model can be solved by the commercial solver for small-scale instances. To solve for large-scale instances in the real world, a two-stage search algorithm is designed, therein incorporating an initial stage for generating the feasible solution and a neighborhood search stage for finding the optimal solution. The algorithm can find an optimal solution in polynomial time, which is proved by theoretical methods and evidenced by numerical experiments. (C) 2019 Elsevier Inc. All rights reserved.