ABDULLAH OKTAY DÜNDAR, MEHMET AKİF ŞAHMAN, MAHMUT TEKİN, MUSTAFA SERVET KIRAN

A Comparative Application Regarding the Effects of Traveling Salesman Problem on Logistics Costs

The necessity of transporting goods from production facilities to buyers requires every company to manage logistics. While the quantity of products ordered has been decreasing in recent years, the number of orders has been increasing. This situation leads to higher logistics costs and more attempts to control logistics costs by business managers. One way to decrease logistics costs is the optimization of traveled distances. The Traveling Salesman Problem (TSP) attempts to optimize travel distances by changing the order of the locations to be visited. By doing so, it reduces the logistics costs associated with travel distances. However, there are also some parameters of logistics costs that are not related to travel distances. This paper examines the effects of optimization results by TSP on logistics costs, using seven different methods to consider a real logistics problem, and comparing the results. Then it discusses the variation in logistics costs due to TSP.

PDF

___

[1] Kofteci, S. and H. Gercek, A Binary Logit Model Based on Logistics Costs for Mode Choice Decisions in Freight Transportation. Teknik Dergi, 2010. 21(3): p. 5087-5112.

[2] Gümüş, Y., Üretim İşletmelerinde Lojistik Maliyetlerinin Faaliyet Tabanlı Maliyetleme Yöntemine Göre Hesaplanması ve Bir Uygulama. İzmir: Dokuz Eylül Üniversitesi Sosyal Bilimler Enstitüsü İşletme Anabilim Dalı Basılmamış Doktora Tezi, 2007.

[3] Başkaya, Z., Tamsayılı programlama algoritmaları ve bilgisayar uygulamalı problem çözümleri. 2005: Ekin Kİtabevi.

[4] Potvin, J.-Y., Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 1996. 63(3): p. 337-370.

[5] Kara, I., et al. Genelleştirilmiş Gezgin Satıcı Probleminin Polinom Büyüklükte Karar Modellerinin Sayısal Karşılaştırma Sonuçları. in 10. Ekonomi ve İstatistik Sempozyumu. 2009.

[6] Bixby, D.A.R., V. Chvtal, and W. Cook, The Traveling Salesman Problem: A Computational Study. 2006, Princeton University Press.

[7] Applegate, D.L., et al., The traveling salesman problem: a computational study. 2006: Princeton university press.

[8] Johnson, D.S. Local optimization and the traveling salesman problem. in International colloquium on automata, languages, and programming. 1990. Springer.

[9] Aytekin, M.A. and T.E. Kalaycı, Gezgin Satıcı Probleminin İkili Kodlanmış Genetik Algoritmalarla Çözümünde Yeni Bir Yaklaşım. Muğla Üniversitesi Akademik Bilişim Konferansı, 2010: p. 10-12.

[10] Kim, B.-I., S. Kim, and S. Sahoo, Waste collection vehicle routing problem with time windows. Computers & Operations Research, 2006. 33(12): p. 3624-3642.

[11] Fügenschuh, A., Solving a school bus scheduling problem with integer programming. European Journal of Operational Research, 2009. 193(3): p. 867-884.

[12] Günaydın, D., Türk Silahlı Kuvvetlerinde Ring Taşımacılık Faaliyetlerinin Maliyet Etkinlik Analizi ve Ulaştırma Modelleri Yardımıyla Güzergah Optimizasyonu. 2006, Yüksek Lisans Tezi. Marmara Üniversitesi, 99 s., İstanbul.

[13] Puvanachandran, V., Distribution of vehicle operating costs/benefits to a rural population. Transportation, 1997. 24(3): p. 333-343.

[14] Berthelot, C.F., et al., Mechanistic-probabilistic vehicle operating cost model. Journal of transportation engineering, 1996. 122(5): p. 337- 341.

[15] Öztürk, Z., Karayolu Şehiriçi Trafikte Tikanma Maliyeti. 2005.

[16] Zhou, Y., et al., Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Computing and Applications, 2017: p. 1-16.

[17] Li, H. and B. Alidaee, Tabu search for solving the black-and-white travelling salesman problem. Journal of the Operational Research Society, 2016. 67(8): p. 1061-1079.

[18] Ezugwu, A.E.-S., A.O. Adewumi, and M.E. Frîncu, Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Systems with Applications, 2017. 77: p. 189-210.

[19] Mahi, M., Ö.K. Baykan, and H. Kodaz, A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Applied Soft Computing, 2015. 30: p. 484-490.

[20] Ha, Q.M., et al., On the min-cost traveling salesman problem with drone. Transportation Research Part C: Emerging Technologies, 2018. 86: p. 597-621.

[21] Veenstra, M., et al., The pickup and delivery traveling salesman problem with handling costs. European Journal of Operational Research, 2017. 257(1): p. 118-132.

[22] Roberti, R. and M. Wen, The electric traveling salesman problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 2016. 89: p. 32-52.

[23] Laporte, G., A concise guide to the traveling salesman problem. Journal of the Operational Research Society, 2010. 61(1): p. 35-40.

[24] Wang, Z., et al., Uncertain multiobjective traveling salesman problem. European Journal of Operational Research, 2015. 241(2): p. 478-489.

[25] Chen, S.-M. and C.-Y. Chien, Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Systems with Applications, 2011. 38(12): p. 14439-14450.

[26] Dorigo, M., Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano, 1992.

[27] Eberhart, R. and J. Kennedy. A new optimizer using particle swarm theory. in MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science. 1995. Ieee.

[28] Huilian, F., Discrete particle swarm optimization for TSP based on neighborhood. Journal of Computational Information Systems, 2010. 6(10): p. 3407-3414.

[29] Karaboga, D., An idea based on honey bee swarm for numerical optimization. 2005, Technical report-tr06, Erciyes university, engineering faculty, computer ….

[30] Kıran, M.S., H. İşcan, and M. Gündüz, The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem. Neural computing and applications, 2013. 23(1): p. 9-21.