SavedAdd your journal

Journals / Journal of Optimization and Decision Making(JODM) / 2022 / Volume: 1 Issue: 2

Route Optimization for Delivery at The Bedding Manufacturing Plant

Ahu Ceren Türker(GAZİ ÜNİVERSİTESİ)0009-0007-9401-7979
Aze Banu Koca(GAZİ ÜNİVERSİTESİ)0009-0000-4691-1641
Büşra Değirmenci(GAZİ ÜNİVERSİTESİ)0009-0005-8314-5065
Metehan Geçmen(GAZİ ÜNİVERSİTESİ)0009-0007-3212-4875
Ezgi Aktaş Potur(GAZİ ÜNİVERSİTESİ)0000-0003-0192-8655
Mehmet Kabak(GAZİ ÜNİVERSİTESİ)0000-0002-8576-5349
Pages
—
Publication Date
2022-12-31
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)

Thus, logistics costs and carbon footprint of İşbir Yatak Company were reduced by using the savings algorithm.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, the logistics activities of İşbir Yatak company, which is one of the leading companies in the sponge and mattress sector in Turkey, adopting Green Supply Chain Management were examined and a literature review was made for the study.
📊
Key Findings & Data:Considering the capacity, the number of vehicles needed was determined as 3.
💡
Conclusion & Impact:Thus, logistics costs and carbon footprint of İşbir Yatak Company were reduced by using the savings algorithm.
🔬Design:Review & Systematic Survey
📍Scope:Comprehensive Sample
⚙️Variables:Carbon Footprint · Green Supply Chain Management · Savings Algorithm

Abstract

In this study, the logistics activities of İşbir Yatak company, which is one of the leading companies in the sponge and mattress sector in Turkey, adopting Green Supply Chain Management were examined and a literature review was made for the study. Considering the distribution points of the company in Ankara, a mathematical model is established by choosing the most appropriate solution method to improve daily distribution processes. As a result of the research conducted in this study, which only considers the delivery activities of the company, it was decided that the Clarke and Wright Savings Algorithm would be suitable for the study. The algorithm was run with support from the Python library. Thanks to the saving algorithm, the most suitable route has been determined. As a result of the aforementioned vehicle routing problem, it is aimed to minimize the damage that the company will cause to the environment within the scope of Green Logistics. In this study, the maximum number of points that a vehicle can deliver during the day has been determined. Considering the capacity, the number of vehicles needed was determined as 3. Thus, logistics costs and carbon footprint of İşbir Yatak Company were reduced by using the savings algorithm.

🔖

Cite This Article

Türker, A. C., Koca, A. B., Değirmenci, B., Geçmen, M., Potur, E. A., Kabak, M. (2022). Route Optimization for Delivery at The Bedding Manufacturing Plant. Journal of Optimization and Decision Making(JODM), Volume: 1 Issue: 2. https://ajindex.com/articles/1629948

📄 Full Text PDF Viewer

📄

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

References (33)

  1. Ahmed, O. M. A., Kahramanlı, H. (2018). Meta-Heuristic Solution Approaches for Traveling Salesperson Problem, International Journal of Applied Mathematics Electronics and Computers, 6(3), 21-26. https://dergipark.org.tr/en/pub/ijamec/issue/39103/458948
  2. Akpan, N. P., & Onyebuchi, U. R. (2016). An Application of Metric Method of Solving Travelling Salesman Routing Problem to Table Water Company, IOSR Journal of Mathematics, 12, 115-123. Doi: 10.9790/5728-120402115123
  3. Altabeeb, A. M., Mohsen, A. M., Abualigah, L., & Ghallab, A. (2021). Solving Capacitated Vehicle Routing Problem Using Cooperative Firefly Algorithm, Applied Soft Computing, 108, 107403. https://doi.org/10.1016/j.asoc.2021.107403
  4. Altınkemer, K., & Gavish, B. (1991). Parallel Savings Based Heuristics for The Delivery Problem, Operations research, 39(3), 456-469. https://doi.org/10.1287/opre.39.3.456
  5. Amil, V., Kahraman, Ü. O. (2019). Rotalama Yerleştirme Problemine Sezgisel Yaklaşım, Bilgi Sosyal Bilimler Dergisi, 21(1), 108-119. https://dergipark.org.tr/en/pub/bilgisosyal/issue/47169/548152
  6. Aydın, R. (2019). Çok Kriterli Karar Verme Teknikleriyle Bir Lojistik Şirketinde Taşıma Türünün Değerlendirilmesi, PhD Thesis, Marmara Üniversitesi. https://www.proquest.com/openview/41b3a159a980131db3d0cebbdedfef29/1?pqorigsite=gscholar&cbl=2026366&diss=y
  7. Baldi, M. M., Manerba, D., Perboli, G., & Tadei, R. (2019). A Generalized Bin Packing Problem for Parcel Delivery in last-mile Logistics, European Journal of Operational Research, 274(3), 990-999. https://doi.org/10.1016/j.ejor.2018.10.056
  8. Clarke, G., & Wright, J. W. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations research, 12(4), 568-581. https://doi.org/10.1287/opre.12.4.568
  9. Crainic, T. G., Gobbato, L., Perboli, G., Rei, W., Watson, J. P., & Woodruff, D. L. (2013). Bin Packing Problems with Uncertainty on item Characteristics: An Application to Capacity Planning in Logistics, Procedia-Social and Behavioral Sciences, 111, 654-662. https://doi.org/10.1016/j.sbspro.2014.01.099
  10. Crainic, T. G., Gobbato, L., Perboli, G., & Rei, W. (2016). Logistics Capacity Planning: A Stochastic Bin Packing Formulation and a Progressive Hedging Meta-Heuristic, European Journal of Operational Research, 253(2), 404-417. https://doi.org/10.1016/j.ejor.2016.02.040
  11. Çolak, S., & Güler, H. (2009). Dağıtım Rotaları Optimizasyonu için Meta-Sezgisel Bir Yaklaşım, Gazi Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, 11(2), 171-190. https://dergipark.org.tr/en/pub/gaziuiibfd/issue/28325/301005
  12. Dökeroğlu, T. (2017). Bir Boyutlu Kutulama Probleminin En İyilenmesi için Hiper-Sezgisel Paralel bir Algoritma, Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 19(1), 1-11. https://doi.org/10.25092/baunfbed.319992
  13. Dündar, A. O., Öztürk, R. (2020). Kargo Dağıtım Operasyonunun Gezgin Satıcı Problemi ve Çoklu Gezgin Satıcı Problemi Kullanılarak Yeniden Düzenlenmesi Üzerine bir Uygulama, Erciyes Üniversitesi Sosyal Bilimler Enstitüsü Dergisi, (49), 41-54. https://dergipark.org.tr/en/pub/erusosbilder/issue/58345/841699
  14. Eliiyi, U., Eliiyi, D. T. (2009). Applications of Bin Packing Models through the Supply Chain, International Journal of Business and Management Studies, 1(1), 11-19. https://dergipark.org.tr/en/pub/ijbms/issue/26072/274773
  15. Gencer, C. & Eryavuz, M.,. (2001). Araç Rotalama Problemine Ait bir Uygulama, Süleyman Demirel Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, 6(1). https://dergipark.org.tr/en/download/article-file/195138
  16. Gharehchopogh, F. S., & Abdollahzadeh, B. (2022). An Efficient Harris Hawk Optimization Algorithm for Solving the Travelling Salesman Problem, Cluster Computing, 25(3), 1981-2005. https://doi.org/10.1007/s10586-021-03304-5
  17. Kang, J., & Park, S. (2003). Algorithms for the Variable Sized Bin Packing Problem, European Journal of Operational Research, 147(2), 365-372. https://doi.org/10.1016/S0377-2217(02)00247-3
  18. Kaçmaz, O. (2020) Önce Dağıt Sonra Topla Araç Rotalama Problemleri ve Bir Bayinin Rota Planlaması, Master's thesis, Süleyman Demirel Üniversitesi Sosyal Bilimler Enstitüsü. https://acikbilim.yok.gov.tr/handle/20.500.12812/260720
  19. Kosif, B., Ekmekçi, İ. (2012). Araç Rotalama Sistemleri ve Tasarruf Algoritması Uygulaması, İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi, 11 (21), 41-51. https://dergipark.org.tr/en/pub/ticaretfbd/issue/21361/229133
  20. Kutlu, B. H., Ercoşkun, Ö. Y. (2021). Türkiye’deki Lojistik Firmalarının Yeşil Lojistik Uygulamaları Üzerinden Değerlendirmesi, Dokuz Eylül Üniversitesi Mimarlık Fakültesi Dergisi, 2(1), 52-71. https://dergipark.org.tr/en/pub/eksen/issue/62602/947495
  21. Lodi, A., Martello, S., & Vigo, D. (2002). Heuristic Algorithms for the Three-Dimensional Bin Packing Problem, European Journal of Operational Research, 141(2), 410-420. https://doi.org/10.1016/S0377-2217(02)00134-0
  22. Martello, S., Pisinger, D., & Vigo, D. (2000). The Three-Dimensional Bin Packing Problem. Operations Research, 48(2), 256-267. https://doi.org/10.1287/opre.48.2.256.12386
  23. Mrad, M., Bamatraf, K., Alkahtani, M., & Hidri, L. (2021). Genetic Algorithm Based on Clark & Wright’s Savings Algorithm for Reducing the Transportation Cost in a Pooled Logistic System, In Proceedings of The International Conference on Industrial Engineering and Operations Management, 2432-2439. http://www.ieomsociety.org/brazil2020/papers/728.pdf
  24. Okur, E., Atlas, M. (2020). Solution of Vehicle Routing Problem with Genetic Algorithm, Anadolu University Journal of Social Sciences, 20(3), 227-254. https://doi.org/10.1016/S0305-0548(02)00051-5
  25. Otis, D. K. (1998). A Tabu Search: Implementation of The Multi-Depot, Capacitated Vehicle Routing Problem with Backhauls. https://core.ac.uk/download/pdf/228642220.pdf
  26. Reimann, M., Doerner, K., & Hartl, R. F. (2004). D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research, 31(4), 563 -591.https://doi.org/10.1016/S0305-0548(03)00014-5
  27. Şahin, Y., & Eroğlu, A. (2014). Metaheuristic Methods for Capacitated Vehicle Routing Problem: Literature Review, Suleyman Demirel University, The Journal of Faculty of Economics and Administrative Sciences, 19(4), 337-355.
  28. Tekil, S., Özkır, V. (2016). Konteyner Yükleme Problemlerinin İncelenmesi ve Lojistik Sektöründe bir Uygulama, Toros Üniversitesi İİSBF Sosyal Bilimler Dergisi, 3(5), 213-224. https://dergipark.org.tr/en/pub/iisbf/issue/24455/259168
  29. Toth, P., & Vigo, D. (1997). An Exact Algorithm for the Vehicle Routing Problem with Backhauls. Transportation Science, 31(4), 372-385. https://doi.org/10.1287/trsc.29.2.143
  30. Toth, P., & Vigo, D. (2002). Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem, Discrete Applied Mathematics, 123(1), 487-512. https://doi.org/10.1016/S0166-218X(01)00351-1
  31. Yarlıkaş, S., Can, Z. V. (2020). Yeşil Tedarik Zinciri Yönetimini Etkileyen Faktörlerin Önem Sıralamalarının SWARA ve Copeland Yöntemleri ile Belirlenmesi, Eskişehir Osmangazi Üniversitesi İİBF Dergisi, 14, 899-924. https://doi.org/10.17153/oguiibf.519150
  32. Yalçın, G. D., Erginel, N. (2015). Fuzzy Multi-Objective Programming Algorithm for Vehicle Routing Problems with Backhauls. Expert Systems with Applications, 42(13), 5632-5644. https://doi.org/10.1016/j.eswa.2015.02.060
  33. Yüzgeç, U., Kılıç, H. (2018). Kutulama Problemi İçin Geliştirilmiş Karınca Aslanı Optimizasyonu Algoritması, Türkiye Bilişim Vakfı Bilgisayar Bilimleri ve Mühendisliği Dergisi, 11(2), 13-19. https://dergipark.org.tr/en/pub/iisbf/issue/24455/259168