Paper Info
Title
An Integer Linear Programming for Container Stowage Problem
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.
Year
DOI
Venue
2008
10.1007/978-3-540-69384-0_90
ICCS (1)
Keywords
Field
DocType
operations research,cut algorithm,linear programming model,simulation system,customized rule,different types container,common optimization interface,stowage planning,vessel stability,industry regulation,container stowage problem,integer linear programming,linear program,integer programming,branch and cut
Mathematical optimization,Simulation system,Computer science,Upload,Branch and cut,Branch and price,Integer programming,Linear programming,Stowage
Conference
Volume
ISSN
Citations 
5101
0302-9743
10
PageRank 
References 
Authors
0.74
5
4
Name
Order
Citations
PageRank
Feng Li1214.47
Chunhua Tian27416.63
Rongzeng Cao35510.61
Wei Ding4417.58