Original scientific paper

https://doi.org/10.17559/TV-20150731113849

A new heuristic algorithm for two-dimensional defective stock guillotine cutting stock problem with multiple stock sizes

Maozhu Jin ; Sichuan University, Business School, No. 24 South Section 1, Yihuan Road, Chengdu, China, 610065
Pen Ge ; Sichuan University, Business School, No. 24 South Section 1, Yihuan Road, Chengdu, China, 610065
Peiyu Ren ; Sichuan University, Business School, No. 24 South Section 1, Yihuan Road, Chengdu, China, 610065

Abstract

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.

Keywords

combinatorial optimization; cutting and packing; defects; heuristics

Hrčak ID:

147276

URI

https://hrcak.srce.hr/147276

Publication date:

22.10.2015.

Article data in other languages: croatian

Visits: 3.033 *