用于集装箱配装问题的Memetic算法.pdfVIP

25 3 2006 6 Vol.25 No.3 Journal of Liaoning Technical University Jun. 2006 文章编号 1008-0562(2006)03-0450-03 用于集装箱配装问题的Memetic 算法 1,2 1 1 1 大连海事大学 交通工程与物流学院 辽宁 大连 大连轻工业学院 管理与社会科学学院 辽宁 大连 1. , 116024; 2. , 116034 摘 要 针对集装箱配装问题这一NP-hard 问题 提出了用于求解背包式强异类货箱的集装箱配装问题的memetic 算法 该算法 采用了“WB+DBL” 的解码方式 并结合了常规遗传算法的广度搜索能力和局部搜索的深度搜索能力 能够有效地提高集装箱配装问 题的求解质量 通过仿真实验 表明该算法是有效的 关键词 集装箱配装 组合优化 memetic 算法 中图分类号 F 253.4 文献标识码 A Memetic algorithm for container loading problem LI Qing1,2 ZHONG Ming1 LI Zhen-fu1 LIU Zhao-jian1 (1. College of Transportation Engineering and Logistics, Dalian Maritime University, Dalian 116024,China; 2. College of management and Social Science, Dalian Institute of Light Industry, Dalian 116034, China) Abstract The container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions so that the volume of the packed boxes is maximized. The problem is known to be NP-hard. This paper presents a memetic algorithm for the container loading problem with boxes of different sizes. The “Wall Building” heuristic and the “Deepest Bottom Left” heuristic are used in decoding schema of the proposed algorithm. And the combination of genetic evolutionary and local search helps to improve the quality of the solutions. Simulation shows the effectiveness of the proposed algorithm. Key words container loading combinatorial optimization memetic algorithm 部搜索的深度搜