A maximal-space algorithm for the container loading problem

INFORMS Journal on Computing

Volumn 20, Issue 3, 2008, Pages 413-422

  Parreno F ^a   Alvarez Valdes, R ^b   Tamarit, J M ^b   Oliveira, J F ^c,d  

^a UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

^b UNIVERSITY OF VALENCIA   (Spain)

^c UNIVERSITY OF PORTO   (Portugal)

^d UNIVERSITY OF PORTO   (Portugal)

Author keywords

3D packing; Container loading; GRASP; Heuristics

Indexed keywords

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

References (21)

1. Bischoff, E. E. 2006. Three dimensional packing of items with limited load bearing strength. Eur. J. Oper. Res. 168 952-966.
2. Bischoff, E. E., M. D. Marriot. 1990. A comparative evaluation of heuristics for container loading. Eur. J. Oper. Res. 44 267-276.
3. Bischoff, E. E., M. S. W. Ratcliff. 1995. Issues in the development of approaches to container loading. Omega 23 377-390.
4. Bischoff, E. E., F. Janetz, M. S. W. Ratcliff. 1995. Loading pallets with nonidentical items. Eur. J. Oper. Res. 84 681-692.
5. Bortfeldt, A., H. Gehring. 1998. A tabu search algorithm for weakly heterogeneous container loading problems. OR Spectrum 20 237-250.
6. Bortfeldt, A., H. Gehring. 2001. A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131 143-161.
7. Bortfeldt, A., H. Gehring, D. Mack. 2003. A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29 641-662.
8. Davies, A. P., E. E. Bischoff. 1998. Weight distribution considerations in container loading. Eur. J. Oper. Res. 114(3) 509-527.
9. Delorme, X., X. Gandibleux, J. Rodriguez. 2004. GRASP for set packing problems. Eur. J. Oper. Res. 153(3) 564-580.
10. Eley, M. 2002. Solving container loading problems by block arrangement. Eur. J. Oper. Res. 141 393-409.
11. Feo, T., M. G. C. Resende. 1989. A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8 67-71.
12. Gehring, H., A. Bortfeldt. 1997. A genetic algorithm for solving the container loading problem. Internat. Trans. Oper. Res. 4 401-418.
13. Gehring, H., A. Bortfeldt. 2002. A parallel genetic algorithm for solving the container loading problem. Internat. Trans. Oper. Res. 9 497-511.
14. George, J. A., D. F. Robinson. 1980. A heuristic for packing boxes into a container. Comput. Oper. Res. 7 147-156.
15. Mack, D., A. Bortfeldt, H. Gehring. 2004. A parallel hybrid local search algorithm for the container loading problem. Internat. Trans. Oper. Res. 11 511-533.
16. Moura, A., J. F. Oliveira. 2005. A GRASP approach to the container- loading problem. IEEE Intelligent Systems 20 50-57.
17. Pisinger, D. 2002. Heuristics for the container loading problem. Eur. J. Oper. Res. 141 382-392.
18. Prais, M., C. C. Ribeiro. 2000. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12(3) 164-176.
19. Ratcliff, M. S. W., E. E. Bischoff. 1998. Allowing for weight considerations in container loading. OR Spectrum 20 65-71.
20. Resende, M. G. C., C. C. Ribeiro. 2003. Greedy randomized adaptive search procedures. F. Glover, G. Kochenberger, eds. Handbook of Metaheuristics. Kluwer Academic Publishers, Dordrecht, the Netherlands, 219-249.
21. Wäscher, G., H. Haussner, H. Schumann. 2007. An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183 1109-1130.