Abstract
In this paper we present a local search heuristic for real-life instances of the variable size bin packing
problem, and an exact algorithm for small instances. One important issue our heuristic is able to satisfy
is that solutions must be delivered within (milli)seconds and that the solution methods should be
robust to last minute changes in the data. Furthermore we show that we are able to incorporate the
concept of usable leftovers on a single bin, and the implementation of many additional constraints
should be supported by the straightforward solution representation. The heuristic is compared to
others from the literature, and comes out ahead on a large subset of the instances.
Original language | English |
---|---|
Journal | Computers and Operations Research |
Volume | 39 |
Issue number | 11 |
Pages (from-to) | 2848-2857 |
ISSN | 0305-0548 |
DOIs | |
Publication status | Published - 2012 |
Externally published | Yes |
Keywords
- Variable size bin packing problem
- Cutting stock
- Real-life application
- Heuristics