抄録
So far, there are many researches on Bin Packing Problem (BPP). Cutting Stock Problem for timber precutting (CSP) is one of the kind of BPP. There are some solving methods such as Integer Programming method, First Fit method and Best Fit method as for this. There are a few papers in which Genetic Algorithm (GA) is applied to BPP. This is because building model is difficult and generating effective individuals of next generation by crossover is also difficult. In this paper, an application of GA to CSP is examined. CSP contains mother materials consisted by plural lengths, which is different from general BPP. Therefore we devise doubled structure of gene. Reflecting dynamic change to crossover operation based on the result of combination, new model is built. Convergence process is improved largely by this newly proposed method.
