Best-first search methods for constrained two-dimensional cutting stock problems
Operations Research
Computers and Operations Research
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
ISDA '05 Proceedings of the 5th International Conference on Intelligent Systems Design and Applications
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
Hi-index | 0.00 |
This work presents a multi-objective approach to solve the Constrained 2D Cutting Stock Problem. The problem targets the cutting of a large rectangle of fixed dimensions in a set of smaller rectangles using orthogonal guillotine cuts. Although the problem is usually focused on a single objective, in this work we want to optimise the layout of rectangular parts on the sheet of raw material so as to maximise the total profit, as well as minimise the number of cuts to achieve the final demanded pieces. For this, we apply Multi-Objective Evolutionary Algorithms given its great effectiveness when dealing with other types real-world multi-objective problems. For the problem solution, we have implemented an encoding scheme which uses a post-fix notation. According to the two different optimisation criteria the approach provides a set of solutions offering a range of trade-offs between the two objectives, from which clients can choose according to their needs.