.png){kind=icon}
.png){kind=icon}
Return
Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms
.png){kind=icon}
OA
AI
DOI：10.1080/00207540902729926.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers a real-world two-dimensional strip packing problem involving specific machinery constraints and actual cutting production industry requirements. To adapt the problem to a wider range of machinery characteristics, the design objective considers the minimisation of material length and the total number of cuts for guillotinable-type patterns. The number of cuts required for the cutting process is crucial for the life of the industrial machines and is an important aspect in determining the cost and efficiency of the cutting operation. In this paper we propose the application of evolutionary algorithms to address the multi-objective problem, for which numerous approaches to its single-objective formulation exist, but for which multi-objective approaches are almost nonexistent. The multi-objective evolutionary algorithms applied provide a set of solutions offering a range of trade-offs between the two objectives from which clients can choose according to their needs. By considering both the length and number of cuts, they derive solutions with wastage levels similar to most previous approximations which just seek to optimise the overall length.
Keywords:
cutting stock problems
packing problems
evolutionary algorithms
Pareto optimisation
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W