An efficient placement heuristic for three-dimensional rectangular packing
From MaRDI portal
Publication:709132
Recommendations
Cites work
- A caving degree approach for the single container loading problem
- A Genetic Algorithm for Solving the Container Loading Problem
- A hybrid genetic algorithm for the container loading problem
- A maximal-space algorithm for the container loading problem
- A new heuristic algorithm for cuboids packing with no orientation constraints
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- Loading Multiple Pallets
- Loading plates with non-identical items
- Neighborhood structures for the container loading problem: a VNS implementation
- Solving container loading problems by block arrangement
- Three-dimensional packing of items with limited load bearing strength
- Weight distribution considerations in container loading
Cited in
(33)- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Adaptive large neighborhood search for solving the circle bin packing problem
- A beam search algorithm for the biobjective container loading problem
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- A two-phase approach for single container loading with weakly heterogeneous boxes
- Constraints in container loading -- a state-of-the-art review
- 3-D container packing heuristics
- A heuristic for the three-dimensional strip packing problem
- Upper bounds for heuristic approaches to the strip packing problem
- A comparative review of 3D container loading algorithms
- Data structures for higher-dimensional rectilinear packing
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- The multiple container loading problem with preference
- A heuristic algorithm for container loading of pallets with infill boxes
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- A beam search approach to the container loading problem
- An action-space-based global optimization algorithm for packing circles into a square container
- scientific article; zbMATH DE number 5525649 (Why is no real title available?)
- Heuristic algorithms for on-line packing in three dimensions
- Scheduling inspired models for two-dimensional packing problems
- scientific article; zbMATH DE number 773158 (Why is no real title available?)
- A quasi-human algorithm for solving the three-dimensional rectangular packing problem
- A fast implementation for the 2D/3D box placement problem
- An efficient method for the three-dimensional container loading problem by forming box sizes
- A hybrid placement strategy for the three-dimensional strip packing problem
- 3D dynamic heterogeneous robotic palletization problem
- A two-phase constructive algorithm for the single container mix-loading problem
- Online and offline packing cylinders in a cylindrical container
- Optimizing load balanced 3D-bin packing with product family: a multi-objective genetic algorithm
This page was built for publication: An efficient placement heuristic for three-dimensional rectangular packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709132)
