A new heuristic algorithm for cuboids packing with no orientation constraints

DOI10.1016/j.cor.2007.09.008zbMath1179.90284OpenAlexW2093422465MaRDI QIDQ954042

Kun He, Wenqi Huang

Publication date: 7 November 2008

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

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

zbMATH Keywords

heuristic algorithmcontainer loadingcaving degreecuboids packing

Mathematics Subject Classification ID

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

Related Items

VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A global search framework for practical three-dimensional packing with variable carton orientations ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ An efficient placement heuristic for three-dimensional rectangular packing ⋮ A comparative review of 3D container loading algorithms ⋮ A hybrid chaos firefly algorithm for three-dimensional irregular packing problem ⋮ Constraints in container loading -- a state-of-the-art review

Uses Software

• OR-Library

Cites Work

• A new heuristic algorithm for rectangle packing
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• A parallel hybrid local search algorithm for the container loading problem
• Approximate algorithms for the container loading problem
• Loading Multiple Pallets
• Multistage Cutting Stock Problems of Two and More Dimensions
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: A new heuristic algorithm for cuboids packing with no orientation constraints