Study on improved ant colony optimization for bin-packing problem

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.