haku: @indexterm Knapsack problem / yhteensä: 30
viite: 2 / 30
| Tekijä: | Pisinger, D. |
| Otsikko: | Heuristics for the container loading problem |
| Lehti: | European Journal of Operational Research
2002 : SEP, VOL. 141:2, p. 382-392 |
| Asiasana: | KNAPSACK PROBLEM HEURISTIC METHODS ANALYTICAL REVIEW |
| Kieli: | eng |
| Tiivistelmä: | The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. A new heuristic based on the wall-building approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be formulated and solved optimally as a Knapsack Problem with capacity equal to the width or height of the container. The depth of a layer as well as the thickness of each strip is decided through a branch-and-bound approach where at each node only a subset of branches is explored. |
SCIMA