Please use this identifier to cite or link to this item:
|Title:||A biased random-key genetic algorithm for the minimization of open stacks problem|
|Authors:||José Fernando Gonçalves|
|Abstract:||This paper describes a biased random-key genetic algorithm (BRKGA) for the minimization of the open stacks problem (MOSP). The MOSP arises in a production system scenario, and consists of determining a sequence of cutting patterns that minimize the maximum number of open stacks during the cutting process. The proposed approach combines a BRKGA and a local search procedure for generating the sequence of cutting patterns. A novel fitness function for evaluating the quality of the solutions is also developed. Computational tests are presented using available instances taken from the literature. The high quality of the solutions obtained validate the proposed approach.|
|Appears in Collections:||LIAAD - Indexed Articles in Journals|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.