2014
DOI: 10.1111/itor.12099
|View full text |Cite
|
Sign up to set email alerts
|

The pallet loading problem: a review of solution methods and computational experiments

Abstract: The manufacturer's pallet loading problem (MPLP) has been widely studied during the past 50 years. It consists of placing a maximum number of identical rectangular boxes onto a single rectangular pallet. In this paper, we have reviewed the methods that have been proposed for the solution of this problem. Furthermore, the various problem instances and data sets are analyzed that have been used in computational experiments for the evaluation of these methods. The most challenging and yet unsolved methods are ide… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
30
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 48 publications
(30 citation statements)
references
References 56 publications
0
30
0
Order By: Relevance
“…This problem, whose complexity status is currently unknown, was introduced in the late sixties by Barnett and Kynch [22] and then extensively studied by many researchers, who proposed both exact methods (see, e.g., Dowsland [109], AlvarezValdes et al [5], or Ahn et al [2]) and powerful heuristics (see, e.g., Lins et al [190] or Birgin et al [41]). The number of references being huge, we refer the interested reader to the recent, very complete survey by Silva et al [260].…”
Section: Chapter 5 Logic Based Benders' Decomposition For Orthogonalmentioning
confidence: 99%
See 2 more Smart Citations
“…This problem, whose complexity status is currently unknown, was introduced in the late sixties by Barnett and Kynch [22] and then extensively studied by many researchers, who proposed both exact methods (see, e.g., Dowsland [109], AlvarezValdes et al [5], or Ahn et al [2]) and powerful heuristics (see, e.g., Lins et al [190] or Birgin et al [41]). The number of references being huge, we refer the interested reader to the recent, very complete survey by Silva et al [260].…”
Section: Chapter 5 Logic Based Benders' Decomposition For Orthogonalmentioning
confidence: 99%
“…The comprehensive recent survey by Silva et al [260] has a bibliography of over fifty references, and examines computational experiments from the literature involving some three million instances. Additional experiments are reported by Ahn et al [2].…”
Section: Chapter 5 Logic Based Benders' Decomposition For Orthogonalmentioning
confidence: 99%
See 1 more Smart Citation
“…Computational results indicate that the algorithm is very efficient compared with existing exact algorithms, Martins (2008), which have been identified as one of the best exact algorithm (Silva, Oliveira, &Wäsche, 2014) andJin (2009), which the proposed algorithm is based on. On some instances, the proposed algorithm is faster than Birgin et al's (2010) algorithm which is considered as one of the state-of the art heuristic algorithm (Silva et al, 2014).…”
Section: Introductionmentioning
confidence: 97%
“…On some instances, the proposed algorithm is faster than Birgin et al's (2010) algorithm which is considered as one of the state-of the art heuristic algorithm (Silva et al, 2014). This paper is organized as follows.…”
Section: Introductionmentioning
confidence: 99%