Research Article
BibTex RIS Cite

An application on reorganization of cargo distribution operations by using travelling salesman problem and multi traveling salesman problem

Year 2020, Issue: 49, 41 - 54, 16.12.2020

Abstract

Businesses focus on controlling costs and delivering products to the market quickly while producing innovative and quality products to meet customer needs. Rapid delivery of its products to customers at the right place at the right time will increase the competitive capabilities of the businesses. From this point of view, logistics activities are becoming more and more important for businesses. In this study, the distribution operation of a distribution company operating in Konya is evaluated in a region. There are 8 sub-regions and 7 distributors are working in the region. Daily distribution routes have been improved with a minimum of 8.55%, a maximum of 13.41% using the Travel Salesman Problem (TSP), and a minimum of 18.08% and a maximum of 22.95% using the Multiple Traveler Dealer Problem (mTSP). According to the results of the study, it is recommended to the companies based on team based routing instead of distributor based routing.

References

  • Atmaca, E. (2012). Bir kargo şirketinde araç rotalama problemi. Tübav Bilim Dergisi, 5(2), 12-27. https://dergipark.org.tr/en/pub/tubav/issue/21527/230973
  • Bektas, T. (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega, 34(3), 209-219. https://doi.org/10.1016/j.omega.2004.10.004
  • Çevik, O., Karaca, S. S., & Özkan, M. (2011). En küçük yayılma modeli ile İç Anadolu Bölgesinde bir kargo firmasının dağıtım güzergâhının belirlenmesi. Karamanoğlu Mehmetbey Üniversitesi Sosyal ve Ekonomik Araştırmalar Dergisi, 2011(2), 1-9.
  • Dündar, A. O., Şahman, M. A., Tekin, M., & Kıran, M. S. (2019). A comparative application regarding the effects of traveling salesman problem on logistics costs. International Journal of Intelligent Systems and Applications in Engineering, 7(4), 207-215. https://doi.org/10.18201/ijisae.2019457232
  • Gaur, V., & Fisher, M. L. (2004). A periodic inventory routing problem at a supermarket chain. Operations Research, 52(6), 813-822. https://doi.org/10.1287/opre.1040.0150
  • Irnich, S. (2008). Solution of real-world postman problems. European journal of operational research, 190(1), 52-67. https://doi.org/10.1016/j.ejor.2007.06.002
  • Kara, I., & Bektas, T. (2006). Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research, 174(3), 1449-1458. https://doi.org/10.1016/j.ejor.2005.03.008
  • Karaboğa, D., & Görkemli, B. (2011, June). A combinatorial artificial bee colony algorithm for traveling salesman problem. In 2011 International Symposium on Innovations in Intelligent Systems and Applications (pp. 50-53). IEEE. https://doi.org/10.1109/INISTA.2011.5946125
  • Knox, J. (1994). Tabu search performance on the symmetric traveling salesman problem. Computers & Operations Research, 21(8), 867-876. https://doi.org/10.1016/0305-0548(94)90016-7
  • Kuzu, S., Önay, O., Şen, U., Tunçer, M., Yıldırım, B., & Keskintürk, T. (2014). Gezgin satıcı problemlerinin metasezgiseller ile çözümü. İstanbul Üniversitesi İşletme Fakültesi Dergisi, 43(1), 1-27.
  • Laporte, G., Nobert, Y., & Desrochers, M. (1985). Optimal routing under capacity and distance restrictions. Operations research, 33(5), 1050-1073. https://doi.org/10.1287/opre.33.5.1050
  • Larsen, A., Madsen, O. B., & Solomon, M. M. (2004). The a priori dynamic traveling salesman problem with time windows. Transportation Science, 38(4), 459-472. https://doi.org/10.1287/trsc.1030.0070
  • Nasr, A. A., El-Bahnasawy, N. A., Attiya, G., & El-Sayed, A. (2019). Using the TSP solution strategy for cloudlet scheduling in cloud computing. Journal of Network and Systems Management, 27(2), 366-387. https://doi.org/10.1007/s10922-018-9469-9
  • Palhares, R. A., & Araujo, M. C. B. (2018). Vehicle routing: application of travelling salesman problem in a dairy. In 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) (pp. 1421-1425). IEEE.
  • 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. https://doi.org/10.1287/opre.31.3.507
  • Ruiz, R., Maroto, C., & Alcaraz, J. (2004). A decision support system for a real vehicle routing problem. European Journal of Operational Research, 153(3), 593-606. https://doi.org/10.1016/S0377-2217(03)00265-0
  • Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., & Wang, Q. X. (2007). Particle swarm optimization-based algorithms for TSP and generalized TSP. Information processing letters, 103(5), 169-176. https://doi.org/10.1016/j.ipl.2007.03.010
  • Sungur, I., Ren, Y., Ordóñez, F., Dessouky, M., & Zhong, H. (2010). A model and algorithm for the courier delivery problem with uncertainty. Transportation Science, 44(2), 193-205. https://doi.org/10.1287/trsc.1090.0303
  • Uğur, A., & Aydin, D. (2009). An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms. Advances in Engineering software, 40(5), 341-349. https://doi.org/10.1016/j.advengsoft.2008.05.004
  • Ünlü N., Uçar E. & Akkuş G.B. (2017). Kargo işlemede zaman pencereli çok araçlı dinamik rotalama. Yönetim Bilişim Sistemleri Dergisi, 3(2), 105-113.

Kargo dağıtım operasyonunun gezgin satıcı problemi ve çoklu gezgin satıcı problemi kullanılarak yeniden düzenlenmesi üzerine bir uygulama

Year 2020, Issue: 49, 41 - 54, 16.12.2020

Abstract

İşletmeler, müşteri ihtiyaçlarını karşılayacak yenilikçi ve kaliteli ürünler üretirken aynı zamanda maliyetleri kontrol etmeye ve hızlı bir şekilde pazara ürün sunmaya odaklanmaktadır. Müşterilere ürünlerinin istenen yer ve zamanda doğru maliyetle hızlı bir şekilde ulaştırması işletmelerin rekabetçi yeteneklerini arttıracaktır. Bu açıdan bakıldığında lojistik faaliyetler işletmeler için her geçen gün daha da önemli hale gelmektedir. Bu çalışmada Konya ilinde faaliyet gösteren bir dağıtım firmasının dağıtım operasyonu bir bölge özelinde değerlendirilmiştir. Ele alınan bölgede 8 alt bölge bulunmakta ve 7 dağıtıcı çalışmaktadır. Günlük dağıtım rotaları Gezgin Satıcı Problemi (GSP) ile minimum %8,55, maksimum %13,41 oranında ve Çoklu Gezgin Satıcı Problemi (ÇGSP) ile minimum %18,08, maksimum %22,95 oranında iyileştirilmiştir. Çalışma sonuçlarına göre işletmelere dağıtıcı bazlı rotalama yerine ekip bazlı rotalama önerilmektedir.

References

  • Atmaca, E. (2012). Bir kargo şirketinde araç rotalama problemi. Tübav Bilim Dergisi, 5(2), 12-27. https://dergipark.org.tr/en/pub/tubav/issue/21527/230973
  • Bektas, T. (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega, 34(3), 209-219. https://doi.org/10.1016/j.omega.2004.10.004
  • Çevik, O., Karaca, S. S., & Özkan, M. (2011). En küçük yayılma modeli ile İç Anadolu Bölgesinde bir kargo firmasının dağıtım güzergâhının belirlenmesi. Karamanoğlu Mehmetbey Üniversitesi Sosyal ve Ekonomik Araştırmalar Dergisi, 2011(2), 1-9.
  • Dündar, A. O., Şahman, M. A., Tekin, M., & Kıran, M. S. (2019). A comparative application regarding the effects of traveling salesman problem on logistics costs. International Journal of Intelligent Systems and Applications in Engineering, 7(4), 207-215. https://doi.org/10.18201/ijisae.2019457232
  • Gaur, V., & Fisher, M. L. (2004). A periodic inventory routing problem at a supermarket chain. Operations Research, 52(6), 813-822. https://doi.org/10.1287/opre.1040.0150
  • Irnich, S. (2008). Solution of real-world postman problems. European journal of operational research, 190(1), 52-67. https://doi.org/10.1016/j.ejor.2007.06.002
  • Kara, I., & Bektas, T. (2006). Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research, 174(3), 1449-1458. https://doi.org/10.1016/j.ejor.2005.03.008
  • Karaboğa, D., & Görkemli, B. (2011, June). A combinatorial artificial bee colony algorithm for traveling salesman problem. In 2011 International Symposium on Innovations in Intelligent Systems and Applications (pp. 50-53). IEEE. https://doi.org/10.1109/INISTA.2011.5946125
  • Knox, J. (1994). Tabu search performance on the symmetric traveling salesman problem. Computers & Operations Research, 21(8), 867-876. https://doi.org/10.1016/0305-0548(94)90016-7
  • Kuzu, S., Önay, O., Şen, U., Tunçer, M., Yıldırım, B., & Keskintürk, T. (2014). Gezgin satıcı problemlerinin metasezgiseller ile çözümü. İstanbul Üniversitesi İşletme Fakültesi Dergisi, 43(1), 1-27.
  • Laporte, G., Nobert, Y., & Desrochers, M. (1985). Optimal routing under capacity and distance restrictions. Operations research, 33(5), 1050-1073. https://doi.org/10.1287/opre.33.5.1050
  • Larsen, A., Madsen, O. B., & Solomon, M. M. (2004). The a priori dynamic traveling salesman problem with time windows. Transportation Science, 38(4), 459-472. https://doi.org/10.1287/trsc.1030.0070
  • Nasr, A. A., El-Bahnasawy, N. A., Attiya, G., & El-Sayed, A. (2019). Using the TSP solution strategy for cloudlet scheduling in cloud computing. Journal of Network and Systems Management, 27(2), 366-387. https://doi.org/10.1007/s10922-018-9469-9
  • Palhares, R. A., & Araujo, M. C. B. (2018). Vehicle routing: application of travelling salesman problem in a dairy. In 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) (pp. 1421-1425). IEEE.
  • 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. https://doi.org/10.1287/opre.31.3.507
  • Ruiz, R., Maroto, C., & Alcaraz, J. (2004). A decision support system for a real vehicle routing problem. European Journal of Operational Research, 153(3), 593-606. https://doi.org/10.1016/S0377-2217(03)00265-0
  • Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., & Wang, Q. X. (2007). Particle swarm optimization-based algorithms for TSP and generalized TSP. Information processing letters, 103(5), 169-176. https://doi.org/10.1016/j.ipl.2007.03.010
  • Sungur, I., Ren, Y., Ordóñez, F., Dessouky, M., & Zhong, H. (2010). A model and algorithm for the courier delivery problem with uncertainty. Transportation Science, 44(2), 193-205. https://doi.org/10.1287/trsc.1090.0303
  • Uğur, A., & Aydin, D. (2009). An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms. Advances in Engineering software, 40(5), 341-349. https://doi.org/10.1016/j.advengsoft.2008.05.004
  • Ünlü N., Uçar E. & Akkuş G.B. (2017). Kargo işlemede zaman pencereli çok araçlı dinamik rotalama. Yönetim Bilişim Sistemleri Dergisi, 3(2), 105-113.
There are 20 citations in total.

Details

Primary Language Turkish
Subjects Business Administration
Journal Section Makaleler / Articles
Authors

Abdullah Oktay Dündar 0000-0002-8508-165X

Resul Öztürk 0000-0003-1493-7315

Publication Date December 16, 2020
Submission Date October 26, 2020
Acceptance Date December 2, 2020
Published in Issue Year 2020 Issue: 49

Cite

APA 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.

ERCİYES AKADEMİ | 2021 | sbedergi@erciyes.edu.tr Bu eser Creative Commons Atıf-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.