Journals / Tekstil ve Konfeksiyon / 2020 / Cilt: 30 - Sayı: 1

SIMULATED ANNEALING ALGORITHM AND IMPLEMENTATION SOFTWARE FOR FABRIC CUTTING PROBLEM

Pages
10–19
Publication Date
2020-03-25
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The results demonstrated that the developed software is capable of making high ratio first quality fabric decision within seconds.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Development of loom technology has significantly increased the efficiency of fabric output in the textile industry.
📊
Key Findings & Data:Therefore, after the production completed, the aim is deciding the cutting location of the product, which has the error map, to increase the first quality product quantity by considering the customer quality parameters.
💡
Conclusion & Impact:The results demonstrated that the developed software is capable of making high ratio first quality fabric decision within seconds.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Cutting algorithms · Simulated Annealing

Abstract

Development of loom technology has significantly increased the efficiency of fabric output in the textile industry. Additionally, preventing the occurrence of defects during the manufacturing process on the fabric is not easy. Therefore, after the production completed, the aim is deciding the cutting location of the product, which has the error map, to increase the first quality product quantity by considering the customer quality parameters. In this article, a decision support system has been developed to help the inspector in the final stage which will also prevent losses. The first of the proposed two algorithms is Simulated Annealing algorithm, which is well known and rendered good results for the different type of problems in the literature, and the other is the K-means method which is frequently used in clustering. In the study, a sample problem is used to explain the adaptation of algorithms to the problem, the results of methods are compared, and design of the experiment is deployed to obtain the best parameter values for the selected algorithm. Finally, the software, which is prepared to use the algorithm in the real production environment, is introduced and the results of the performance analysis are evaluated. The results demonstrated that the developed software is capable of making high ratio first quality fabric decision within seconds.

🔖

Cite This Article

EROĞLU, D. Y., ORBAK, Â. Y. (2020). SIMULATED ANNEALING ALGORITHM AND IMPLEMENTATION SOFTWARE FOR FABRIC CUTTING PROBLEM. Tekstil ve Konfeksiyon, Cilt: 30 - Sayı: 1, 10–19. https://ajindex.com/articles/88919

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. Brandao, F., & Pedroso, J. P. (2014). Fast pattern-based algorithms for cutting stock. Computers & Operations Research, 48, 69-80
  2. De Carvalho, J. V., & Rodrigues, A. G. (1995). An LP-based approach to a two-stage cutting stock problem. European Journal of Operational Research, 84(3), 580-589
  3. Vanderbeck, F. (2000). Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Operations Research, 48(6), 915-926
  4. De Carvalho, J. V. (2002). LP models for bin packing and cutting stock problems. European Journal of Operational Research, 141(2), 253-273
  5. Boschetti, M. A., Mingozzi, A., & Hadjiconstantinou, E. (2002). New upper bounds for the two‐dimensional orthogonal non‐guillotine cutting stock problem. IMA Journal of Management Mathematics, 13(2), 95-119
  6. Bobrowski, P. M. (1990). Branch‐and‐Bound Strategies for the Log Bucking Problem. Decision Sciences, 21(1), 1-13
  7. Haessler, R. W., & Sweeney, P. E. (1991). Cutting stock problems and solution procedures
  8. Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European journal of operational research, 183(3), 1109-1130
  9. Gilmore, P. C., & Gomory, R. E. (1965). Multistage cutting stock problems of two and more dimensions. Operations research, 13(1), 94-120
  10. Faina, L. (1999). An application of simulated annealing to the cutting stock problem. European Journal of Operational Research, 114(3), 542-556
  11. Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European journal of operational research, 141(2), 241-252
  12. Cui, Y., & Zhao, Z. (2013). Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns. European Journal of Operational Research, 231(2), 288-298
  13. Kim, K., Kim, B. I., & Cho, H. (2014). Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry. International Journal of Production Research, 52(19), 5675-5689
  14. Afsharian, M., Niknejad, A., & Wäscher, G. (2014). A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects. OR spectrum, 36(4), 971-999
  15. Javanshir, H., Rezaei, S., Najar, S. S., & Ganji, S. S. (2010). Two dimensional cutting stock management in fabric industries and optimizing the large object’s length. Journal of Research and Reviews in Applied Sciences, 4(3), 243-249.