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 container´s 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.