'Mechanical Engineering Faculty in Slavonski Brod'
Doi
Abstract
U radu se uglavnom raspravlja o problemu rezanja giljotinom dvodimenzijske oštećene robe raspoložive u različitim veličinama. Za raspravu o problemu predlaže se novi heuristički algoritam u obliku stabla. Takav se algoritam sastoji od dva dijela: prvi dio je početno rješenje problema rezanja robe kad ne postoje oštećenja robe; drugi dio je konačno rješenje optimizacije utemeljeno na prvom dijelu uz razmatranje oštećenja. U radu se također ocjenjuju rezultati predloženog algoritma. Eksperimentalnim se rezultatima demonstrira učinkovitost algoritma za problem rezanja dvodimenzijske oštećene robe i pokazuje da se algoritmom može poboljšati ne samo stopa iskoristivosti robe već i stopa ponovne uporabe ostataka smanjenjem fragmentacije ostataka.This paper mainly addresses a two-dimensional defective stocks guillotine cutting stock problem where stock of different sizes is available. Herein a new heuristic algorithm which is based on tree is proposed to discuss this problem. In particular, such an algorithm consists of two parts: the first part is an initial solution of the cutting stock problem where there are no defects on the stocks; the second part is the final optimization solution which is set up on the basis of the first part and takes the defects into consideration. This paper also evaluates the performance of the proposed algorithm. The experimental results demonstrate the effectiveness of the algorithm for the two-dimensional defective stocks cutting stock problem and show that the algorithm can improve not only the utilization rate of stocks, but also the reuse rate of remainders by reducing the fragmentation of remainders
