| Autor: |
Şerban C., Dumitriu C.Ş., Bărbulescu A. |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 30, Iss 2, Pp 259-272 (2022) |
| Druh dokumentu: |
article |
| ISSN: |
1844-0835 |
| DOI: |
10.2478/auom-2022-0029 |
| Popis: |
Since the Bin Packing Problem (BPP) has application to industry and supply chain management problems (to mention only the most important ones), it attracted attention from its formulation. The Single Nesting Problem treated here is a particular case of this optimization problem, which different methods, mainly combinatorial, can solve. In this article, we propose using a genetic algorithm for solving the single nesting problem formulated in a previous article by the authors. The results comparisons prove that this approach is an excellent alternative to the combinatorial ones. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
