Ant colony optimization for container loading problem

Journal of Mathematics and Statistics

Volumn 8, Issue 2, 2012, Pages 169-175

  Yap, C N ^a   Lee, L S ^a   Majid, Z A ^a   Seow, H V ^b  

^a UNIVERSITY PUTRA MALAYSIA   (Malaysia)

^b Jalan Broga University of Nottingham Malaysia Campus   (Malaysia)

Author keywords

Ant Colony Optimization (ACO); Container loading problem (clp); Space Utilization Ratio (SUR); Tower Building (TB)

Indexed keywords

EID: 84864849120     PISSN: 15493644     EISSN: None     Source Type: Journal    
DOI: 10.3844/jmssp.2012.169.175     Document Type: Article

References (17)

1. Alaya, I., C. Solnon and K. Ghedira, 2004. Ant algorithm for the multi-dimensional knapsack problem. Proceedings of the International Conference on Bioinspired Optimization Methods and their Applications (BIOMA' 04), pp: 63-72.
2. Bischoff, E.E. and M.S.W. Ratcliff, 1995. Issues in the development of approaches to container loading. OMEGA: The Int. J. Manage. Sci., 23: 377-390. DOI: 10.1016/0305-0483(95)00015-G
3. Bischoff, E.E., F. Janetz and M.S.W. Ratcliff, 1995. Loading pallets with non-identical items. Eur. J. Operat. Res., 84: 681-692. DOI: 10.1016/0377-2217(95)00031-K
4. Bortfeldt, A. and H. Gehring, 1998. Applying tabu search to container loading problems. Operations Research Proceedings: 533-538. ftp://ftp.fernuni hagen.de/pub/fachb/wiwi/winf/forschng/publi/bf
5. Bortfeldt, A. and H. Gehring, 2001. A hybrid genetic algorithm for the container loading problem. Eur. J. Operat. Res., 131: 143-161. DOI: 10.1016/S0377-2217(00)00055-2
6. Davies, A.P. and E.E. Bischoff, 1999. Weight distribution considerations in container loading. Eur. J. Operat. Res., 114: 509-527. DOI: 10.1016/S0377-2217(98)00139-8
7. Dorigo, M and T. Stutzle, 2004. Ant Colony Optimization. 1st Edn., The MIT Press, Cambridge, ISBN-10: 0262042193, pp: 305.
8. Dyckhoff, H., 1990. A typology of cutting and packing problems. Eur. J. Operat. Res., 44: 145-159. DOI: 10.1016/0377-2217(90)90350-K
9. Gehring, H. and A. Bortfeldt, 1997. A genetic algorithm for solving the container loading problem. Int. Trans. Operat. Res., 4: 401-418. DOI: 10.1111/j.1475- 3995.1997.tb00095.x
10. George, J.A. and D.F. Robinson, 1980. A heuristic for packing boxes into a container. Comput. Operat. Res., 7: 147-156. DOI: 10.1016/0305-0548(80)90001-5
11. Gilmore, P.C. and R.E. Gomory, 1965. Multistage cutting stock problems of two and more dimensions. Operat. Res., 13: 94-120.
12. Liang, S.C., C.Y. Lee and S.W. Huang, 2007. A hybrid meta-heuristic for the container loading problem. Commun. IIMA, 7: 73-84.
13. Loh, T.H. and A.Y.C. Nee, 1992. A packing algorithm for hexahedral boxes. Proceedings of the Conference of Industrial Automation, (CIA' 92), Singapore, pp: 115-126.
14. Moura, A. and J.F. Oliveira, 2005. A GRASP approach to the container-loading problem. IEEE Intel. Syst., 20: 50-57. DOI: 10.1109/MIS.2005.57
15. Ngoi, B.K.A., M.L. Tay and E.S. Chua, 1994. Applying spatial representation techniques to the container packing problem. Int. J. Prod. Res., 32: 111-123. DOI: 10.1080/00207549408956919
16. Wascher, G., H. Haubner and H. Schumann, 2007. An improved typology of cutting and packing problems. Eur. J. Operat. Res., 183: 1109-1130. DOI: 10.1016/j.ejor.2005.12.047
17. Zhuang, F.T., L. Zhang, C.X. Zhang and S. Gao, 2007. Research on solution to container loading problem based on ant colony optimization. J. Jiangnan Univ., 6: 795-799.