A heuristic for the three-dimensional strip packing problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5525649
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- An efficient placement heuristic for three-dimensional rectangular packing
- Heuristics for the score-constrained strip-packing problem
- A reference length approach for the 3D strip packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A hybrid placement strategy for the three-dimensional strip packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
Cites work
- A comparative evaluation of heuristics for container loading
- A hybrid genetic algorithm for the container loading problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A tabu search algorithm for weakly heterogeneous container loading problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved typology of cutting and packing problems
- Heuristics for the container loading problem
- Loading Multiple Pallets
- Weight distribution considerations in container loading
Cited in
(31)- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A global search framework for practical three-dimensional packing with variable carton orientations
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A computer-based heuristic for packing pooled shipment containers
- A reference length approach for the 3D strip packing problem
- Constraints in container loading -- a state-of-the-art review
- Triple-solution approach for the strip packing problem with two-staged patterns
- 3-D container packing heuristics
- Upper bounds for heuristic approaches to the strip packing problem
- A comparative review of 3D container loading algorithms
- Upper bounds for heuristic approaches to the strip packing problem
- Data structures for higher-dimensional rectilinear packing
- A general purpose algorithm for three-dimensional packing
- A heuristic for solving large bin packing problems in two and three dimensions
- Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
- A heuristic algorithm for container loading of pallets with infill boxes
- An effective shaking procedure for 2D and 3D strip packing problems
- Heuristic for the rectangular strip packing problem with rotation of items
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- scientific article; zbMATH DE number 5525649 (Why is no real title available?)
- A heuristic approach to the three-dimensional cargo-loading problem
- Heuristic algorithms for on-line packing in three dimensions
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- A fast heuristic for a three-dimensional non-convex domain loading problem
- Routing problems with loading constraints
- A hybrid placement strategy for the three-dimensional strip packing problem
- An efficient placement heuristic for three-dimensional rectangular packing
- A particular approach for the three-dimensional packing problem with additional constraints
This page was built for publication: A heuristic for the three-dimensional strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643958)
