A fast algorithm for two-dimensional pallet loading problems of large size

European Journal of Operational Research

Volumn 134, Issue 1, 2001, Pages 193-202

  G, Young Gun ^a   Kang, Maing Kyu ^a  

^a Hanyang University   (South Korea)

Author keywords

Heuristics; Packing; Pallet loading; Two dimensional

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PACKING; PALLETS; PROBLEM SOLVING;

TWO-DIMENSIONAL PALLET LOADING;

OPERATIONS RESEARCH;

EID: 0035480434     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00249-6     Document Type: Article

References (16)

1. An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
2. Packing the maximum number of m × n tiles in a p × q rectangle
3. An exact two-dimensional non-guillotine cutting tree search procedure
4. An exact depth-first algorithm for the pallet loading problem
5. An application of micro to product design and distribution
6. The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems
7. Determining an upper bound for a class of rectangular packing problems
8. Improving palletisation efficiency the theoretical basis and practical application
9. The loading problem
10. A 3-dimensional pallet loading method for single-size boxes
11. Approximation algorithms for the oriented two-dimensional bin packing problem
12. How to use structural constraints to compute an upper bound for the pallet loading problem
13. 4-Block heuristic for the rectangle packing problem
14. The G4-heuristic for the pallet loading problem
15. An algorithm to optimize the layout of boxes in pallets
16. Generating pallet loading patterns: A special case of the two-dimensional cutting stock problem