An efficient placement heuristic for three-dimensional rectangular packing

DOI10.1016/j.cor.2010.04.015zbMath1231.90322MaRDI 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

heuristic; cutting and packing; container loading; rectangular packing; three-dimension

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

An efficient method for the three-dimensional container loading problem by forming box sizes, 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, Scheduling inspired models for two-dimensional packing problems, 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, 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

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