Name
Title | ||
|---|---|---|
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem |
Abstract | ||
|---|---|---|
We consider the problem of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of three-dimensional rectangular bins. The problem is NP-hard in the strong sense and extremely difficult to solve in practice. We characterize relevant subclasses of packing and present an algorithm which is able to solve moderately large instances to optimality. Extensive computational experiments compare the algorithm for the three-dimensional bin packing when solving general orthogonal packings and when restricted to robot packings. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1206040.1206047 | ACM Trans. Math. Softw. |
Keywords | Field | DocType |
robot-packable variant,constraint programming,bin packing,exact algorithms,minimum number,rectangular-shaped box,relevant subclasses,extensive computational experiment,three-dimensional rectangular bin,three-dimensional bin packing problem,robot packing,branch-and-bound,strong sense,three-dimensional bin packing,general orthogonal packing,large instance,branch and bound,computer experiment,three dimensional,bin packing problem | Bin,Set packing,Artificial intelligence,Robotics,Constraint satisfaction,Mathematical optimization,Branch and bound,Combinatorics,Constraint programming,Algorithm,Robot,Mathematics,Bin packing problem | Journal |
Volume | Issue | ISSN |
33 | 1 | 0098-3500 |
Citations | PageRank | References |
31 | 1.71 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Silvano Martello | 1 | 2362 | 218.73 |
| David Pisinger | 2 | 2454 | 148.80 |
| Daniele Vigo | 3 | 2054 | 149.20 |
| Edgar Den Boef | 4 | 55 | 4.45 |
| Jan Korst | 5 | 175 | 19.94 |