Solving single nesting problem using a genetic algorithm

DOI10.2478/AUOM-2022-0029MaRDI QIDQ5879890zbMATH OpenFDO

Authors C. Şerban, Cristian Stefan Dumitriu, Alina Bărbulescu

Publication date 6 March 2023

Full work available at URL https://doi.org/10.2478/AUOM-2022-0029

zbMATH Keywords

bin packing problemcombinatoricsgenetic algorithmsoptimization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Genetic Algorithms and Heuristic Rules for Solving the Nesting Problem in the Package Industry
• Application of genetic algorithm for the bin packing problem with a new representation scheme
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• scientific article; zbMATH DE number 953062
• Use of genetic algorithms for solution of the rectangle packing problem

This page was built for publication: Solving single nesting problem using a genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5879890)