Birleşik Stok Kesme ve Patern Sıralama Problemi için Bir Sezgisel Algoritma

Year 2018, Volume: 22 Issue: 1, 300 - 305, 16.04.2018

Deniz Tanır , Onur Uğurlu Urfat Nuriyev , Mehmet Kapar

https://doi.org/10.19113/sdufbed.98755

Cited By: 3

Abstract

Stok kesme problemleri üretim ve planlamada en çok karşılaşılan problemlerden biridir. Bu çalışmada, çelik endüstrisindeki şirketlerde karşılaşılan Bir-Boyutlu Stok Kesme Problemi ele alınmıştır. Şirketler, müşterilerinin siparişleri hazırlarken hem kesim paternlerindeki fire miktarının hem de kesim sürecindeki kesicinin değişiminin en küçüklenmesini istemektedir. Bu çalışmada, karşılaşılan bu birleşik problem için yeni bir sezgisel algoritma geliştirilmiştir. Son olarak, önerilen algoritmanın etkinliği gerçek hayat problemleri üzerinde gösterilmiştir.

Keywords

Stok kesme problemi, Süreksizliğin minimizasyonu problemi; Sezgisel algoritmalar; Çelik kesim; Bilgisayar yazılımı

References

• [1] Garey, M. R., Johnson, D. S. 1979. Computers and intractability. A Guide to the Theory of NP-Completeness.
• [2] Aktin, T., Özdemir, R. G. 2009. An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing. European Journal of Operational Research, 196(2), 737-743.
• [3] Yanasse, H. H., Lamosa, M. J. P. 2007. An integrated cutting stock and sequencing problem. European Journal of Operational Research, 183(3), 1353-1370.
• [4] Kantorovich, L. V. 1960. Mathematical methods of organizing and planning production. Management Science, 6(4), 366–422.
• [5] Gilmore, P., Gomory, R. 1963. A linear programming approach to the cutting stock problem, part II. Operations Research, 11, 863–888.
• [6] Gilmore, P., Gomory, R. 1961. A linear programming approach to the cutting stock problem. Operations Research, 9 (6), 848–859.
• [7] Dikili, A. C., Sarz, E., Pek, N. A. 2007. A successive elimination method for one-dimensional stock cutting problems in ship production. Ocean engineering, 34(13): 1841-1849.
• [8] Reinertsen, H., Vossen, T. W. 2010. The one-dimensional cutting stock problem with due dates. European Journal of Operational Research, 201(3), 701-711.
• [9] Cherri, A. C., Arenales, M. N., Yanasse, H. H. 2013. The usable leftover one‐dimensional cutting stock problem-a priority‐in‐use heuristic. International Transactions in Operational Research, 20(2), 189-199.
• [10] Mobasher, A., Ekici, A. 2013. Solution approaches for the cutting stock problem with setup cost. Computers & operations research, 40(1), 225-235.
• [11] Poldi, K. C., De Araujo, S. A. 2016. Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem. Annals of Operations Research, 238(1-2), 497-520.
• [12] Berberler, M. E., Nuriyev, U. G. 2010. A new heuristic algorithm for the one-dimensional cutting stock problem. Appl. Comput. Math, 9(1), 19-30.
• [13] Berberler, M. E., Nuriyev, U., Yıldırım, A. 2011. A software for the one-dimensional cutting stock problem. Journal of King Saud University-Science, 23(1), 69-76.
• [14] Yuen, B. J., Richardson, K. V. 1995. Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research, 84(3), 590-598.
• [15] Yuen, B. J. 1991. Heuristics for sequencing cutting patterns. European Journal of Operational Research, 55(2), 183-190.
• [16] Fink, A., Voß, S. 1999. Applications of modern heuristic search methods to pattern sequencing problems. Computers & Operations Research, 26(1), 17-34.
• [17] Arbib, C., Marinelli, F., Ventura, P. 2016. One‐dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. International Transactions in Operational Research, 23(1-2), 47-63.
• [18] Johnston, R. E. 1984. Cutting patterns and cutter schedules. ASOR Bulletin 4, 3-13.
• [19] MKA Yazılım. https://www.mkasteel.com (Erişim Tarihi: 01 Mart, 2017).
• [20] Jahromi, M. H., Tavakkoli-Moghaddam, R., Makui, A., Shamsi, A. 2012. Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. Journal of Industrial Engineering International, 8(1), 24.
• [21] Tanir, D., Ugurlu, O., Nuriyev, U., Guler, A. 2016. One-dimensional Cutting Stock Problem with Divisible Items. arXiv preprint, arXiv:1606.01419.
• [22] Tanır, D., Ugurlu, O., Nuriyev, U., Guler, A. 2016. Çelik Endüstrisinde Kaşılaşılan İki Amaçlı Bir Boyutlu Stok Kesme Problemi Üzerine. Yöneylem Araştırması ve Endüstri Mühendisliği (YAEM-2016) 36. Ulusal Kongresi, 13-15 Temmuz, İzmir.
• [23] Liang, K.H., Yao, X., Newton, Y., Hoffman, D. 2002. A new evolutionary approach to cutting stock problems with and without contiguity. Comput. Oper. Res., 29(12):1641–59.
• [24] Real Cut Yazılım http://www.optimalprograms.com/realcut1d.htm (Erişim Tarihi: 19 Nisan, 2017).