A New Variant of the Cutting Path Determination Problem
Industrial Engineering in the Era of Industry 5.0, Fethi Calisir,Selim Zaim,Enes Eryarsoy,Murat Durucu, Editör, Springer, London/Berlin , İstanbul, ss.226-237, 2026
- Yayın Türü: Kitapta Bölüm / Mesleki Kitap
- Basım Tarihi: 2026
- Doi Numarası: 10.1007/978-3-032-24958-6
- Yayınevi: Springer, London/Berlin
- Basıldığı Şehir: İstanbul
- Sayfa Sayıları: ss.226-237
- Editörler: Fethi Calisir,Selim Zaim,Enes Eryarsoy,Murat Durucu, Editör
- Atatürk Üniversitesi Adresli: Evet
Özet
Cutting path determination problem (CPDP) is an important problem encountered especially in clothing, footwear, metalwork, and furniture industries. The objective of the problem is to find the shortest cutting path to obtain small-sized parts from large-sized objects. For this purpose, firstly, it is essential that the small-sized objects are well placed. These placed parts should be cut in such a way as to give a minimum waste rate. In this paper, a solution approach for a different version of the CPDP is proposed by using the approach of the parting routing problem to optimize the cutting route. In this problem, we consider the case where the cutting cost value is variable for each pass through a partition. Moreover, since there is no requirement to return to the origin in CPDP, the open-ended Chinese postman problem, which is a variant of the arc routing problem, is considered for the solution of the problem. The mathematical model of the problem is developed and tested for products manufactured in a company operating in the furniture industry. The mathematical model was coded in GAMS and solved using the CPLEX solver. Within the scope of the study, 30 different problem data sets were obtained from the company, and these problems were solved with the proposed mathematical model, and it was shown that an average saving of 27% was achieved on cutting routes.