An exact algorithm for the pallet loading problem
From MaRDI portal
Publication:1820701
DOI10.1016/0377-2217(87)90140-8zbMath0614.90084OpenAlexW2066368232MaRDI 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
heuristicNP-completetwo-dimensional packingpallet loadingrectangular boxesexact tree search algorithmrectangular pallet
Related Items
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem, A global optimization approach for solving three-dimensional open dimension rectangular packing problems, Solving the pallet loading problem, An improved typology of cutting and packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, Logic based Benders' decomposition for orthogonal stock cutting problems, The minimum size instance of a Pallet Loading Problem equivalence class, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, Palletisation efficiency as a criterion for product design, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, A family of genetic algorithms for the 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, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, Lagrangean relaxation with clusters for point-feature cartographic label placement problems, Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts, Packing problems, A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP, Improving palletisation efficiency—the theoretical basis and practical application, Analysis of upper bounds for the pallet loading problem, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor, A branch-and-cut algorithm for the pallet loading problem, The pallet packing problem for non-uniform box sizes, Computing stable loads for pallets, The pallet loading problem: a review of solution methods and computational experiments, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, Efficient automated pallet loading, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, An algorithm of global optimization for solving layout problems, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, An exact depth-first algorithm for the pallet loading problem, Stability aspects of pallet loading, Optimising the palletisation of cylinders in cases
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
