集装箱堆场预倒箱问题的混合优化算法  

Hybrid optimization algorithm for pre-marshalling export containers

作　　者：边展[1] 李娜[1] 李向军[2] 靳志宏[1] 

机构地区：[1]大连海事大学交通运输管理学院,辽宁大连116026 [2]大连海洋大学信息工程学院,辽宁大连116023

出　　处：《控制与决策》2014年第2期373-378,共6页Control and Decision

基　　金：国家自然科学基金项目(71172108);大连市科技计划项目(2012A17GX125);中央高校基本科研业务费专项资金项目(3132013320);高等院校博士点基金项目(20122125110009;20132125120009)

摘　　要：堆场出口箱区通常通过集装箱的预倒箱操作来提高后续装船作业的效率.为此,开发了由邻域搜索算法与整数规划算法组成的两阶段混合算法对预倒箱问题进行优化,第1阶段通过启发式规则压缩末终堆存状态空间,第2阶段通过整数规划算法缩短第1阶段得到的预倒箱序列的长度.两个阶段循环交替进行以快速求得最优的预倒箱序列.借助不同种类仿真算例的实验结果及与现有研究方法下所得结果的对比,验证了混合优化算法的有效性和实用性.Extra re-handles may occur when lifting containers up for loading onto ships. One way to improve loading efficiency is to pre-marshal the containers in such an order that it fits the loading sequence. Therefore, a two-stage algorithm composed of a neighborhood search algorithm and an integer programming model is proposed to develop a pre-marshalling plan to improve the layout of containers in a bay. In the first stage, the final layout state space is compressed by using heuristic rules; in the second stage, the length of pre-marshalling sequence is shortened by integer programming. Two stages execute alternately to get optimal pre-marshalling sequence quickly. Several sets of experimental results demonstrate the effectiveness and practicability of the hybrid optimization algorithm.

关 键 词：集装箱 预倒箱操作 压箱数 邻域搜索算法 整数规划 

分 类 号：U169.62[交通运输工程]