A Note on a Combined Approach to the Pallet Loading Problem
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
Hodgson developed a dynamic programming based heuristic for the two- dimensional pallet loading problem. In the course of evaluating the computational results for the procedure, it was noted that the quality of solutions obtained by the procedure percent coverage of the pallet area was very good. The CPU seconds required to compute solutions were larger than would be desireable for application in a real-time environment. It was observed that there were elements of the procedure that might be enhanced in order to improve computation times. It was conjectured that it might be possible to obtain significant computational improvements if the quality of the bounding function was improved even slightly. In the following, the dynamic programming based pallet loading procedure is reviewed along with the development of the bounding function. The results of the experimentation with heuristic knapsack procedures is then discussed. A fundamental improvement in the bounding function is developed and another improvement taken from observations of real-world pallet loaders and furniture movers is presented.
- Numerical Mathematics