山东农业大学学报（自然科学版）Issue(3)：366-371,6.DOI:10.3969/j.issn.1000-2324.2014.03.009
基于最大最小蚁群算法的智能装载方法
Intelligent Loading Methods Based on Max-min Ant Colony Algorithm
摘要
Abstract
Three dimensional container loading problem in real life has a wide range of applications, and it is a combination of complex constrained optimization problems belong to NP-hard in the theory. For the greedy algorithm usually to get a local optimal solution and the basic ant colony algorithm deficiencies and other issues. Firstly this paper gave a Heuristics boxing rules, and then combined the max-min ant colony optimization algorithm to optimize the loading sequence and proposed to solve a three-dimensional hybrid ant colony algorithm for bin packing problem. Finally validated by experiments comparing the effectiveness and superiority of the algorithm, and gave a figure of three-dimensional demonstration.关键词
三维装箱/启发式/最大最小蚁群算法Key words
Three dimensional container loading problem/heuristics/max-min ant colony algorithm分类
信息技术与安全科学引用本文复制引用
葛玮,徐卫红,程海水..基于最大最小蚁群算法的智能装载方法[J].山东农业大学学报（自然科学版）,2014,(3):366-371,6.基金项目
江西省教育厅发展规划课题(JXJG-13-71-4) （JXJG-13-71-4）
