Solving the Container Stowage Problem (CSP) using Particle Swarm Optimization (PSO)

International Conference on Industrial and Systems Engineering 2017

Matsaini^1 ; Santosa, Budi^1

Department of Industrial Engineering, Institut Teknologi Sepuluh Nopember, Kampus ITS, Sukolilo-Surabaya

60111, Indonesia^1

关键词: Combinatorial problem;    Container stowages;    Enumeration techniques;    Meta heuristics;    Swarm optimization;    Time gap;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/337/1/012002/pdf
DOI  :  10.1088/1757-899X/337/1/012002

来源: IOP

【 摘 要 】

Container Stowage Problem (CSP) is a problem of containers arrangement into ships by considering rules such as: total weight, weight of one stack, destination, equilibrium, and placement of containers on vessel. Container stowage problem is combinatorial problem and hard to solve with enumeration technique. It is an NP-Hard Problem. Therefore, to find a solution, metaheuristics is preferred. The objective of solving the problem is to minimize the amount of shifting such that the unloading time is minimized. Particle Swarm Optimization (PSO) is proposed to solve the problem. The implementation of PSO is combined with some steps which are stack position change rules, stack changes based on destination, and stack changes based on the weight type of the stacks (light, medium, and heavy). The proposed method was applied on five different cases. The results were compared to Bee Swarm Optimization (BSO) and heuristics method. PSO provided mean of 0.87% gap and time gap of 60 second. While BSO provided mean of 2,98% gap and 459,6 second to the heuristcs.