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.'

Functions of bounded variation, Bounded variation functions

---

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.

Loading and unloading

---

Similar abstracts:

• Abstracts: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. A scheduling policy for adjusting economic lot quantities to a feasible solution
• Abstracts: Two simulated annealing-based heuristics for the job shop scheduling problem. Deterministic job-shop scheduling: past, present and future
• Abstracts: Back to the table: Maharashtra agrees to consider an Enron compromise. Politics as usual
• Abstracts: A new algorithm for the minimal-area convex enclosure problem. Solution approaches to irregular nesting problems

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.