Optimal Cutting Plan for 1D Parts Using Genetic Algorithm and Heuristics

유전자알고리즘 및 경험법칙을 이용한 1차원 부재의 최적 절단계획

In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.