A Comparative Application Regarding the Effects of Traveling Salesman Problem on Logistics Costs
AbstractThe 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.
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.
Gümüş, Y., Üretim İşletmelerinde Lojistik Maliyetlerinin Faaliyet Tabanlı Maliyetleme Yöntemine Göre Hesaplanması ve Bir Uygulama. İzmir: Dokuz Eylül Üniversitesi Sosyal Bilimler Enstitüsü İşletme Anabilim Dalı Basılmamış Doktora Tezi, 2007.
Başkaya, Z., Tamsayılı programlama algoritmaları ve bilgisayar uygulamalı problem çözümleri. 2005: Ekin Kİtabevi.
Potvin, J.-Y., Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 1996. 63(3): p. 337-370.
Kara, I., et al. Genelleştirilmiş Gezgin Satıcı Probleminin Polinom Büyüklükte Karar Modellerinin Sayısal Karşılaştırma Sonuçları. in 10. Ekonomi ve İstatistik Sempozyumu. 2009.
Zhou, Y., et al., Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Computing and Applications, 2017: p. 1-16.
Genova, K. and D.P. Williamson, An experimental evaluation of the best-of-many Christofides’ algorithm for the traveling salesman problem. Algorithmica, 2017. 78(4): p. 1109-1130.
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.
Karaboga, D. and B. Gorkemli, Solving Traveling Salesman Problem by Using Combinatorial Artificial Bee Colony Algorithms. International Journal on Artificial Intelligence Tools, 2019. 28(01): p. 1950004.
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.
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.
Tinós, R., K. Helsgaun, and D. Whitley. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. in International Conference on Parallel Problem Solving from Nature. 2018. Springer.
Bixby, D.A.R., V. Chvtal, and W. Cook, The Traveling Salesman Problem: A Computational Study. 2006, Princeton University Press.
Applegate, D.L., et al., The traveling salesman problem: a computational study. 2006: Princeton university press.
Johnson, D.S. Local optimization and the traveling salesman problem. in International colloquium on automata, languages, and programming. 1990. Springer.
Aytekin, M.A. and T.E. Kalaycı, Gezgin Satıcı Probleminin İkili Kodlanmış Genetik Algoritmalarla Çözümünde Yeni Bir Yaklaşım. Muğla Üniversitesi Akademik Bilişim Konferansı, 2010: p. 10-12.
Günaydın, D., Türk Silahlı Kuvvetlerinde Ring Taşımacılık Faaliyetlerinin Maliyet Etkinlik Analizi ve Ulaştırma Modelleri Yardımıyla Güzergah Optimizasyonu. 2006, Yüksek Lisans Tezi. Marmara Üniversitesi, 99 s., İstanbul.
Fügenschuh, A., Solving a school bus scheduling problem with integer programming. European Journal of Operational Research, 2009. 193(3): p. 867-884.
Puvanachandran, V., Distribution of vehicle operating costs/benefits to a rural population. Transportation, 1997. 24(3): p. 333-343.
Berthelot, C.F., et al., Mechanistic-probabilistic vehicle operating cost model. Journal of transportation engineering, 1996. 122(5): p. 337-341.
ÖZTÜRK, Z., Karayolu Şehiriçi Trafikte Tikanma Maliyeti. 2005.
Dorigo, M., Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano, 1992.
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.
Huilian, F., Discrete particle swarm optimization for TSP based on neighborhood. Journal of Computational Information Systems, 2010. 6(10): p. 3407-3414.
Karaboga, D., An idea based on honey bee swarm for numerical optimization. 2005, Technical report-tr06, Erciyes university, engineering faculty, computer ….
Kıran, M.S., H. İşcan, and M. Gündü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.
Copyright (c) 2019 International Journal of Intelligent Systems and Applications in Engineering
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.