Browse > Article

A New Exact Algorithm Using the Stair Structure for the Pallet Loading Problem  

Ji, Yeong-Geun (포디엄시스템 기술연구소)
Jin, Go-Whan (우송대학교 IT 경영정보학과)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.34, no.3, 2009 , pp. 43-53 More about this Journal
Abstract
The pallet loading problem(PLP) requires the best orthogonal layout that loads the maximum number of identical boxes(small rectangle) onto a pallet(large rectangle). Since the high pallet utilization saves the distribution and storage costs, many heuristic and exact algorithms have been developed so far. Martins and Dell have found the optimal layouts for the all PLPs less than or equal to 100 boxes except for only 5 problems in their recent research. This paper defines the 'stair structure' and proposes a new exact algorithm applying it. In order to show the priority of the proposed algorithm, computational results are compared to previous algorithms and the optimal layouts for the S unsolved problems are given.
Keywords
Pallet loading Problem; Branch and Bound;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Morabito R. and S. Morales, 'A simple and effective recursive procedure for the manufacturer's pallet loading problem,' Journal of the Operational Research Society, Vol.49(1998), pp.819-828   DOI
2 Dowsland K, 'The Three-dimensional pallet chart : An analysis of the factors affecting the set of feasible layouts for a class of twodimensional packing problems,' Journal of the Operational Research Society, Vol.35(1984), pp.895-905   DOI
3 Dowsland K, 'Determining an upper bound for a class of rectangular packing problems,' Computers and Operations Research, Vol.12 (1985), pp.201-205   DOI   ScienceOn
4 Martins G. and R. Dell, 'Solving the pallet loading problem,' European Journal of Operational Research, Vol.184(2008), pp.129-440   DOI   ScienceOn
5 G Y.-G. and M-K Kang, 'A fast algorithm for two-dimensional pallet loading problems of large size,' European Journal of Operational Research, Vol.134(2001), pp.193-202   DOI   ScienceOn
6 Letchford A. and A. Amaral, 'Anlysis of upper bounds for the pallet loading problem,' European Journal of Operational Research, Vol.132(2001), pp.582-593   DOI   ScienceOn
7 Bhattacharya S., R. Roy, and S. Bhattacharya, 'An exact depth-first algorithm for the pallet loading problem,' European Journal of Operational Research, Vol.110(1998), pp.610-625   DOI   ScienceOn
8 Neliben J., 'How to use structural constraints to compute an upper bound for the pallet loading problem,' European Journal of Operational Research, Vol.84(1995), pp.662-680   DOI   ScienceOn
9 Arenales M. and R. Morabito, 'An AND/ORgraph approach to the solution of two-dimensional non-guillotine cutting problems,' European Journal of Operational Research, Vol.84(1995), pp.599-617   DOI   ScienceOn
10 Dowsland K, 'An exact algorithm for the pallet loading problem,' European Journal of Opemtional Research, Vol.31(1987), pp.78-84   DOI   ScienceOn
11 Barnes F., 'Packing the maximum number of m $\times$ n tiles in a large p $\times$ q rectangle,' Discrete Mathmatics, Vol.26(1979), pp.93-100   DOI   ScienceOn
12 Scheithauer G. and J. Terno, 'The G4-heuristic for the pallet looding problem,' European Journal of Operational Research, Vol.108(1996), pp.511-522
13 G y.-G. and M -K Kang, 'A new Upper bound for unconstrained two-dimensional cutting and packing,' Journal of the Operational Research Society, Vol.53(2002), pp.587-591   DOI   ScienceOn
14 Martins G. and R. Dell, 'The minimum size instance of a pallet loading problem equivalence class,' European Journal of Operational Research, Vol.179(2007), pp.17-26   DOI   ScienceOn