A maximum caving degree algorithm for three-dimensional rectangular packing

MaRDI QIDQ5320592zbMATH OpenFDO

Authors Kun He, Wenqi Huang

Publication date 22 July 2009

zbMATH Keywords

caving degreecutting and packingheuristic algorithmNP-hard problemthree-dimensional rectangular packing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer science aspects of computer-aided design (68U07)

Recommendations

• A new heuristic algorithm for cuboids packing with no orientation constraints
• A quasi-human algorithm for solving the three-dimensional rectangular packing problem
• An Efficient Algorithm for Solving the Container Loading Problem
• A pure quasi-human algorithm for solving the cuboid packing problem
• A caving degree approach for the single container loading problem

Cited in

(4)

• A pure quasi-human algorithm for solving the cuboid packing problem
• An Efficient Algorithm for Solving the Container Loading Problem
• An efficient placement heuristic for three-dimensional rectangular packing
• A new heuristic algorithm for cuboids packing with no orientation constraints

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A maximum caving degree algorithm for three-dimensional rectangular packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320592)