By Topic

Ant colony optimization algorithm based on space division for container loading problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li Wang ; Sch. of Inf. & Electron. Eng., Univ. of Sci. & Technol. Liaoning, Anshan, China ; Hui Zhang ; Yan Xiong ; Dawei Li

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.

Published in:

Control and Decision Conference (CCDC), 2010 Chinese

Date of Conference:

26-28 May 2010