Solving Single Nesting Problem Using a Genetic Algorithm

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 meth...

Full description

Bibliographic Details
Main Authors: Şerban C., Dumitriu C.Ş., Bărbulescu A.
Format: Article
Language:English
Published: Sciendo 2022-05-01
Series:Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
Subjects:
Online Access:https://doi.org/10.2478/auom-2022-0029
_version_ 1818548719624126464
author Şerban C.
Dumitriu C.Ş.
Bărbulescu A.
author_facet Şerban C.
Dumitriu C.Ş.
Bărbulescu A.
author_sort Şerban C.
collection DOAJ
description 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.
first_indexed 2024-12-12T08:23:56Z
format Article
id doaj.art-5e4fc71200bb400a8df69b2277054164
institution Directory Open Access Journal
issn 1844-0835
language English
last_indexed 2024-12-12T08:23:56Z
publishDate 2022-05-01
publisher Sciendo
record_format Article
series Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
spelling doaj.art-5e4fc71200bb400a8df69b22770541642022-12-22T00:31:18ZengSciendoAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica1844-08352022-05-0130225927210.2478/auom-2022-0029Solving Single Nesting Problem Using a Genetic AlgorithmŞerban C.0Dumitriu C.Ş.1Bărbulescu A.2Ovidius University of Constanta, Bdul Mamaia 124, 900527Constanta, Romania.3 S.C. Utilnavorep S.A., 55 Aurel Vlaicu Bd., 900055, Constanta, Romania.Transilvania University of Brasov, 5 Turnului Str., 900152, Brasov, Romania.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.https://doi.org/10.2478/auom-2022-0029optimizationcombinatoricsbin packing problemgenetic algorithmsprimary 90c08, 90c59secondary: 68t20
spellingShingle Şerban C.
Dumitriu C.Ş.
Bărbulescu A.
Solving Single Nesting Problem Using a Genetic Algorithm
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
optimization
combinatorics
bin packing problem
genetic algorithms
primary 90c08, 90c59
secondary: 68t20
title Solving Single Nesting Problem Using a Genetic Algorithm
title_full Solving Single Nesting Problem Using a Genetic Algorithm
title_fullStr Solving Single Nesting Problem Using a Genetic Algorithm
title_full_unstemmed Solving Single Nesting Problem Using a Genetic Algorithm
title_short Solving Single Nesting Problem Using a Genetic Algorithm
title_sort solving single nesting problem using a genetic algorithm
topic optimization
combinatorics
bin packing problem
genetic algorithms
primary 90c08, 90c59
secondary: 68t20
url https://doi.org/10.2478/auom-2022-0029
work_keys_str_mv AT serbanc solvingsinglenestingproblemusingageneticalgorithm
AT dumitriucs solvingsinglenestingproblemusingageneticalgorithm
AT barbulescua solvingsinglenestingproblemusingageneticalgorithm