摘要
提出了堆场翻箱问题的整数规划模型。对已知的初始堆码状态,在同一个贝位内翻箱,使其最终堆码状态满足积载计划规定的装船次序,目标是使翻箱次数最少。实验结果表明,该模型求解速度快,解的质量高。
An integer programming model for container re-handling problem is proposed. For a given initial stacking state, by re-handling in the same bay, the final state can satisfy the planned loading sequence, and reach the goal of minimizing the times of container re-handling. The experiment result shows that this model can obtain a good solution quickly.
出处
《水运工程》
北大核心
2008年第4期57-61,共5页
Port & Waterway Engineering
基金
上海振华港机项目:高效智能型立体装卸集装箱码头核心技术开发与应用
关键词
整数规划
翻箱
网络流
优化
integer programming
container re-handling
network flow
optimization
