Journal
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Volume 23, Issue 1-2, Pages 25-46Publisher
WILEY-BLACKWELL
DOI: 10.1111/itor.12109
Keywords
minimization of open stacks problem; cutting pattern; biased random-key genetic algorithm; random keys
Funding
- North Portugal Regional Operational Programme (ON.2-O Novo Norte), under the National Strategic Reference Framework (NSRF), through the European Regional Development Fund (ERDF) [PTDC/EGE-GES/117692/2010, NORTE-07-0124-FEDER-000057]
- Programme COMPETE
- national funds, through the Portuguese funding agency, Fundacao para a Ciencia e a Tecnologia (FCT)
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available