Multi-objective optimization of a two-dimensional cutting problem using genetic algorithms

Santosh Kumar Tiwari

doi:10.1016/j.jmatprotec.2005.12.011

Return

Multi-objective optimization of a two-dimensional cutting problem using genetic algorithms

2006-04-01

PRE

Santosh Kumar Tiwari

Nirupam Chakraborti

DOI：10.1016/j.jmatprotec.2005.12.011

Original

Original request for help

Save

Abstract

En 中文

The work presented here describes a method of optimizing the layout of rectangular parts placed on a rectangular sheet to cut out various parts. Two types of cutting problems have been investigated (i) in which guillotine cutting (cutting from edge to edge) is required (mostly metallic sheets where each cut is made individually for one single sheet), and (ii) the one in which guillotine cutting is not essential (e.g. cuts which can be made using a punch) i.e. for materials like paper or rubber where the sheets to be cut can be laid side by side or on top of one another and one single cut can be made. The optimization of the layout of rectangular parts is achieved with respect to two design objectives involving minimization of (i) the length of the mother sheet required, and (ii) also the total number of cuts required to obtain all the parts from the mother sheet. A tree encoded multi-objective genetic algorithm has been used to study both guillotine and non-guillotine cutting cases, using a binary representation of the variables, and it is shown for the known cases that the globally optimum solutions are obtained. (c) 2006 Elsevier B.V. All rights reserved.

Keywords:

guillotine cuttings

metal cutting

genetic algorithms

multi-objective optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.