Optimizing the Stowage Planning and Block Relocation Problem in Inland Container Shipping

Abstract

The stowage planning and block relocation problem (SPBRP) consider the relations between stowage planning and block relocation comprehensively, in which the retrieval sequence of containers in yard and the stowage plan of a ship are concerned. In this paper, an integer programming formulation called SPBRP-I is presented for the proposed problem in inland container liner shipping to minimize the total number of relocations in yard and re-handles in ship. To deal with the utilization preference in inland shipping, the minimization of ship stack occupancy number is introduced into SPBRP-I to develop a new model called SPBRP-II. In view of the complexity of problem-solving, a heuristic algorithm (HA) based on priority sorting, retrieval and local search strategies is proposed to achieve the efficient optimization. The algorithm consists of three parts including the yard container retrieving, yard container relocation and ship stowage planning. Finally, the container liner shipping on the Yangtze River is chosen with some typical ships for the case study. Numerical results show that SPBRP-II performs better than the original SPBRP-I, and it's more suitable for solving the small-sized cases. Compared with the models, the algorithm with retrieval strategy RS1 (HA_RS1) can achieve the efficient problem solving with high-quantity solutions and very short computational time.

Keywords

• Inland container shipping
• stowage planning
• block relocation
• integer programming
• heuristic algorithm