Journals / İstanbul Üniversitesi İşletme Fakültesi Dergisi / 2014 / Cilt: 43 - Sayı: 2

Integer linear programming model for vehicle routing problem and an application in the food industry

Araç rotalama problemine tam sayılı lineer programlama modeli ve gıda sektöründe bir uygulama

Pages
251–260
Publication Date
2022-10-18
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)

The obtained results were compared with the present situation.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, the optimal distribution plan was attempted to establish with determined the most appropriate routes for uses vehicle/vehicles in the distribution of products to customer group of a distribution enterprise, positioned at Mega Center in Istanbul, operating in the food sector.
📊
Key Findings & Data:The model is written by using GAMS 24.1.3 programming language in computer.
💡
Conclusion & Impact:The obtained results were compared with the present situation.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this study, the optimal distribution plan was attempted to establish with determined the most appropriate routes for uses vehicle/vehicles in the distribution of products to customer group of a distribution enterprise, positioned at Mega Center in Istanbul, operating in the food sector. In this study, integer linear programming model written for capacitated vehicle routing problem was used. The model is written by using GAMS 24.1.3 programming language in computer. The obtained results were compared with the present situation.

Özet

Bu çalışmada, İstanbul Mega Center'da konumlanmış, gıda sektöründe faaliyet gösteren bir dağıtım işletmesinin, müşteri grubuna ürün dağıtımında kullandığı araç/araçlar için en uygun rotalar belirlenerek optimal dağıtım planı oluşturulmaya çalışılmıştır. Çalışmada kapasite kısıtlı araç rotalama problemi için yazılmış tamsayılı lineer programlama modeli kullanılmıştır. Model bilgisayar ortamında GAMS 24.1.3 programlama dili kullanılarak yazılmıştır. Elde edilen sonuçlar ile mevcut durum karşılaştırılmıştır.

🔖

Cite This Article

ÖZKÖK, B. A., KURUL, F. C. (2022). Integer linear programming model for vehicle routing problem and an application in the food industry. İstanbul Üniversitesi İşletme Fakültesi Dergisi, Cilt: 43 - Sayı: 2, 251–260. https://ajindex.com/articles/553987

📄 Full Text PDF Viewer

📄

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

References (15)

  1. G.B. Dantzig, J.H.Ramser, The Truck Dispatching Problem. Management Science, 6, 1, 80-91 (1959)
  2. N. Christofides, A. Mignozzi, P. Toth, Exact Algorithms for the Vehicle Routing Problem Based on Spanning Tree and Shortest Path Relaxation. Mathematical Programming, 19, 255-282 (1981)
  3. G.Laporte, Y.Nobert, S. Taillefer, A Branch-and-Bound Algorithm for the Asymmetrical Distance-Constrained Vehicle Routing Problem. Mathematical Modeling, 9, 12, 857-868 (1987)
  4. J. Lysgaard, A. N. Letchford, R. W. Eglese, A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem. Mathematical Programming, 100, 2, 423-445 (2004)
  5. R. Fukasawa, H. Longo, J. Lysgaard, M. P. de Aragão, M. Reis, E. Uchoa, R. F. Werneck, Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Mathematical Programming, 106, 3, 491-511 (2006)
  6. R. Baldacci, N. Christofides, A. Mingozzi, An Exact Algorithm for the Vehicle Routing Problem Based on the Set Partitioning Formulation with Additional Cuts. Mathematical Programming, 115, 2, 351-385 (2008)
  7. E. Hadjiconstantinou, N. Christofides, A. Mingozzi, A New Exact Algorithm for the Vehicle Routing Problem Based on Q-Paths and K-Shortest Paths Relaxations. Annals of Operations Research, 61, 1, 21-43 (1995)
  8. T. K. Ralphs, L. Kopman, W. R. Pulleyblank, L. E. Trotter, On the Capacitated Vehicle Routing Problem. Mathematical Programming, 94, 343-359 (2003)
  9. P. Toth, D. Vigo, Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem. Discrete Applied Mathematics, 23, 487-512 (2002)
  10. M. Eryavuz, C. Gencer, Araç Rotalama Problemine Ait Bir Uygulama. Süleyman Demirel Üniversitesi BF Dergisi, 6, 1, 139-155 (2001)
  11. Z. Başkaya, B. A. Öztürk, Dal Kesme Yöntemi ve Bir Ekmek Fabrikasında Oluşturulan Araç Rotalama Problemine Uygulanması. Uludağ Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, 24, 1, 101-114 (2005)
  12. H. Güvez, M. Dege, T. Eren, Kırıkkale'de Araç Rotalama Problemi ile Tıbbi Atıkların Toplanması. International Journal of Engineering, 4, 1, 41-45 (2012)
  13. Ç. Suna, E. Özkütük, C. Gencer, 'Heterojen Araç Filolu Eş Zamanlı Dağıtım Toplamalı Araç Rotalama Problemi İçin Bir Karar Destek Sistemi. International Journal of Research and Development, 3, 1 (2011)
  14. N. Balakrishnan, Simple Heuristics for the Vehicle Routing Problem with Soft Time Windows. Journal of the Operational Research Society, 44, 3, 279-287 (1993)
  15. C. Rego, Node-E