Journal
ANNALS OF OPERATIONS RESEARCH
Volume 206, Issue 1, Pages 241-264Publisher
SPRINGER
DOI: 10.1007/s10479-013-1341-4
Keywords
2D bin packing problem; Irregular packing; Heuristics; Djang and Finch heuristic
Categories
Funding
- Instituto Tecnologico y de Estudios Superiores de Monterrey (ITESM) [CAT-144]
- Consejo Nacional de Ciencia y Tecnologia (CONACYT) [99695]
- British Engineering and Physical Sciences Research Council (EPSRC) [EP/D061571/1]
- EPSRC [EP/D061571/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/D061571/1] Funding Source: researchfish
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available