An efficient placement heuristic for three-dimensional rectangular packing

DOI10.1016/J.COR.2010.04.015zbMath1231.90322OpenAlexW2030163722MaRDI QIDQ709132

Kun He, Wenqi Huang

Publication date: 15 October 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.04.015

zbMATH Keywords

heuristiccutting and packingcontainer loadingrectangular packingthree-dimension

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (20)

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 ⋮ A beam search approach to the container loading problem ⋮ An action-space-based global optimization algorithm for packing circles into a square container ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ A new iterative-doubling greedy-lookahead algorithm for the single container loading problem ⋮ A beam search algorithm for the biobjective container loading problem ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Three-stage heuristic algorithm for three-dimensional irregular 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 ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• A new heuristic algorithm for cuboids packing with no orientation constraints
• Weight distribution considerations in container loading
• Loading plates with non-identical items
• Solving container loading problems by block arrangement
• Neighborhood structures for the container loading problem: a VNS implementation
• A caving degree approach for the single container loading problem
• Three-dimensional packing of items with limited load bearing strength
• A Maximal-Space Algorithm for the Container Loading Problem
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• A parallel hybrid local search algorithm for the container loading problem
• A Genetic Algorithm for Solving the Container Loading Problem
• Loading Multiple Pallets
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: An efficient placement heuristic for three-dimensional rectangular packing