Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm

DOI10.1007/978-3-540-88655-6_25MaRDI QIDQ3612895zbMATH OpenOpenAlexFDO

Authors Ramiro Varela, María R. Sierra, Inés González-Rodríguez, César Muñoz

Publication date 11 March 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88655-6_25

zbMATH Keywords

cutting stockgenetic algorithmsmeta-heuristicsmulti-objective optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2043380
• An LP-based approach to cutting stock problems with multiple objectives
• An interactive technique for the cutting stock problem with multiple objectives
• An effective solution for a real cutting stock problem in manufacturing plastic rolls
• Solving a bi-criterion cutting stock problem with open-ended demand: a case study

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• One-dimensional cutting stock problem to minimize the number of different patterns
• Setup and open-stacks minimization in one-dimensional stock cutting

Cited in

(2)

• A dual coding improved genetic algorithm for optimization of laser cutting paths
• scientific article; zbMATH DE number 2043380 (Why is no real title available?)

This page was built for publication: Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm

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