SavedAdd your journal

Journals / Mehmet Akif Ersoy Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi / 2023 / Cilt: 10 - Sayı: 1

AN INTEGER LINEAR PROGRAMMING MODEL FOR THE THREE-DIMENSIONAL MARBLE CUTTING PROBLEM

ÜÇ BOYUTLU MERMER KESME PROBLEMİ İÇİN BİR TAM SAYILI DOĞRUSAL PROGRAMLAMA MODELİ

Gokhan YİLMAZ
Yusuf ŞAHİN
Pages
658–669
Publication Date
2023-03-29
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 model is solved using data from a marble factory.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Marbles extracted in blocks from marble quarries go through a number of cutting processes in factories.
📊
Key Findings & Data:The blocks are first cut into plates.
💡
Conclusion & Impact:The model is solved using data from a marble factory.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Mermer kesme problemi · Tam sayılı doğrusal programlama · Atık minimizasyonu.

Abstract

Marbles extracted in blocks from marble quarries go through a number of cutting processes in factories. The blocks are first cut into plates. Then, the final product, tiles, is obtained from these plates. During the production of both slabs and tiles, the product dimensions requested by the customers are taken into account. This situation causes the creation of different cutting plans for each demand. The most important point that is taken into consideration while creating cutting plans is minimizing the amount of waste. In order to minimize the amount of waste, a re-cutting plan must be determined for each block and order to be cut. In this study, the focus is on creating a cutting plan that will minimize the amount of waste marble. For this, integer linear programming model has been developed. The developed model aims to minimize the amount of waste that will arise in both the plate production process and the tile production process. The model is solved using data from a marble factory.

Özet

Mermer ocaklarından bloklar halinde çıkarılan mermerler fabrikalarda birtakım kesim işleminden geçmektedir. Bloklar ilk önce plakalar halinde kesilmektedir. Daha sonra bu plakalardan nihai ürün olan fayanslar elde edilmektedir. Hem plaka hem de fayans üretimi esnasında müşterilerin talep ettiği ürün boyutları dikkate alınmaktadır. Bu durum her talep için farklı kesim planlarının oluşturulmasına neden olmaktadır. Kesim planları oluşturulurken dikkat edilen en önemli husus atık miktarının en aza indirilmesidir. Atık miktarının minimize edilebilmesi için kesilecek her blok ve sipariş için yeniden kesim planının belirlenmesi gerekmektedir. Bu çalışmada atık mermer miktarını en aza indirecek kesim planını oluşturmaya odaklanılmıştır. Bunun için tam sayılı doğrusal programlama modeli geliştirilmiştir. Geliştirilen model hem plaka üretim sürecinde hem de fayans üretim sürecinde ortaya çıkacak atık miktarını en aza indirmeyi amaçlamıştır. Model bir mermer fabrikasının verileri kullanılarak çözülmüştür.

🔖

Cite This Article

YİLMAZ, G., ŞAHİN, Y. (2023). AN INTEGER LINEAR PROGRAMMING MODEL FOR THE THREE-DIMENSIONAL MARBLE CUTTING PROBLEM. Mehmet Akif Ersoy Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, Cilt: 10 - Sayı: 1, 658–669. https://ajindex.com/articles/887177

📄 Full Text PDF Viewer

📄

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

References (12)

  1. Akbulut, H., ve Gürer, C. (2007). Use of aggregates produced from marble quarry waste in asphalt pavements. Building and environment, 42(5), 1921-1930.
  2. Aksu, D. T., Durak B. (2016). A dynamic programming algorithm for the online cutting problem with defects and quality grades. IFAC-PapersOnLine 49(12), 17-22.
  3. Alves, C., Bras, P., Valerio de Carvalho, J. M., ve Pinto, T. (2012). A variable neighborhood search algorithm for the leather nesting problem. Mathematical Problems in Engineering, 2012.
  4. Baykasoğlu, A., ve Özbel, B. K. (2021). Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches. Computers ve Operations Research, 128, 105173. Bilgin, N., Yeprem, H. A., Arslan, S., Bilgin, A., Günay, E., ve Marşoglu, M. (2012). Use of waste marble powder in brick industry. Construction and Building Materials, 29, 449-457. Brás, P., Alves, C., de Carvalho, J. V., ve Pinto, T. (2010). Exploring new constructive algorithms for the leather nesting problem in the automotive industry. IFAC Proceedings Volumes, 43(17), 225-230.
  5. Diyaley, S., ve Chakraborty, S. (2022). Metaheuristics-based nesting of parts in sheet metal cutting operation. Operational Research in Engineering Sciences: Theory and Applications, 5(2), 1-16.
  6. Durak, B., Aksu, D. T. (2017). Dynamic programming and mixed integer programming based algorithms for the online glass cutting problem with defects and production targets. International Journal of Production Research, 55(24), 7398-741.
  7. Eroğlu, D. Y., Orbak, A. Y. (2020). Simulated Annealing Algorithm and Implementation Software for Fabric Cutting Problem. Textile and Apparel, 30(1), 10-19.
  8. Ersoy, M., ve Yeşilkaya, L. (2013). Choice of marble block cutting machine by using Analytic Hierarchy Process (AHP) method. International Journal of Information Technology and Business Management, 19(1), 67-80.
  9. Gazi, A., Skevis, G., ve Founti, M. A. (2012). Energy efficiency and environmental assessment of a typical marble quarry and processing plant. Journal of cleaner production, 32, 10-21.
  10. Hebhoub, H., Aoun, H., Belachia, M., Houari, H., ve Ghorbel, E. (2011). Use of waste marble aggregates in concrete. Construction and Building Materials, 25(3), 1167-1171.
  11. Kahraman, B. (2011). Three dimensional cutting problem: an integer programming approach. Mathematical and Computational Applications, 16(1), 105-112.
  12. Maden Tetkik ve Arama Müdürlüğü (2022). Erişim adresi: https://www.mta.