Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm

DOI10.1007/978-3-540-88655-6_25zbMath1162.68813OpenAlexW2947064151MaRDI QIDQ3612895

María R. Sierra, Ramiro Varela, Inés González-Rodríguez, César A. 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

multi-objective optimizationgenetic algorithmsmeta-heuristicscutting stock

Mathematics Subject Classification ID

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

Cites Work

• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• One-dimensional cutting stock problem to minimize the number of different patterns
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
• A Linear Programming Approach to the Cutting-Stock Problem
• Unnamed Item
• Unnamed Item

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