Title :
Study on improved ant colony optimization for bin-packing problem
Author :
Wang, Suxin ; Wang, Leizhen ; Shi, Ruiping ; Ge, Meng
Author_Institution :
Northeastern Univ. at Qinhuangdao, Qinhuangdao, China
Abstract :
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.
Keywords :
bin packing; optimisation; probability; ACO; ant colony optimization; binpacking problem; transfer probability; Ant colony optimization; Approximation algorithms; Design engineering; Educational institutions; Gravity; Particle swarm optimization; Processor scheduling; Resource management; Transportation; Vehicles; Ant Colony Optimization; Assignment; Bin-Packing Problem;
Conference_Titel :
Computer Design and Applications (ICCDA), 2010 International Conference on
Conference_Location :
Qinhuangdao
Print_ISBN :
978-1-4244-7164-5
Electronic_ISBN :
978-1-4244-7164-5
DOI :
10.1109/ICCDA.2010.5540875
