计算机工程与应用Issue(7)：252-257,6.DOI:10.3778/j.issn.1002-8331.1108-0361
求解强异类集装箱装载问题的混合蚁群算法
Hybrid binary ant colony algorithm for strongly heterogeneous container loading problem
摘要
Abstract
Aiming at the strongly heterogeneous Container Loading Problem(CLP), a mixed Ant Colony Algorithm(ACO)is designed. The solution of problem is divided in two parts, the priority of the goods and the goods’state. Based on heuristic rules, the larger goods have priority to pack in container, so volume is considered as heuristic information. The sequence that ant has searched crosses with historical optimal sequence. The optimal one among the three sequences is choose as the wanted sequence. In order to avoid pheromone over-rapid saturated, pheromone is updated by adopting two volatile coefficients. The complexity of the algorithm is analyzed. Through testing three examples, the space utilization is high by using this algorithm.关键词
集装箱装载/蚁群优化算法/启发式规则/整数规划Key words
Container Loading Problem(CLP)/Ant Colony Algorithm(ACO)/heuristic rules/integer programming分类
信息技术与安全科学引用本文复制引用
魏平,熊伟清..求解强异类集装箱装载问题的混合蚁群算法[J].计算机工程与应用,2013,(7):252-257,6.基金项目
浙江省自然科学基金(No.Y1100052) （No.Y1100052）
浙江省教育厅科研项目(No.Y201017000) （No.Y201017000）
