Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
From MaRDI portal
Publication:2566944
DOI10.1016/j.cor.2004.08.009zbMath1088.90046DBLPjournals/cor/PurezaM06OpenAlexW2161001022WikidataQ57719559 ScholiaQ57719559MaRDI QIDQ2566944
Reinaldo Morabito, Vitória Pureza
Publication date: 29 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.08.009
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem ⋮ Layer-layout-based heuristics for loading homogeneous items into a single container ⋮ 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 ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cutting and packing. Special issue
- 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 exact depth-first algorithm for the pallet loading problem
- Some experiments with simulated annealing techniques for packing problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An exact algorithm for the pallet loading problem
- Two-dimensional packing problems: a survey
- 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
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- 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
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- The G4-Heuristic for the Pallet Loading Problem
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- An AND/OR-graph approach to the container loading problem
- Loading Multiple Pallets
- Analysis of upper bounds for the pallet loading problem
- A fast algorithm for two-dimensional pallet loading problems of large size
This page was built for publication: Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
