The Three-Dimensional Bin Packing Problem

doi:10.1287/opre.48.2.256.12386

The Three-Dimensional Bin Packing Problem

2000-04-01

0

PRE

AI

DOI：10.1287/opre.48.2.256.12386

原文链接

原文求助

摘要

En 中文

The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely difficult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is 1/8. An exact algorithm for filling a single bin is developed, leading to the definition of an exact branch-and-bound algorithm for the three-dimensional bin packing problem, which also incorporates original approximation algorithms. Extensive computational results, involving instances with up to 90 items, are presented: It is shown that many instances can be solved to optimality within a reasonable time limit.

The Three-Dimensional Bin Packing Problem

摘要

AI总结

期刊

机构

引用论文