SavedAdd your journal

Journals / International Journal of Intelligent Systems and Applications in Engineering / 2019 / Cilt: 7 - Sayı: 4

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

ABDULLAH OKTAY DÜNDAR
MEHMET AKİF ŞAHMAN
MAHMUT TEKİN
MUSTAFA SERVET KIRAN
Pages
207–215
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)

Then it discusses the variation in logistics costs due to TSP.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The necessity of transporting goods from production facilities to buyers requires every company to manage logistics.
📊
Key Findings & Data:One way to decrease logistics costs is the optimization of traveled distances.
💡
Conclusion & Impact:Then it discusses the variation in logistics costs due to TSP.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Özet

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.

🔖

Cite This Article

DÜNDAR, A. O., ŞAHMAN, M. A., TEKİN, M., KIRAN, 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, Cilt: 7 - Sayı: 4, 207–215. https://ajindex.com/articles/160245

📄 Full Text PDF Viewer

📄

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

References (16)

  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. 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
  3. Başkaya, Z., Tamsayılı programlama algoritmaları ve bilgisayar uygulamalı problem çözü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 Büyüklü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 Çözümü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. Fügenschuh, A., Solving a school bus scheduling problem with integer programming. European Journal of Operational Research, 2009. 193(3): p. 867-884
  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
  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. Öztü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 App