Ant Colony Optimization Algorithm Based on Space Division for Container Loading Problem

摘要：

This paper studies container loading optimization problem. This problem is a subset of rectangular boxes loaded into a rectangular container with fixed dimensions such that maximize containers utilization ratio. A mathematical model is given. Some principles which include space division, space merger, residual subspace omitted and loading rule are presented. A hybrid algorithm which integrate ant colony optimization algorithm with above principles is used to solve the container loading problem. The simulation results show that the model and the algorithm are effective.

关键词： Container Loading Problem Ant Colony Optimization Algorithm Space Utilization Space Division

作者: Li Wang Hui Zhang Yan Xiong Dawei Li

作者单位: School of Information and Electronic Engineering, University of Science and Technology Liaoning, Ans School of Science, University of Science and Technology Liaoning, Anshan, 114051, China

会议类型: 国际会议

会议名称: The 22nd China Control and Decision Conference(2010年中国控制与决策会议)

会议地点: 徐州

会议语种:英文

页码: 3448-3451

在线出版日期: 2010-05-26（万方平台首次上网日期，不代表论文的发表时间）