How to use structural constraints to compute an upper bound for the pallet loading problem

Article Abstract:

A new upper bound technique for solving pallet loading problems is developed. The problem, which pertains to the packing of identical rectangles into a rectangular container, is solved by applying a set of structural constraints to linear-programming solutions of various cost functions. The proposed method tightens the structural restrictions to determine whether it is too high or too low. Based on its application to three data sets, the approach 'fails only in very few cases.'

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Guillotineable bin packing: a genetic approach

Article Abstract:

The 'distributor's pallet packing problem' is examined. The problem, which pertains to the loading of non-identical goods into a pallet, is solved using a heuristic procedure for determining a loading arrangement based on layered structures of goods. The resulting scheme is more efficient and stable than vertical walls. This is verified in several test runs involving different solution variants and test problems.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Loading pallets with non-identical items

Article Abstract:

The 'distributor's pallet packing problem' is examined. The problem, which pertains to the loading of non-identical goods into a pallet, is solved using a heuristic procedure for determining a loading arrangement based on layered structures of goods. The resulting scheme is more efficient and stable than vertical walls. This is verified in several test runs involving different solution variants and test problems.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: