Can I read An Exact Depth-first Algorithm for the Pallet Loading Problem on EtoBox?
An Exact Depth-first Algorithm for the Pallet Loading Problem by Subir Bhattacharya; Rahul Roy; Sumita Bhattacharya is a Engineering article available to read on EtoBox.
What is An Exact Depth-first Algorithm for the Pallet Loading Problem about?
This paper proposes a fast exact algorithm to solve the Pallet Loading Problem (PLP) using depth-first strategy. A new concept called Maximal Breadth Filling Sequence (MBFS) is introduced to bring down the size of the search tree. The algorithm makes use of two pruning rules -lower-bound pruning and state-dominance pruning. Although depthfirst search, by itself, requires very little memory, the dominance pruning rule makes effective utilization of the available memory. For large problems, more the memory available, more effective is the dominance pruning. The algorithm has been tested on standard problem sets. It has been found to be quite fast in outputting optimal solutions. Empirical findings are given in detail.
Who reads An Exact Depth-first Algorithm for the Pallet Loading Problem?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- Subir Bhattacharya; Rahul Roy; Sumita Bhattacharya
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0377-2217)
- Published
- 1998
- Language
- EN
- Field
- Engineering (Physical Sciences)