.png){kind=icon}
Return
Sequential heuristic for the two-dimensional bin-packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.06.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A heuristic approach for the two-dimensional bin-packing problem is proposed. The algorithm is based on the sequential heuristic procedure that generates each pattern to produce some items and repeats until all items are produced. Both guillotine and non-guillotine patterns can be used. Each pattern is obtained from calling a pattern-generation procedure, where the objective is to maximize the pattern value. The item values are adjusted after the generation of each pattern using a value correction formula. The algorithm is compared with five published algorithms, using 50 groups of benchmark instances. The results indicate that the algorithm is the most efficient in improving solution quality. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Packing
2D bin-packing
Sequential value correction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSave
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
OAAI
OAAIShareSaveShareSaveShareSave
View more