BibTex RIS Cite

-

Year 2014, Volume: 43 Issue: 2, 251 - 260, 14.11.2014

Feyyaz Kurul Beyza Ahlatcıoğlu Özkök

Abstract

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

Keywords

-

References

  • G.B. Dantzig, J.H.Ramser, The Truck Dispatching Problem. Management Science, 6, 1, 80-91 (1959).
  • 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).
  • 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).
  • 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).
  • 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).
  • 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).
  • 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).
  • T. K. Ralphs, L. Kopman, W. R. Pulleyblank, L. E. Trotter, On the Capacitated Vehicle Routing Problem. Mathematical Programming, 94, 343-359 (2003).
  • P. Toth, D. Vigo, Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem. Discrete Applied Mathematics, 23, 487-512 (2002).
  • M. Eryavuz, C. Gencer, Araç Rotalama Problemine Ait Bir Uygulama. Süleyman Demirel Üniversitesi BF Dergisi, 6, 1, 139-155 (2001).
  • 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).
  • 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).
  • Ç. 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).
  • N. Balakrishnan, Simple Heuristics for the Vehicle Routing Problem with Soft Time Windows. Journal of the Operational Research Society, 44, 3, 279-287 (1993).
  • C. Rego, Node-Ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms. Parallel Computing, 27, 201-222 (2001).
  • 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).
  • P. Toth, D. Vigo, Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem. Discrete Applied Mathematics, 23, 487-512 (2002).
  • J. Dethloff, Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pick-Up. OR-Spektrum, 23, 1, 79-96 (2001).
  • 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).
  • 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.

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

Year 2014, Volume: 43 Issue: 2, 251 - 260, 14.11.2014

Feyyaz Kurul Beyza Ahlatcıoğlu Özkök

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 mathematical 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.

Keywords

vehicle routing integer mathematical programming capacitated vehicle routing problem

References

  • G.B. Dantzig, J.H.Ramser, The Truck Dispatching Problem. Management Science, 6, 1, 80-91 (1959).
  • 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).
  • 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).
  • 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).
  • 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).
  • 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).
  • 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).
  • T. K. Ralphs, L. Kopman, W. R. Pulleyblank, L. E. Trotter, On the Capacitated Vehicle Routing Problem. Mathematical Programming, 94, 343-359 (2003).
  • P. Toth, D. Vigo, Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem. Discrete Applied Mathematics, 23, 487-512 (2002).
  • M. Eryavuz, C. Gencer, Araç Rotalama Problemine Ait Bir Uygulama. Süleyman Demirel Üniversitesi BF Dergisi, 6, 1, 139-155 (2001).
  • 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).
  • 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).
  • Ç. 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).
  • N. Balakrishnan, Simple Heuristics for the Vehicle Routing Problem with Soft Time Windows. Journal of the Operational Research Society, 44, 3, 279-287 (1993).
  • C. Rego, Node-Ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms. Parallel Computing, 27, 201-222 (2001).
  • 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).
  • P. Toth, D. Vigo, Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem. Discrete Applied Mathematics, 23, 487-512 (2002).
  • J. Dethloff, Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pick-Up. OR-Spektrum, 23, 1, 79-96 (2001).
  • 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).
  • 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.
There are 20 citations in total.

Details

Primary Language English
Journal Section Operations Research
Authors

Feyyaz Kurul This is me

Beyza Ahlatcıoğlu Özkök This is me

Publication Date November 14, 2014
Published in Issue Year 2014 Volume: 43 Issue: 2

Cite

APA Kurul, F., & Ahlatcıoğlu Özkök, B. (2014). Integer linear programming model for vehicle routing problem and an application in the food industry. İstanbul Üniversitesi İşletme Fakültesi Dergisi, 43(2), 251-260.
AMA Kurul F, Ahlatcıoğlu Özkök B. Integer linear programming model for vehicle routing problem and an application in the food industry. İstanbul Üniversitesi İşletme Fakültesi Dergisi. November 2014;43(2):251-260.
Chicago Kurul, Feyyaz, and Beyza Ahlatcıoğlu Özkök. “Integer Linear Programming Model for Vehicle Routing Problem and an Application in the Food Industry”. İstanbul Üniversitesi İşletme Fakültesi Dergisi 43, no. 2 (November 2014): 251-60.
EndNote Kurul F, Ahlatcıoğlu Özkök B (November 1, 2014) Integer linear programming model for vehicle routing problem and an application in the food industry. İstanbul Üniversitesi İşletme Fakültesi Dergisi 43 2 251–260.
IEEE F. Kurul and B. Ahlatcıoğlu Özkök, “Integer linear programming model for vehicle routing problem and an application in the food industry”, İstanbul Üniversitesi İşletme Fakültesi Dergisi, vol. 43, no. 2, pp. 251–260, 2014.
ISNAD Kurul, Feyyaz - Ahlatcıoğlu Özkök, Beyza. “Integer Linear Programming Model for Vehicle Routing Problem and an Application in the Food Industry”. İstanbul Üniversitesi İşletme Fakültesi Dergisi 43/2 (November 2014), 251-260.
JAMA Kurul F, Ahlatcıoğlu Özkök B. Integer linear programming model for vehicle routing problem and an application in the food industry. İstanbul Üniversitesi İşletme Fakültesi Dergisi. 2014;43:251–260.
MLA Kurul, Feyyaz and Beyza Ahlatcıoğlu Özkök. “Integer Linear Programming Model for Vehicle Routing Problem and an Application in the Food Industry”. İstanbul Üniversitesi İşletme Fakültesi Dergisi, vol. 43, no. 2, 2014, pp. 251-60.
Vancouver Kurul F, Ahlatcıoğlu Özkök B. Integer linear programming model for vehicle routing problem and an application in the food industry. İstanbul Üniversitesi İşletme Fakültesi Dergisi. 2014;43(2):251-60.