Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Study on improved ant colony optimization for bin-packing 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)
Suxin Wang ; Northeastern Univ. at Qinhuangdao, Qinhuangdao, China ; Leizhen Wang ; Ruiping Shi ; Meng Ge

Improved ant colony optimization (ACO) was applied to solve bin-packing problem. A tabu matrix bases on goods is established for ant colony optimization (ACO). Tabu matrix's every column corresponds to goods. Matrix has two rows, first row corresponds to goods load visit state, and second row corresponds to vehicle that ferries the goods. Ant state transfer probability is improved to solve bin-packing problem. According to ants tabu table, all the goods are searched by ants and satisfy the vehicle constrain. Illustrated with a practical case, ACO is feasible for bin-packing problem.

Published in:

Computer Design and Applications (ICCDA), 2010 International Conference on  (Volume:4 )

Date of Conference:

25-27 June 2010