Heuristics for container loading of furniture

European Journal of Operational Research

Volumn 200, Issue 3, 2010, Pages 881-892

  Egeblad, Jens ^a   Garavelli, Claudio ^b   Lisi, Stefano ^b   Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b POLITECNICO DI BARI   (Italy)

Author keywords

Combinatorial optimization; Heuristics; Logistics; Packing; Transportation

Indexed keywords

COMPLEX PROBLEMS; CONTAINER LOADING; CONTAINER-LOADING PROBLEMS; HEURISTICS; IRREGULAR SHAPE; RUNNING TIME; TRANSPORT PLANNING;

COMBINATORIAL OPTIMIZATION; CONTAINERS; FURNITURE MANUFACTURE; PROFITABILITY;

HEURISTIC METHODS;

EID: 69849098010     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.01.048     Document Type: Article

References (29)

1. Alvarez-Valdes R., Parreno F., and Tamarit J. A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. Journal of OR Society 56 (2005) 414-425
2. Bischoff E., and Marriott M. A comparative evaluation of heuristics for container loading. European Journal of Operational Research 44 (1990) 267-276
3. Bischoff E.E. Three-dimensional packing of items with limited load bearing strength. European Journal of Operational Research 168 (2006) 952-966
4. Caprara A., and Monaci M. On the 2-dimensional knapsack problem. Operations Research Letters 1 (2004) 5-14
5. Clautiaux F., Jouglet A., Carlier J., and Moukrim A. A new constraint programming approach for the orthogonal packing problem. Computers and Operations Research 35 (2008) 944-959
6. de Berg M., Kreveld M.V., Overmarks M., and Schvarzkopf O. Computational Geometry: Algorithms and Applications (2000), Springer-Verlag, Berlin, Germany
7. Dyckhoff H., Scheithauer G., and Terno J. Cutting and Packing (C&P). In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated Bibliographies in Combinatorial Optimization (1997), John Wiley and Sons, Chichester
8. Egeblad J., Nielsen B.K., and Brazil M. Translational packing of arbitrary polytopes. Computational Geometry: Theory and Applications (CGTA) 42 (2009) 269-288
9. Egeblad J., Nielsen B.K., and Odgaard A. Fast neighborhood search for two- and three-dimensional nesting problems. European Journal of Operational Research 183 (2007) 1249-1266
10. Egeblad J., and Pisinger D. Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers and Operations Research 36 (2009) 1026-1049
11. Eley M. Solving container loading problems by block arrangement. European Journal of Operational Research 141 2 (2002) 393-409
12. Fekete S.P., Schepers J., and van der Veen J.C. An exact algorithm for higher-dimensional orthogonal packing. Operations Research 55 3 (2007)
13. Gehring H., and Bortfeld A. A parallel genetic algorithm for solving the container loading problem. International Transactions in Operational Research 9 (2002) 497-511
14. Gehring H., and Bortfeldt A. A genetic algorithm for solving the container loading problem. International Transactions in Operational Research 4 (1997) 401-418
15. George J., and Robinson D. A heuristic for packing boxes into a container. Computers and Operations Research 7 (1980) 147-156
16. Glover F. Tabu search - Part I. ORSA Journal on Computing 1 (1989) 190-206
17. Glover F. Tabu search - Part II. ORSA Journal on Computing 2 (1990) 4-32
18. Gomes A.M., and Oliveira J.F. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. European Journal of Operational Research 171 (2006) 811-829
19. Imamichi, T., Yagiura, M., Nagamochi, H., 2006. An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. In: Proceedings of the Third International Symposium on Scheduling, Tokyo, Japan, pp. 132-137.
20. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer, Berlin, Germany
21. Kirkpatrick Jr. S., C.D.G., and Vecchi M.P. Optimization by simulated annealing. Science 220 4598 (1983) 671-680
22. Mack D., Bortfeldt A., and Gehring H. A parallel hybrid local search algorithm for the container loading problem. International Transaction in Operations Research 11 (2004) 511-533
23. Moura A., and Oliveira J.F. A GRASP approach to the container-loading problem. IEEE Intelligent Systems 20 (2005) 50-57
24. Pisinger D. Heuristics for the container loading problem. European Journal of Operations Research 141 (2002) 382-392
25. Ratcliff M.S.W., and Bischoff E.E. Allowing for weight considerations in container loading. OR Spektrum 20 (1998) 65-71
26. Skiena S.S. Minkowski-sum. The Algorithm Design Manual (1997), Springer-Verlag, New York 395-396
27. Stoyan Y.G., Gil N.I., Scheithauer G., Pankratov A., and Magdalina I. Packing of convex polytopes into a parallelepiped. Optimization 54 (2005) 215-235
28. Voudouris C., and Tsang E. Guided local search and its application to the traveling salesman problem. European Journal of Operational Research 113 (1999) 469-499
29. Wäscher G., Haussner H., and Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research 183 (2007) 1109-1130