Results 1 
2 of
2
An Efficient Approach for the MultiPallet Loading Problem
 European Journal of Operational Research
, 1997
"... The Distributor's or MultiPallet Loading Problem is considered in this paper. This problem is to load a set of distinct products with given quantities on pallets (or in containers) and to minimize the number of pallets needed. The theoretical objective of finding the best space utilization is ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
The Distributor's or MultiPallet Loading Problem is considered in this paper. This problem is to load a set of distinct products with given quantities on pallets (or in containers) and to minimize the number of pallets needed. The theoretical objective of finding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability aspects, etc.). Keeping in mind a general branch and bound framework an efficient heuristic for the considered multipallet loading problem is developed. The threedimensional solution approach uses in the kernel a layerwise loading strategy with optimal twodimensional loading patterns. Computational experiments show the efficiency of the proposed algorithms. 1 Introduction In this paper the problem of optimal loading of small rectangularshaped boxes (pieces) on a minimal number of rectangular pallets is considered. Thereby several restrictions have to be taken into account, su...
A Heuristic Approach for Solving the MultiPallet Packing Problem
, 1996
"... We consider the Distributer's Pallet Packing Problem. This problem is to pack a set of distinct products with given quantities in greater volumes (pallets, containers) and to minimize the number of used volumes. The theoretical objective of finding the best space utilization is restricted by a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider the Distributer's Pallet Packing Problem. This problem is to pack a set of distinct products with given quantities in greater volumes (pallets, containers) and to minimize the number of used volumes. The theoretical objective of finding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability aspects, etc.). Keeping in mind a general branch and bound framework an efficient heuristic for the considered multipallet packing problem is developed. The threedimensional solution approach uses in the kernel a layerwise packing strategy with optimal twodimensional packing patterns. Linear Programming lower bounds for the number of pallets needed to pack the total consignment are developed. Computational experiments show the efficiency of the proposed algorithms. 1 Introduction In this paper we consider the problem of optimal packing of small rectangularshaped boxes (socalled pieces) on...