Optimal algorithm of two dimensional cutting stock for circular pieces with blade length constraint
The shearing and punching processes are often applied in cutting sheet metal into circular pieces to produce various parts by sheet metal manufacturing enterprises, and the excellent cutting stock algorithm can improve the material utilization. Therefore, an algo-rithm of circular pieces cutting stock with blade length constraint was proposed. The plate was divided into four blocks by the algorithm, each block contained strips with the same length and direction, and each strip contained identical circular pieces. Firstly, unconstrained algorithm and constrained algorithm for the generation of four-block layout were constructed by the recursive technique, and the uncon-strained layout algorithm was iteratively called by linear programming algorithm to generate a cutting plan of the first part. Then, constrain-ed algorithm was orderly called by sequential heuristic algorithm to generate a cutting plan of the second part. Finally, the cutting plan of two parts were combined to form the final one. The results of numerical simulation experiments show that the sheet utilization rate of this algorithm is higher than that of the literature algorithm.
NETL
NSTL
万方数据
维普
