Time filter

Source Type

Tang L.,Liaoning Key Laboratory of Manufacturing System and LogisticsNortheastern UniversityShenyangChina | Yang F.,Liaoning Key Laboratory of Manufacturing System and LogisticsNortheastern UniversityShenyangChina | Li F.,Liaoning Key Laboratory of Manufacturing System and LogisticsNortheastern UniversityShenyangChina | Li K.,Liaoning Key Laboratory of Manufacturing System and LogisticsNortheastern UniversityShenyangChina
Naval Research Logistics | Year: 2015

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model-based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc.

Loading Liaoning Key Laboratory of Manufacturing System and LogisticsNortheastern UniversityShenyangChina collaborators
Loading Liaoning Key Laboratory of Manufacturing System and LogisticsNortheastern UniversityShenyangChina collaborators