×

A simple algorithm for generating optimal equal circle cutting patterns with minimum sections. (English) Zbl 1182.65027

Summary: The cutting and stamping process is often used to divide stock plates into circular items. A guillotine machine cuts the plates into strips at the cutting phase. A stamping press stamps out the items from strips at the stamping phase. Normal patterns have been proposed for the case of equal circles. They consist of sections that contain strips of the same direction. The cutting process can be simplified if the number of sections is reduced.
This short communication presents a simple algorithm for selecting from the optimal patterns the one that has the minimum number of sections. It assumes that the pattern value equals the value of the produced items minus the cost of the sections. The expected solution can be obtained by using an adequate section cost. The algorithm is faster and much simpler to design than a recently published algorithm.

MSC:

65D17 Computer-aided design (modeling of curves and surfaces)
Full Text: DOI

References:

[1] Cui, Y.: Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors, Eur J operat res 169, 30-40 (2006) · Zbl 1077.90522 · doi:10.1016/j.ejor.2004.05.023
[2] Cui, Y.: Generating optimal T-shape cutting patterns for circular blanks, Comput operat res 32, 143-152 (2005) · Zbl 1076.90560 · doi:10.1016/S0305-0548(03)00208-9
[3] Cui, Y.; Zhang, X.; Zhang, H.; Zhao, X.: Dynamic programming algorithms for the cutting problem of equal circles, Proc inst mech eng, part B: J eng manuf 221, 387-395 (2007)
[4] Cui, Y.; Gu, T.; Hu, W.: Simplest optimal guillotine cutting patterns for strips of identical circles, J comb optim 15, 357-367 (2008) · Zbl 1145.90459 · doi:10.1007/s10878-007-9089-x
[5] Agrawal, P. K.: Minimizing trim loss in cutting rectangular blanks of a single size form a rectangular sheet using orthogonal guillotine cuts, Eur J operat res 64, 410-422 (1993) · Zbl 0776.90061 · doi:10.1016/0377-2217(93)90130-F
[6] Tarnowski, A. G.; Terno, J.; Scheithauer, G.: A polynomial time algorithm for the guillotine pallet-loading problem, Infor 32, 275-287 (1994) · Zbl 0824.90117
[7] Arslanov, M. Z.: Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles, Eur J operat res 125, 239-248 (2000) · Zbl 0969.90070 · doi:10.1016/S0377-2217(99)00454-3
[8] Cui, Y.: Dynamic programming algorithms for the optimal cutting of equal rectangles, Appl math model 29, 1040-1053 (2005) · Zbl 1163.90779 · doi:10.1016/j.apm.2005.02.007
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.