New resolution algorithm and pretreatments for the two-dimensional bin-packing problem (Q2482368): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2007.02.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971792777 / rank | |||
Normal rank | |||
Revision as of 23:01, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New resolution algorithm and pretreatments for the two-dimensional bin-packing problem |
scientific article |
Statements
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem (English)
0 references
16 April 2008
0 references
The authors consider the two-dimensional bin-packing problem, i.e. the problem of finding the minimum number of identical rectangles called bins that must be used to pack a given set of rectangular items without overlapping. The items can be rotated. The authors introduce the concept of dependent orientation items, and propose three pretreatments that allow to reduce the cardinality of the set of items. A new heuristic based on a best-fit strategy is proposed. The algorithm and the pretreatments are tested on benchmarks from the literature.
0 references
bin-packing
0 references
cutting
0 references
pretreatments
0 references
heuristic algorithms
0 references
