Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica (May 2022)

Solving Single Nesting Problem Using a Genetic Algorithm

  • Şerban C.,
  • Dumitriu C.Ş.,
  • Bărbulescu A.

DOI
https://doi.org/10.2478/auom-2022-0029
Journal volume & issue
Vol. 30, no. 2
pp. 259 – 272

Abstract

Read online

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.

Keywords