SavedAdd your journal

Journals / Cumhuriyet Üniversitesi İktisadi ve İdari Bilimler Dergisi / 2017 / Cilt: 18 - Sayı: 1

Solution of The Vehicle Rotation Problem With Saving Algorithm: Application For a Bread Bakery In Sivas

ARAÇ ROTALAMA PROBLEMİNİN TASARRUF ALGORİTMASI İLE ÇÖZÜMÜ: SİVAS’TA BİR EKMEK FIRINI İÇİN UYGULAMA

Ali Oğuz BAYRAKÇIL
Alptekin ULUTAŞ
Mustafa Bilgehan KUTLU
Pages
185–197
Publication Date
2022-10-11
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)

While calculating the operations in savings algorithm, any special software has not been used, calculations were done by MS Excel

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Commodity transport is a significant cost item affecting the total cost of the product.
📊
Key Findings & Data:Vehicle routing problem revealed 60 years ago to reduce the cost of commodity transport.
💡
Conclusion & Impact:While calculating the operations in savings algorithm, any special software has not been used, calculations were done by MS Excel
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Commodity transport is a significant cost item affecting the total cost of the product. Vehicle routing problem revealed 60 years ago to reduce the cost of commodity transport. In literature, there are many approaches and models proposed to solve this problem. In this study, savings algorithm was proposed to solve vehicle routing problem for a bakery in Sivas. The aim of being used savings algorithm is simple and practical for real life problems. The bakery used as an example in this study supplies breads to 15 Markets. To solve this problem, first, the distance matrix was obtained and then the saving values from this matrix were calculated. As a result, by means of savings algorithm, the fuel cost of 10 Turkish Liras per day has been saved. While calculating the operations in savings algorithm, any special software has not been used, calculations were done by MS Excel

Özet

Ticari mal taşımacılığı, ürünün toplam maliyetini etkileyen önemli bir maliyet unsurudur. Araç rotalama problemi 60 yıl önce ticari mal taşımacılığının maliyetini azaltmak hedefiyle ortaya çıktı. Literatürde bu sorunu çözmek için önerilen birçok yaklaşım ve model vardır. Bu çalışmada, Sivas'ta bir fırının araç rotalama problemini çözmek için tasarruf algoritması önerildi. Tasarruf algoritmasının kullanılma amacı, gerçek hayat problemleri için basit ve pratik olmasındandır. Bu çalışmada örnek olarak kullanılan fırın 15 Markete ekmek tedarik ediyor. Bu sorunu çözmek için öncelikle mesafeler matrisi elde edildi ve sonra bu matristen tasarruf miktarı değerleri hesaplandı. Sonuç olarak, tasarruf algoritması sayesinde günlük 10 Türk Lirası yakıt maliyeti tasarruf edilmiştir. Tasarruf algoritması işlemlerini hesaplarken, herhangi bir özel yazılım kullanılmamış; hesaplamalar MS Excel ile yapılmıştır

🔖

Cite This Article

BAYRAKÇIL, A. O., ULUTAŞ, A., KUTLU, M. B. (2022). Solution of The Vehicle Rotation Problem With Saving Algorithm: Application For a Bread Bakery In Sivas. Cumhuriyet Üniversitesi İktisadi ve İdari Bilimler Dergisi, Cilt: 18 - Sayı: 1, 185–197. https://ajindex.com/articles/480666

📄 Full Text PDF Viewer

📄

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

References (13)

  1. AI, T. J., & KACHITVICHYANUKUL, V. (2009). Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering, 56(1), 380-387.
  2. ALTINEL, İ. K., & ÖNCAN, T. (2005). A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. Journal of the Operational Research Society, 56(8), 954-961.
  3. BALDACCI, R., MİNGOZZİ, A., ROBERTİ, R., & CALVO, R. W. (2013). An exact algorithm for the two-echelon capacitated vehicle routing problem. Operations Research, 61(2), 298-314.
  4. CHEN, A. L., YANG, G. K., & WU, Z. M. (2006). Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University-Science A, 7(4), 607-614.
  5. CHRISTIANSEN, C. H., & LYSGAARD, J. (2007). A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters, 35(6), 773-781.
  6. 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.
  7. DANTZIG, G. B., & RAMSER, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
  8. DOYURAN, T., & ÇATAY, B. (2011). A robust enhancement to the Clarke– Wright savings algorithm. Journal of the Operational Research Society, 62(1), 223-231.
  9. DÜZAKIN, E., & DEMİRCİOĞLU, M. (2009). Araç Rotalama Problemleri ve Çözüm Yöntemleri. Iktisadi ve Idari Bilimler Fakültesi, Isletme Bölümü, Çukurova Universitesi, Adana, Turkey. ESCOBAR, J. W., LINFATI, R., Toth, P., & Baldoquin, M. G. (2014). A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of Heuristics, 20(5), 483-509.
  10. FUKASAWA, R., LONGO, H., LYSGAARD, J., DE ARAGÃO, M. P., REIS, M., UCHOA, E., & WERNECK, R. F. (2006). Robust branch-and-cut-andprice for the capacitated vehicle routing problem. Mathematical programming, 106(3), 491-511.
  11. GENDREAU, M., IORI, M., Laporte, G., & Martello, S. (2008). A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints. Networks, 51(1), 4-18.
  12. GOUNARIS, C. E., WIESEMANN, W., & FLOUDAS, C. A. (2013). The robust capacitated vehicle routing problem under demand uncertainty. Operations Research, 61(3), 677-693.
  13. GOKSAL, F. P., KARAOGLAN, I., & ALTİPARMAK, F. (2013). A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Computers &