Abstract: This research presents an application of Ant colony optimization meta-heuristic to the bin packing problems. Hybridization of Ant tuning strategy has introduced to improve the results obtained from basic ant system by utilizing the behaviour of artificial ants to perform local search. The objective is to pack the arbitrary sized three dimensional rectangular prismatic bins into the container of standard sizes in such a way that the empty space inside the container should be least as minimum. The bins should be packed by satisfying the packing constraints such as placement constraint, overlapping constraint, shipment placement constraint, stability constraint, etc.
[1] M.Dorigo and G.Di Caro, "The ant colony optimization meta-heuristic," in New Ideas in Optimization, edited by D. Corne, M.Dorigo, and F. Glover, McGraw-Hill, pp. 11-32, 1999.
[2] M.R.Garey, and D.S, "Computers and Intractability, A Guide to the Theory of NP-Completeness", W.H Freeman and Company, 1979.
[3] S. Goss, S.Aron, J. L. Deneubourg, and J. M. Pasteels.Self-organized shortcuts in the Argentine Ant.Naturwissenschaften, 76:579-581, 1990
[4] Dorigo M., G. Di Caro & L. M. Gambardella. "Ant Algorithms for Discrete Optimization", Artificial Life, 5(2):137-172, 1999.
[5] Bullnheimer B., R. F. Hartl & C. Strauss, "A New Rank Based Version of the Ant System: A Computational Study", Central European Journal for Operations Research and Economics, 7(1):25-38, 1999.
[6] Martello, S., Pisinger, D., Vigo, D., 2000. The three-dimensional bin packing problem. Operations Research 48 (2), 256–267.