Buradasınız

Anasayfa » Content

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

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

Journal Name:

  • İstanbul Üniversitesi İşletme Fakültesi Dergisi

Publication Year:

  • 2014

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
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.
Bookmark/Search this post with
Abstract (Original Language): 
Bu çalışmada, istanbul 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.
FULL TEXT (PDF): 
PDF icon arastirmax-arac-rotalama-problemine-tam-sayili-lineer-programlama-modeli-gida-sektorunde-bir-uygulama.pdf
  • 2
251
260
  • Turkish

REFERENCES

References: 

[I] 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).
[II] 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 iç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-Ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms. Parallel Computing, 27, 201-222 (2001).
259
B.Ahlatçıoğlu Özkök, F.C.Kurul/ İstanbul Üniversitesi İşletme Fakültesi Dergisi 43, 2, (2014) 251-260 © 2014
[16] P. Augerat, , J.M. Belenguer, E. Benavent, A. Corberan, D. Naddef, Separating Capacity Constraints in the CVRP Using Tabu Search. European Journal of Operational Research, 106, 2, 546-557 (1998).
[17] P. Toth, D. Vigo, Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem. Discrete Applied Mathematics, 23, 487-512 (2002).
[18] J. Dethloff, Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pick-Up. OR-Spektrum, 23, 1, 79-96 (2001).
[19] G. N. Yücenur, N. Ç. Demirel, A Hybrid Algorithm with Genetic Algorithm and Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problems. Journal of Engineering and Natural Sciences, Sigma 29, 340-350 (2011).
[20] P. M. Özfırat, Exact and Heuristic Algorithms for the Variants of the Vehicle Routing Problem, Ph. D. Thesis, Dokuz Eylul University Graduate School of Natural and Applied Sciences, Izmir, 2008.

Thank you for copying data from http://www.arastirmax.com