混合二元蚁群算法求解集装箱装载问题  

Hybrid binary ant colony algorithm for container loading problem

作　　者：袁军良[1] 熊伟清[1] 江宝钏[1] 

机构地区：[1]宁波大学计算机科学与技术研究所,浙江宁波315211

出　　处：《计算机工程与应用》2010年第36期222-225,共4页Computer Engineering and Applications

基　　金：浙江省自然科学基金(No.Y1080364);宁波市自然科学基金项目(No.2009A610079)~~

摘　　要：集装箱装载问题是一个具有复杂约束条件的组合优化问题,属于NP-hard问题。针对集装箱装载问题的特点,设计了空间三叉树,对可利用空间采用三叉树划分策略,利用二元蚁群算法结合启发式算法进行求解,即先利用二元蚁群算法确定预备装入货物集,再用启发式算法决定货物的装入优先级顺序,并给出了有效的装箱算法。实例结果表明该算法的有效性和实用性。Container loading problem with multi-constraints is a complicated combinatorial optimization problem.It’s a NP-hard problem.A trifurcate tree of space is designed according to the trait of this problem and available space is divided by the strategy of trifurcate tree.Binary ant colony algorithm combining heuristics is proposed to solve the container loading problem.First,using binary ant colony algorithm determines the set of preparatory loading goods.Then,using heuristics deter-mines the priority of the goods and an effective bin-packing algorithm is given.Results of the experiment show the feasibili-ty and effectiveness of the proposed algorithm.

关 键 词：集装箱装载 二元蚁群算法 启发式 三叉树 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]