A Study on the Optimal Allocation of Irregular Shapes and Cutting Path Optimization

임의 형상 부재의 최적배치 및 절단 경로 최적화에 관한 연구

This paper describes a new algorithm for irregular shapes allocation (known as nesting) and cutting path optimization, both implemented in PC-based software with graphic user interface (GUI). Main characteristic of the nesting W is that it deals with only vertices of Placed Pieces to reduce calculation time and for effective allocation. And the other characteristic of the nesting program is that every parts are grouped with respect to their areas and placed along the column of placement region. The cutting paths can be determined by an optimization method called simulated annealing. It was shown that the developed code is superior to other previous nesting H in elapsed time and waste ratio.