Back to Search
Start Over
An effective heuristic for the two-dimensional irregular bin packing problem.
- Source :
-
Annals of Operations Research . Jul2013, Vol. 206 Issue 1, p241-264. 24p. 10 Diagrams, 5 Charts. - Publication Year :
- 2013
-
Abstract
- This paper proposes an adaptation, to the two-dimensional irregular bin packing problem of the Djang and Finch heuristic (DJD), originally designed for the one-dimensional bin packing problem. In the two-dimensional case, not only is it the case that the piece's size is important but its shape also has a significant influence. Therefore, DJD as a selection heuristic has to be paired with a placement heuristic to completely construct a solution to the underlying packing problem. A successful adaptation of the DJD requires a routine to reduce computational costs, which is also proposed and successfully tested in this paper. Results, on a wide variety of instance types with convex polygons, are found to be significantly better than those produced by more conventional selection heuristics. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 206
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 88349750
- Full Text :
- https://doi.org/10.1007/s10479-013-1341-4