Premium
A greedy search for the three‐dimensional bin packing problem: the packing static stability case
Author(s) -
De Castro Silva J. L.,
Soma N. Y.,
Maculan N.
Publication year - 2003
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/1475-3995.00400
Subject(s) - bin packing problem , greedy algorithm , heuristic , packing problems , mathematical optimization , stability (learning theory) , mathematics , computer science , bin , combinatorics , algorithm , machine learning
We suggest a greedy search heuristic for solving the three‐dimensional bin packing problem (3D‐BPP) where in addition to the usual requirement of minimum amount of bins being used, the resulting packing of items into the bins must be physically stable. The problem is NP‐hard in the strong sense and imposes severe computational strain for solving it in practice. Computational experiments are also presented and the results are compared with those obtained by the Martello, Pisinger and Vigo (2000) heuristic.