Solving the single-container loading problem by a fast heuristic method

Optimization Methods and Software

Volumn 25, Issue 2, 2010, Pages 263-277

  He, Kun ^a   Huang, Wenqi ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Cavity degree; Container loading; Heuristics; Layer; Packing

Indexed keywords

AVERAGE VOLUME; BENCH-MARK PROBLEMS; COMPUTING TIME; CONTAINER LOADING; CONTAINER-LOADING PROBLEMS; KEY ISSUES; LAYER PACKING; MATHEMATICAL TOOLS; OTHER ALGORITHMS;

HEURISTIC ALGORITHMS; HEURISTIC METHODS;

CONTAINERS;

EID: 77949566430     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780902992761     Document Type: Article

References (21)

1. E.E. Bischoff, Three-dimensional packing of items with limited load bearing strength, Eur. J. Oper. Res. 168(3) (2006), pp. 952-966.
2. E.E. Bischoff and M.S.W. Ratcliff, Issues in the development of approaches to container loading, OMEGA Int. J. Manage. Sci. 23(4) (1995), pp. 377-390.
3. E.E. Bischoff, F. Janetz, and M.S.W. Ratcliff, Loading pallets with non-identical items, Eur. J. Oper. Res. 84(3) (1995), pp. 681-692.
4. A. Bortfeldt and H. Gehring, Applying tabu search to container loading problems, Operations Research Proceedings, Springer, Berlin, 1998, pp. 533-538.
5. A. Bortfeldt and H. Gehring, A hybrid genetic algorithm for the container loading problem, Eur. J. Oper. Res. 131 (2001), pp. 143-161.
6. A. Bortfeldt, H. Gehring, and D. Mack, A parallel tabu search algorithm for solving the container loading problem, Parallel Comput. 29(5) (2003), pp. 641-662.
7. A.P.Davies and E.E. Bischoff,Weight distribution considerations in container loading, Eur. J. Oper. Res. 114 (1999), pp. 509-527.
8. M. Eley, Solving container loading problems by block arrangement, Eur. J. Oper. Res. 141 (2002), pp. 393-409.
9. H. Gehring and A. Bortfeldt, A genetic algorithm for solving the container loading problem, Int. Trans. Oper. Res. 4 (1997), pp. 401-418.
10. H. Gehring and A. Bortfeldt, A parallel genetic algorithm for solving the container loading problem, Int. Trans. Oper. Res. 9(4) (2002), pp. 497-511.
11. J.A. George and D.F. Robinson, A heuristic for packing boxes into a container, Comput. Oper. Res. 7 (1980), pp. 147-156.
12. W.Q. Huang and K. He, A caving degree approach for the single container loading problem, Eur. J. Oper. Res. (2008), DOI 10.1016/j.ejor.2008.02.024.
13. W.Q. Huang, D.B. Chen, and R.C. Xu, A new heuristic algorithm for rectangle packing, Comput. Oper. Res. 34(11) (2007), pp. 3270-3280.
14. T.H. Loh and A.Y.C. Nee, A packing algorithm for hexahedral boxes, Proceedings of the Conference of Industrial Automation, Singapore, 1992, pp. 115-126.
15. B.T. Lowerre, The HARPY speech recognition system, Ph.D. diss., Carnegie-Mellon University, USA, 1976.
16. R. Morabito and M. Arenales, An AND/OR graph approach to the container loading problem, Int. Trans. Oper. Res. 1 (1994), pp. 59-73.
17. A. Moura and J.F. Oliveira, A GRASP approach to the container-loading problem, IEEE Intell. Syst. 20(4) (2005), pp. 50-57.
18. P.S. Ow and T.E. Morton, Filtered beam search in scheduling, Int. J. Prod. Res. 26 (1988), pp. 35-62.
19. D. Pisinger, Heuristics for container loading problem, Eur. J. Oper. Res. 141(2) (2002), pp. 382-392.
20. G. Wascher, H. Haubner, and H. Schumann, An improved typology of cutting and packing problems, Eur. J. Oper. Res. 183(3) (2007), pp. 1109-1130.
21. Y.H. Xu and A. Fern, On learning linear ranking functions for beam search, ACM International Conference Proceeding Series: Proceedings of the 24th International Conference on Machine Learning, New York, 2007, pp. 1047-1054.