{'fraction_non_alphanumeric': 0.013963480128893663, 'fraction_numerical': 0.0, 'mean_word_length': 4.825, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A bi-objective guillotine cutting problem of stamping strips of equal circles

Some factories use the cutting and stamping processes to divide stock plates into circles to make products. A guillotine machine cuts the plate into strips in the cutting process and then a stamping press punches out circles from the strips in the stamping process. The circles in a strip have the same size. The number of rows of circles in each strip is limited. Under these constraints, this paper addresses the following primary objective: to cut a plate by a guillotine method so that the maximal number of circles is obtained. Then the secondary objective should be optimized: the cutting layout should use a minimal number of strips. The problem is formulated as a bi-objective optimization problem and a recursive algorithm is presented for it. The computational results indicate that the algorithm can efficiently simplify the cutting process.