An exact algorithm for the pallet loading problem
From MaRDI portal
Publication:1820701
DOI10.1016/0377-2217(87)90140-8zbMath0614.90084MaRDI QIDQ1820701
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(87)90140-8
heuristic; NP-complete; two-dimensional packing; pallet loading; rectangular boxes; exact tree search algorithm; rectangular pallet
90C27: Combinatorial optimization
Related Items
Improving palletisation efficiency—the theoretical basis and practical application, Analysis of upper bounds for the pallet loading problem, Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts, Stability aspects of pallet loading, Optimising the palletisation of cylinders in cases, The minimum size instance of a Pallet Loading Problem equivalence class, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems, How to use structural constraints to compute an upper bound for the pallet loading problem, An analytical model for the container loading problem, Packing problems, An algorithm of global optimization for solving layout problems, An exact depth-first algorithm for the pallet loading problem, Palletisation efficiency as a criterion for product design, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, A branch-and-cut algorithm for the pallet loading problem, Efficient automated pallet loading, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, A family of genetic algorithms for the pallet loading problem, Solving the pallet loading problem, Lagrangean relaxation with clusters for point-feature cartographic label placement problems, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, An improved typology of cutting and packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, The pallet packing problem for non-uniform box sizes
Uses Software
Cites Work
- Unnamed Item
- Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Determining the number of internal stability of a graph
- A New Algorithm for Generating All the Maximal Independent Sets
- An Algorithm for Two-Dimensional Cutting Problems
- The Theory and Computation of Knapsack Functions
- Algorithm 457: finding all cliques of an undirected graph
