New lower bounds for the three-dimensional finite bin packing problem

Authors:
Marco A. Boschetti
Affiliations:
Department of Mathematics, University of Bologna, Via Sacchi 3, Cesena 47023, Italy
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 6
Cited 2

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
The Three-Dimensional Bin Packing Problem

Operations Research
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

Operations Research

Quantified Score

Hi-index	0.05

Visualization

Abstract

The three-dimensional finite bin packing problem (3BP) consists of determining the minimum number of large identical three-dimensional rectangular boxes, bins, that are required for allocating without overlapping a given set of three-dimensional rectangular items. The items are allocated into a bin with their edges always parallel or orthogonal to the bin edges. The problem is strongly NP-hard and finds many practical applications. We propose new lower bounds for the problem where the items have a fixed orientation and then we extend these bounds to the more general problem where for each item the subset of rotations by 90° allowed is specified. The proposed lower bounds have been evaluated on different test problems derived from the literature. Computational results show the effectiveness of the new lower bounds.