By Topic

Hybrid ant colony optimization based on Genetic Algorithm 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

2 Author(s)
Dezhen Zhang ; Coll. of Comput. Sci. & Technol., Dalian Maritime Univ., Dalian, China ; Lining Du

A hybrid ant colony optimization based on Genetic Algorithm (GA) is applied to solving complex packing problem in the paper. Firstly, it searches for a set of rough solutions with the random search ability and the rapid global convergence of GA. Then, this set of solutions are used as the initial input of Ant Colony Optimization(ACO), using the positive feedback mechanism, the parallelism and the high efficiency of ACO to find the optimal solution of container loading problem. Finally, a design example is given in which 700 pieces of goods are loaded into a 40-foot container. The experimental results show that the hybrid algorithm can enhance the utilization of the container and it improves the performance of ACO and GA.

Published in:

Soft Computing and Pattern Recognition (SoCPaR), 2011 International Conference of

Date of Conference:

14-16 Oct. 2011