An Integer Linear Programming for Container Stowage Problem

Authors:
Feng Li;Chunhua Tian;Rongzeng Cao;Wei Ding
Affiliations:
IBM China Research Laboratory, Beijing, P.R. China 100094;IBM China Research Laboratory, Beijing, P.R. China 100094;IBM China Research Laboratory, Beijing, P.R. China 100094;IBM China Research Laboratory, Beijing, P.R. China 100094
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 1
Cited 3

A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem

Journal of Heuristics

Optimization of stowage plans for RoRo ships

Computers and Operations Research
Fast generation of near-optimal plans for eco-efficient stowage of large container vessels

ICCL'11 Proceedings of the Second international conference on Computational logistics
An accurate model for seaworthy container vessel stowage planning with ballast tanks

ICCL'12 Proceedings of the Third international conference on Computational Logistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

So far most stowage planning only consider the stowage of single type containers or do not consider the stability of the containership. Here a 0-1 linear programming model for this problem is proposed. The objective is to maximize space utilization while minimize the operation cost from upload and download of different types containers at each port of a multi-port journey, with vessel stability, industry regulations and customized rules as the constraints. Based on experiments by adopting branch & cut algorithm from COIN-OR(Common Optimization Interface for Operations Research) to such model. Successively, a simulation system is developed to verify the feasibility and practicability of the model. By using the branch and cut algorithm of COIN-OR, the simulation system has shown that our model is efficient and robust.