A multi-start random constructive heuristic for the container loading problem

Pesquisa Operacional

Volumn 27, Issue 2, 2007, Pages 311-331

  De Araújo, Olinto César Bassi ^a   Armentano, Vinícius Amaral ^b  

^a FEDERAL UNIVERSITY OF SANTA MARIA   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Container loading; Cuboid arrangement; Multi start random constructive heuristic

Indexed keywords

EID: 37349016250     PISSN: 01017438     EISSN: 16785142     Source Type: Journal    
DOI: 10.1590/S0101-74382007000200007     Document Type: Article

References (38)

1. Bischoff, E.E. & Marriott, M.D. (1990). A Comparative Evaluation of Heuristics for Container Loading. European Journal of Operational Research, 44, 267-276.
2. Bischoff, E.E. & Ratcliff, M.S.W. (1995). Issues in the development of approaches to container loading. Omega, 4, 377-390.
3. Bischoff, E.E. (2006). Three-dimensional packing of items with limited load bearing strength. European Journal of Operational Research, 168(3), 952-966.
4. Bischoff, E.E.; Janetz, F. & Ratcliff, M.S.W. (1995). Loading Pallets with Non-Identical Items. European Journal of Operational Research, 84, 681-692.
5. Bortfeldt, A. & Gehring, H. (1998). Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. OR Spektrum, 20(4), 237-250.
6. Bortfeldt, A. & Gehring, H. (2001). A Hybrid Genetic Algorithm for the Container Loading Problem. European Journal of Operational Research, 131, 143-161.
7. Bortfeldt, A.; Gehring, H. & Mack D. (2003). A parallel tabu search algorithm for solving the container loading problem. Parallel Computing, 29(5), 641-662.
8. th National Conference on Artificial Intelligence, 271-278.
9. Cecilio, F.O. & Morabito, R. (2004). Refinamentos na heurística de George e Robinson para o problema de carregamento de caixas dentro de contêineres. Transportes, 12(1), 32-45.
10. Chen, C.S.; Lee, S.M. & Shen, Q.S. (1995). An Analytical Model for the Container Loading Problem. European Journal of Operational Research, 80, 68-76.
11. Chien, C.F. & Deng, J.F. (2004). A container packing support system for determining and visualizing container packing patterns. Decision Support Systems, 37(1), 23-34.
12. Davies, A.P. & Bischoff, E.E. (1999). Weight Distribution Considerations in Container Loading. European Journal of Operational Research, 114, 509-527.
13. Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44, 145-159.
14. Eley, M. (2002). Solving container loading problems by block arrangement. European Journal of Operational Research, 141(2), 393-409.
15. Faroe, O.; Pisinger, D. & Zachariasen, M. (2003). Guided Local Search for the Three-Dimensional Bin-Packing Problem. INFORMS Journal on Computing, 15(3), 267-283.
16. Feo, T.A. & Resende, M.G.C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109-133.
17. Festa, P. & Resende, M.G.C. (2004). An annotated bibliography of GRASP. European Journal of Operational Research, submitted.
18. Gehring, H. & Bortfeldt, A. (1997). A Genetic Algorithm for Solving the Container Loading Problem. International Transactions in Operations Research, 4(5-6), 401-418.
19. Gehring, H.; Menschner, K. & Meyer, M. (1990). A Computer-Based Heuristic for Packing Pooled Shipment Containers. European Journal of Operational Research, 44, 277-288.
20. George, J.A. & Robinson, D.F. (1980). A Heuristic for Packing Boxes into a Container. Computers and Operations Research, 7, 147-156.
21. Haessler, R.W. & Talbot, F.B. (1990). Load Planning for Shipments of Low Density Products. European Journal of Operational Research, 44, 289-299.
22. Hassamontr, J. (2003). On decomposing 3D Packing Problem in Wooden Furniture Industry. In: Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation, 497-502.
23. He, D.Y. & Cha, J.Z. (2002). Research on Solution to Complex Container Loading Problem Based on Genetic Algorithm. In: Proceeding of First International Conference on Machine Learning and Cybernetics, 1, 78-82, Beijing, November.
24. Hifi, M. (2004). Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. Computers & Operations Research, 31(5), 657-674.
25. Lai, K.K.; Xue, J. & Xu, B. (1998).Container packing in a multi-customer delivering operation. Computers & Industrial Engineering, 35(1-2), 323-326.
26. Lim, A. & Zhang, X. (2005). The container loading problem. ACM Symposium on Applied Computing, 913-917.
27. Lim, A.; Rodrigues, B. & Wang, Y. (2003). A multi-faced buildup algorithm for threedimensional packing problems. Omega, 31(6), 471-481.
28. Lin, S. & Kernighan, B.W. (1973). An Effective Heuristic Algorithm for the Travelling-Salesman Problem. Operations Research, 21, 0498-0516.
29. Mack, D.; Bortfeldt, A. & Gehring, H. (2004). A parallel hybrid local search algorithm for the container loading problem. International Transaction in Operational Research, 11, 511-534.
30. Martello, S.; Pisinger, D. & Vigo, D. (2000). The Three Dimensional Bin Packing Problem, Operations Research, 48, 256-267.
31. Martí, R. (2003). Multi-Start Methods. In: Handbook of MetaHeuristics [edited by F. Glover and G. Kochenberger], Kluwer, 355-368.
32. Morabito, R. & Arenales, M. (1994). An And/Or-graph Approach to the Container Loading Problem. International Transactions in Operations Research, 1(1), 59-73.
33. Moura, A. & Oliveira, J.F. (2005). A GRASP Approach to the Container-Loading Problem. IEEE Intelligent Systems, 4(20), 50-57.
34. Ngoi, B.K.A.; Tay, M.L. & Chua, E.S. (1994). Applying spatial representation techniques to the container packing problem. International Journal of Production Research, 32, 111-123.
35. Pisinger, D. (2002). Heuristics for the container loading problem. European Journal of Operational Research, 141, 143-153.
36. Prais, M. & Ribeiro, C.C. (2000). Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12, 164-176.
37. Resende, M.G.C. & Ribeiro, C.C. (2003). Greedy randomized adaptive search procedures. In: Handbook of MetaHeuristics [edited by F. Glover and G. Kochenberger], Kluwer, 219-249.
38. Verweij, A.M. (1996). Multiple destination bin packing. UU-CS (Ext. r. no. 1996-39). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.