Research Article
BibTex RIS Cite

KÜMELEME VE TASARRUF ALGORİTMASI YARDIMIYLA SİPARİŞ TOPLAMA PROBLEMİ ÜZERİNE AMPİRİK BİR UYGULAMA

Year 2022, Volume: 7 Issue: IMISC2021 Special Issue, 80 - 90, 30.03.2022
https://doi.org/10.54452/jrb.1020777

Abstract

Günümüzde tüketiciler ürün satın almakta daha çok çevrimiçi kanalları tercih etmektedir. Bir veya birden fazla kaynaktan toplanan siparişlerin büyük depolardan toplanması ve paketlenmesi bir problem oluşturmaktadır. Şirketler büyük depolardan bu tip sipariş toplama kararlarında daha hızlı hareket etmek zamandan ve emekten tasarruf sağlayacak hesaplamaları uygulama ihtiyacı içerisindedirler. Bu amaçla, söz konusu problemin çözümünde istatistiksel ve analitik olarak kolay öğrenilebilir ve uygulanabilir olması açısından tasarruf algoritması ve kümeleme yöntemini içeren karma bir yöntem kullanımı önerilmiştir. Önerilen bu yöntem sayesinde karmaşık, çok sayıda sipariş ve ürün içeren sipariş listesi hızlı ve optimal şekilde depodan toplanması hazır hale getirilmesi hedeflenmiştir. Çalışmanın uygulama bölümünde simülasyon yardımıyla elde edilen 400 adet sipariş kullanılmıştır. Analizden elde edilen sonuçlara göre bütün siparişler toplam 9 tur ile tamamlandığı ortaya çıkarılmıştır. Çalışmanın farklı bir sonucu ise, iki farklı algoritma kullanılarak rotaların belirlenmesinde hızlı bir sürecin elde edilmesidir.

References

  • Alpar, R. (2017). Uygulamalı Çok Değişkenli İstatistiksel Yöntemler, Detay Yayıncılık. Baskı. Ankara.
  • Aylak, B. L., Okan, O. R. A. L., & Yazıcı, K. (2021). Yapay Zekâ ve Makine Öğrenmesi Tekniklerinin Lojistik Sektöründe Kullanımı. El-Cezeri Journal of Science and Engineering, 8(1), 74-93.
  • Bukchin, Y., Khmelnitsky, E., & Yakuel, P. (2012). Optimizing a dynamic order-picking process. European Journal of Operational Research, 219(2), 335-346.
  • Chang, F. L., Lıu, Z. X., Zheng, X. I. N., & Lıu, D. D. (2007). Research on order picking optimization problem of automated warehouse. Systems Engineering-Theory & Practice, 27(2), 139-143.
  • Daniels, R. L., Rummel, J. L., & Schantz, R. (1998). A model for warehouse order picking. European Journal of Operational Research, 105(1), 1-17.
  • Ding, Q., Hu, X., Sun, L., & Wang, Y. (2012). An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing, 98, 101-107.
  • Doyuran, T., & Çatay, B. (2011). A robust enhancement to the Clarke–Wright savings algorithm. Journal of the Operational Research Society, 62(1), 223-231.
  • Erdoğdu, K. (2021). Çok Bölmeli Araç Rotalama Problemi için Bir Melez Genetik Algoritma . Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi , 23 (67) , 71-80 . DOI: 10.21205/deufmd.2021236706
  • Hu, X., Ding, Q., & Wang, Y. (2010). A hybrid ant colony optimization and its application to vehicle routing problem with time windows. In Life System Modeling and Intelligent Computing (pp. 70-76). Springer, Berlin, Heidelberg.
  • Kim, B. I., Graves, R. J., Heragu, S. S., & Onge, A. S. (2001). Intelligent Agent Based Model for an Industrial Order Picking Problem. In Proc. of the 10th Annual Industrial Engineering Research Conference (pp. 20-22).
  • Kırıs, S., Deliktaş, D., & Üstün, Ö. (2018). İki Amaçlı Genetik Algoritma Yaklaşımı ile Bir Depoda Sipariş Toplama Problemi: Vaka Çalışması. Doğuş Üniversitesi Dergisi, 19(1), 69-77.
  • Liu, Y., Wang, S., Dong, F., & Ren, D. (2013). A two stage method for VRP based on the improved ant colony algorithm. International Journal of Modelling, Identification and Control, 18(2), 174-181.
  • Özçakar, N., Görener, A., & Arıkan, V. (2012). Depolama sistemlerinde sipariş toplama işlemlerinin genetik algoritmalarla optimizasyonu. İstanbul Üniversitesi İşletme Fakültesi İşletme İktisadı Enstitüsü Yönetim Dergisi, 23(71), 118-144.
  • Özoğlu, B. , Çakmak, E. & Koç, T. (2019). Clarke & Wright's Savings Algorithm and Genetic Algorithms Based Hybrid Approach for Flying Sidekick Traveling Salesman Problem . Avrupa Bilim ve Teknoloji Dergisi , Özel Sayı 2019 , 185-192 . DOI: 10.31590/ejosat.637816
  • Pamosoaji, A. K., Dewa, P. K., & Krisnanta, J. V. (2019). Proposed Modified Clarke-Wright Saving Algorithm for Capacitated Vehicle Routing Problem.
  • Pan, H., & Li, W. (2009). Hybrid Genetic-Saving Algorithm and Its Application in Vehicle Routing Problem. In 2009 International Conference on Management and Service Science (pp. 1-4). IEEE.
  • Pansart, L., Catusse, N., & Cambazard, H. (2018). Exact algorithms for the order picking problem. Computers & Operations Research, 100, 117-127.
  • Park, Y. B. (2001). A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. International Journal of Production Economics, 73(2), 175-188.
  • Pessoa, A., Sadykov, R., Uchoa, E., Vanderbeck, F.: A generic exact solver for vehicle routing and related problems. Mathematical Programming B, 183:483-523, 2020. DOI: 10.1007/s10107-020-01523-z
  • Pichpibul, T., & Kawtummachai, R. (2012a). An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem. ScienceAsia, 38(3), 307-318.
  • Pichpibul, T., & Kawtummachai, R. (2012b). New enhancement for Clarke-Wright savings algorithm to optimize the capacitated vehicle routing problem. European Journal of Scientific Research, 78(1), 119-134.
  • Ratliff, H. D., & Rosenthal, A. S. (1983). Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Operations research, 31(3), 507-521.
  • Serhat Saylam, Haldun Süral & Melih Çelik (2017). The Two-Picker Order Picking Problem. International Logistics and Supply Chain Congress, Istanbul, Turkey.
  • Suray, T. U. N. Ç., Kutlu, B., Zincidi, A., & Atmaca, E. (2008). Depo sisteminde sipariş toplama sürecinin iyileştirilmesi. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, 23(2).
  • Ulutaş, A., Bayrakçıl, A. O., & Kutlu, B. (2017). Araç Rotalama Probleminin Tasarruf Algoritması ile Çözümü: Sivas’ta Bir Ekmek Fırını İçin Uygulama. Cumhuriyet Üniversitesi İktisadi ve İdari Bilimler Dergisi, 18(1), 185-197.
  • Won, J., & Olafsson*, S. (2005). Joint order batching and order picking in warehouse operations. International Journal of Production Research, 43(7), 1427-1442.
  • Yao, J. G., & Gao, J. (2018). Dynamic ant colony algorithm based on cw saving Value. In MATEC Web of Conferences (Vol. 246, p. 03015). EDP Sciences.
  • Yazgan, H. R. , Ercan Cömert, S. & Nükte Kılıç, E. (2020). Araç rotalama probleminin sezgisel algoritmalar ile çözülmesi: Bir boya fabrikasında uygulama . Journal of Turkish Operations Management , 4 (2) , 549-563 . Retrieved from https://dergipark.org.tr/en/pub/jtom/issue/59336/851960
  • Yıldız, E. A., Karaoğlan, İ., & Altıparmak, F. (2021). A mixed integer mathematical model and a heuristic approach for two echelon location routing problem with simultaneous pickup and delivery. Journal of the Faculty of Engineering and Architecture of Gazi University, 36(2), 807-822.

AN EMPIRICAL APPLICATION ON THE ORDER PICKING PROBLEM WITH CLUSTERING AND SAVING ALGORITHM

Year 2022, Volume: 7 Issue: IMISC2021 Special Issue, 80 - 90, 30.03.2022
https://doi.org/10.54452/jrb.1020777

Abstract

Today, consumers prefer online channels to buy products. The collection and packaging of orders collected from one or more sources from large warehouses poses a problem. Companies need to act faster in such order picking decisions from large warehouses and apply calculations that will save time and effort. For this purpose, a hybrid method including saving algorithm and clustering method has been proposed in order to be easy to learn and applicable statistically and analytically in the solution of the problem. Thanks to this proposed method, it is aimed to make the order list ready to be collected from the warehouse in a fast and optimal way, including a complex, large number of orders and products. In the application part of the study, 400 orders obtained with the help of simulation were used. According to the results obtained from the analysis, it was revealed that all orders were completed with a total of 9 rounds. Another result of the study is that a fast process is achieved in determining the routes using two different algorithms.

References

  • Alpar, R. (2017). Uygulamalı Çok Değişkenli İstatistiksel Yöntemler, Detay Yayıncılık. Baskı. Ankara.
  • Aylak, B. L., Okan, O. R. A. L., & Yazıcı, K. (2021). Yapay Zekâ ve Makine Öğrenmesi Tekniklerinin Lojistik Sektöründe Kullanımı. El-Cezeri Journal of Science and Engineering, 8(1), 74-93.
  • Bukchin, Y., Khmelnitsky, E., & Yakuel, P. (2012). Optimizing a dynamic order-picking process. European Journal of Operational Research, 219(2), 335-346.
  • Chang, F. L., Lıu, Z. X., Zheng, X. I. N., & Lıu, D. D. (2007). Research on order picking optimization problem of automated warehouse. Systems Engineering-Theory & Practice, 27(2), 139-143.
  • Daniels, R. L., Rummel, J. L., & Schantz, R. (1998). A model for warehouse order picking. European Journal of Operational Research, 105(1), 1-17.
  • Ding, Q., Hu, X., Sun, L., & Wang, Y. (2012). An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing, 98, 101-107.
  • Doyuran, T., & Çatay, B. (2011). A robust enhancement to the Clarke–Wright savings algorithm. Journal of the Operational Research Society, 62(1), 223-231.
  • Erdoğdu, K. (2021). Çok Bölmeli Araç Rotalama Problemi için Bir Melez Genetik Algoritma . Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi , 23 (67) , 71-80 . DOI: 10.21205/deufmd.2021236706
  • Hu, X., Ding, Q., & Wang, Y. (2010). A hybrid ant colony optimization and its application to vehicle routing problem with time windows. In Life System Modeling and Intelligent Computing (pp. 70-76). Springer, Berlin, Heidelberg.
  • Kim, B. I., Graves, R. J., Heragu, S. S., & Onge, A. S. (2001). Intelligent Agent Based Model for an Industrial Order Picking Problem. In Proc. of the 10th Annual Industrial Engineering Research Conference (pp. 20-22).
  • Kırıs, S., Deliktaş, D., & Üstün, Ö. (2018). İki Amaçlı Genetik Algoritma Yaklaşımı ile Bir Depoda Sipariş Toplama Problemi: Vaka Çalışması. Doğuş Üniversitesi Dergisi, 19(1), 69-77.
  • Liu, Y., Wang, S., Dong, F., & Ren, D. (2013). A two stage method for VRP based on the improved ant colony algorithm. International Journal of Modelling, Identification and Control, 18(2), 174-181.
  • Özçakar, N., Görener, A., & Arıkan, V. (2012). Depolama sistemlerinde sipariş toplama işlemlerinin genetik algoritmalarla optimizasyonu. İstanbul Üniversitesi İşletme Fakültesi İşletme İktisadı Enstitüsü Yönetim Dergisi, 23(71), 118-144.
  • Özoğlu, B. , Çakmak, E. & Koç, T. (2019). Clarke & Wright's Savings Algorithm and Genetic Algorithms Based Hybrid Approach for Flying Sidekick Traveling Salesman Problem . Avrupa Bilim ve Teknoloji Dergisi , Özel Sayı 2019 , 185-192 . DOI: 10.31590/ejosat.637816
  • Pamosoaji, A. K., Dewa, P. K., & Krisnanta, J. V. (2019). Proposed Modified Clarke-Wright Saving Algorithm for Capacitated Vehicle Routing Problem.
  • Pan, H., & Li, W. (2009). Hybrid Genetic-Saving Algorithm and Its Application in Vehicle Routing Problem. In 2009 International Conference on Management and Service Science (pp. 1-4). IEEE.
  • Pansart, L., Catusse, N., & Cambazard, H. (2018). Exact algorithms for the order picking problem. Computers & Operations Research, 100, 117-127.
  • Park, Y. B. (2001). A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. International Journal of Production Economics, 73(2), 175-188.
  • Pessoa, A., Sadykov, R., Uchoa, E., Vanderbeck, F.: A generic exact solver for vehicle routing and related problems. Mathematical Programming B, 183:483-523, 2020. DOI: 10.1007/s10107-020-01523-z
  • Pichpibul, T., & Kawtummachai, R. (2012a). An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem. ScienceAsia, 38(3), 307-318.
  • Pichpibul, T., & Kawtummachai, R. (2012b). New enhancement for Clarke-Wright savings algorithm to optimize the capacitated vehicle routing problem. European Journal of Scientific Research, 78(1), 119-134.
  • Ratliff, H. D., & Rosenthal, A. S. (1983). Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Operations research, 31(3), 507-521.
  • Serhat Saylam, Haldun Süral & Melih Çelik (2017). The Two-Picker Order Picking Problem. International Logistics and Supply Chain Congress, Istanbul, Turkey.
  • Suray, T. U. N. Ç., Kutlu, B., Zincidi, A., & Atmaca, E. (2008). Depo sisteminde sipariş toplama sürecinin iyileştirilmesi. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, 23(2).
  • Ulutaş, A., Bayrakçıl, A. O., & Kutlu, B. (2017). Araç Rotalama Probleminin Tasarruf Algoritması ile Çözümü: Sivas’ta Bir Ekmek Fırını İçin Uygulama. Cumhuriyet Üniversitesi İktisadi ve İdari Bilimler Dergisi, 18(1), 185-197.
  • Won, J., & Olafsson*, S. (2005). Joint order batching and order picking in warehouse operations. International Journal of Production Research, 43(7), 1427-1442.
  • Yao, J. G., & Gao, J. (2018). Dynamic ant colony algorithm based on cw saving Value. In MATEC Web of Conferences (Vol. 246, p. 03015). EDP Sciences.
  • Yazgan, H. R. , Ercan Cömert, S. & Nükte Kılıç, E. (2020). Araç rotalama probleminin sezgisel algoritmalar ile çözülmesi: Bir boya fabrikasında uygulama . Journal of Turkish Operations Management , 4 (2) , 549-563 . Retrieved from https://dergipark.org.tr/en/pub/jtom/issue/59336/851960
  • Yıldız, E. A., Karaoğlan, İ., & Altıparmak, F. (2021). A mixed integer mathematical model and a heuristic approach for two echelon location routing problem with simultaneous pickup and delivery. Journal of the Faculty of Engineering and Architecture of Gazi University, 36(2), 807-822.
There are 29 citations in total.

Details

Primary Language Turkish
Subjects Business Administration
Journal Section Articles
Authors

Serkan Eti 0000-0002-4791-4091

Mehmet İnel 0000-0002-6966-3238

Early Pub Date March 28, 2022
Publication Date March 30, 2022
Submission Date November 8, 2021
Acceptance Date March 28, 2022
Published in Issue Year 2022 Volume: 7 Issue: IMISC2021 Special Issue

Cite

APA Eti, S., & İnel, M. (2022). KÜMELEME VE TASARRUF ALGORİTMASI YARDIMIYLA SİPARİŞ TOPLAMA PROBLEMİ ÜZERİNE AMPİRİK BİR UYGULAMA. Journal of Research in Business, 7(IMISC2021 Special Issue), 80-90. https://doi.org/10.54452/jrb.1020777