A tree search algorithm for solving the container loading problem

INFORMS Journal on Computing

Volumn 22, Issue 2, 2010, Pages 222-235

  Fanslau, Tobias ^a   Bortfeldt, Andreas ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

3D packing; Container loading; Heuristic; Tree search

Indexed keywords

EID: 77952017448     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0338     Document Type: Article

References (24)

1. Bischoff, E. E. 2004. Three-dimensional packing of items with limited load bearing strength. Eur. J. Oper. Res. 168(3) 952-966.
2. Bischoff, E. E., M. S. W. Ratcliff. 1995. Issues in the development of approaches to container loading. Omega 23(4) 377-390.
3. Bischoff, E. E., F. Janetz, M. S. W. Ratcliff. 1995. Loading pallets with non-identical items. Eur. J. Oper. Res. 84(3) 681-692.
4. Bortfeldt, A., H. Gehring. 2001. A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131(1) 143-161.
5. Bortfeldt, A., H. Gehring, D. Mack. 2003. A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29(5) 641-662.
6. Davies, A. P., E. E. Bischoff. 1998. Weight distribution considerations in container loading. Technical report, Statistics and OR Group, European Business Management School, University of Wales, Swansea, UK.
7. Dyckhoff, H., U. Finke. 1992. Cutting and Packing in Production and Distribution. Physica-Verlag, Heidelberg, Germany.
8. Eley, M. 2002. Solving container loading problems by block arrangements. Eur. J. Oper. Res. 141(2) 393-409.
9. Fanslau, T., A. Bortfeldt. 2008. A tree search algorithm for solving the container loading problem. Diskussionsbeitrag 426. Technical report, Fakultät für Wirtschaftswissenschaft, FernUniversität Hagen, Germany. http://www.fernuni-hagen.de/WINF/menuefrm/publik.htm.
10. Fekete, S. P., J. Schepers. 1997. On more-dimensional packing III: Exact algorithms. Technical Report ZPR97-290, Mathematisches Institut, Universität zu Köln, Köln, Germany.
11. Gehring, H., A. Bortfeldt. 1997. A genetic algorithm for solving the container loading problem. Internat. Trans. Oper. Res. 4(4-5) 401-418.
12. Gehring, H., A. Bortfeldt. 2002. A parallel genetic algorithm for solving the container loading problem. Internat. Trans. Oper. Res. 9(4) 497-511.
13. Hemminki, J. 1994. Container loading with variable strategies in each layer. Presentation, ESI-X, July 2-15, EURO Summer Institute, Jouy-en-Josas, France.
14. Hifi, M. 2002. Approximate algorithms for the container loading problem. Internat. Trans. Oper. Res. 9(6) 747-774.
15. Lim, A., B. Rodrigues, Y. Wang. 2003. A multi-faced buildup algorithm for three-dimensional packing problems. Omega 31(6) 471-481.
16. Mack, D., A. Bortfeldt, H. Gehring. 2004. A parallel hybrid local search algorithm for the container loading problem. Internat. Trans. Oper. Res. 11(5) 511-533.
17. Martello, S., D. Pisinger, D. Vigo. 2000. The three-dimensional bin packing problem. Oper. Res. 48(2) 256-267.
18. Morabito, R., M. Arenales. 1994. An AND/OR-graph approach to the container loading problem. Internat. Trans. Oper. Res. 1(1) 59-73.
19. Moura, A., J. F. Oliveira. 2005. A GRASP approach to the containerloading problem. IEEE Intelligent Systems 20(4) 50-57.
20. Parreño, F., R. Alvarez-Valdes, J. F. Oliveira, J. M. Tamarit. 2007. A maximal-space algorithm for the container loading problem. INFORMS J. Comput. 20(3) 412-422.
21. Pisinger, D. 2002. Heuristics for the container loading problem. Eur. J. Oper. Res. 141(2) 143-153.
22. Sixt, M. 1996. Dreidimensionale Packprobleme: Lösungsverfahren basierend auf den Meta-Heuristiken Simulated Annealing und Tabu- Suche. Peter Lang, Europäischer Verlag der Wissenschaften, Frankfurt am Main, Germany.
23. Terno, J., G. Scheithauer, U. Sommerweiß, J. Rieme. 2000. An efficient approach for the multi-pallet loading problem. Eur. J. Oper. Res. 123(2) 372-381.
24. Wäscher, G., H. Haußner, H. Schumann. 2007. An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3) 1109-1130.