摘要
针对集装箱装船问题提出了一个整数规划模型.该模型能够解决多类型、多目的地集装箱的装船问题.在实现了最小化倒箱次数、最大化运输船空间利用率的同时还保证了船只在不同负载分布下的稳定性,并能保证结果是全局最优解.实验中使用COIN-OR(Common Optimization Interface for Operations Research)对建立的模型进行求解.结果表明其有效性,从而为合理进行船只配载提供了一个有效的途径.
In this paper, an interger programming is proposed for loading containers on containerships. The model can be used to optimizate multi-type and multi-destination Containers Ship Stowage Problem. the objective is to minimize the container shifts while maximize space utilization, with vessel stability, and the result is global optimal solution. This paper uses COINOR (Common Optimization Interface for Operations Research) to solve the model in experiments; the results prove the efficiency of this model. It also provides an effective method for logical vessel prestowage planning.
出处
《小型微型计算机系统》
CSCD
北大核心
2007年第11期1988-1991,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(60433020)资助
教育部"符号计算与知识工程"重点实验室985工程
计算与软件科学创新平台基金资助
关键词
集装箱装船问题
倒箱
优化问题
COIN
container ship stowage problem
container shift
optimization problem
COIN