EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3675. Control of pattern complexity in two-dimensional rectangular cutting problems
Invited abstract in session TB-29: Applications of combinatorial optimisation in industry and services II, stream Combinatorial Optimization.
Tuesday, 10:30-12:00Room: 157 (building: 208)
Authors (first author is the speaker)
1. | Maria Antónia Carravilla
|
INESC TEC, Faculty of Engineering, University of Porto | |
2. | Matheus Campinho
|
INESC TEC | |
3. | Elsa Silva
|
INESC TEC | |
4. | José Fernando Oliveira
|
INESC TEC, Faculty of Engineering, University of Porto |
Abstract
Cutting and packing (C&P) problems are hard combinatorial optimisation problems that arise in a variety of manufacturing and process industries. These problems arise whenever a larger object needs to be divided into smaller parts in order to minimise waste, and their optimal solution contributes to the reduction of raw material costs. However, many companies ignore optimisation approaches to their C&P problems in favour of production efficiency, prefering simple ways of cutting raw materials (cutting patterns), which require less human labour and less sophisticated and cheaper machinery, to complex, but in terms of raw material consumption optimised, cutting patterns. Therefore, it becomes critical to explicitly consider the impact of pattern complexity when solving C&P problems.
In this talk, we will present a number of characteristics that influence pattern complexity, such as the number of different piece types, the total number of cuts, different types of strip structures, etc. Based on the floating-cuts mathematical model for two-dimensional rectangular cutting problems, these characteristics will be modelled, requiring new variables, additional constraints and resulting in new components of the objective function. Within a multi-objective optimisation framework, the conflicting objectives of waste and pattern complexity minimisation are addressed. Computational results are presented that show and quantify this trade-off.
[Projeto CIBELE doi: 10.54499/2022.02767.PTDC]
Keywords
- Cutting and Packing
- Combinatorial Optimization
Status: accepted
Back to the list of papers