A cooperative algorithm for constrained two-staged two-dimensional cutting problems (Q604802)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5815559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cooperative algorithm for constrained two-staged two-dimensional cutting problems |
scientific article; zbMATH DE number 5815559 |
Statements
A cooperative algorithm for constrained two-staged two-dimensional cutting problems (English)
0 references
12 November 2010
0 references
Summary: We propose a cooperative algorithm for approximately solving the two-staged two-dimensional cutting stock problem (2TDC). We solve 2TDC by considering three key features: a search strategy, a fast filling procedure (FP) and a tighter complementary upper bound. Firstly, the search strategy uses a beam-search method which considers both priority and total cost evaluation operators. Secondly, the FP is used for improving the quality of the obtained results. Finally, a tighter upper bound is applied for refining the selected paths. The method is analysed computationally on a set of instances of the literature and compared to the results provided by several algorithms of the literature. Encouraging results have been obtained.
0 references
beam search
0 references
cutting stock
0 references
knapsack
0 references
optimisation
0 references
strip generation
0 references
2D cutting problems
0 references
two-staged cutting problems
0 references
search strategy
0 references
fast filling procedure
0 references
upper bound
0 references
cooperative algorithms
0 references
0 references
0.9466388
0 references
0.9191502
0 references
0 references
0.9030791
0 references
0.8942744
0 references
0.8941993
0 references
0.89408386
0 references
