The Optimization Studies On Stock Cutting Problem Based On Genetic Algorithms

The subject focus on the issues about how to optimize the stock cutting problem, The paper is based on Genetic Algorithm's characteristic,and is tied the shortcomings which is found when using Genetic Algorithm to solve the stock cutting problem.the paper interpose concrete parameter to concrete problem,adopt the same code method and the simple fitness function, designs a set of concrete genetic operator,Since Genetic Algorithm is aimed at the different problem must be designing the different encoded mode and genetic variation, Even if the simple problem encoded mode and genetic variation way are also very complicated. Be aimed at this problem ,the paper suppose the better solving method which is combined with local search and overall search and taked respective merits.Finally, under Windows System with Visual C + +, the paper carries out the two optimization algorithm that under stock cutting simulating.