You are here

Home » Content

Malatya Büyükşehir Belediyesi İlaçlama Araçlarının Güzergahlarının Optimizasyonu

Route Optimization of Malatya Metropolitan Municipality Pesticide Vehicles

Journal Name:

  • Alphanumeric Journal

Publication Year:

  • 2018
DOI: 
10.17093/alphanumeric.368417

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
In today's competitive environment, businesses attach importance to transfer products, services and related information between supply and consumption points in order to meet increasing customer demands, in accordance with minimum cost, optimum route and customer satisfaction. Due to its importance in the economy, the Vehicle Routing Problem (VRP), which has been working hard on academics for the last 50 years and is a sub-topic of logistics management, constitutes a significant part of the total distribution cost in the businesses and financial expenditures are serious. In this study, VRP and Chinese Postman Problem (CPP) is introduced, optimal routes of Malatya Metropolitan Municipality pesticide vehicles is determined by using Hierholzer & Floyd Warshall Algorithms and Excel - Solver and solution is compared.
Bookmark/Search this post with
Abstract (Original Language): 
Günümüz rekabet ortamında işletmeler, artan müşteri taleplerini karşılamak için ürün, hizmet ve ilgili bilgilerin arz ve tüketim noktaları arasında minimum maliyet, optimum rota ve müşteri memnuniyetine uygun şekilde transfer edilmesine önem vermektedir. Ekonomideki öneminden dolayı son 50 yıldır akademisyenler tarafından üzerinde çok çalışılan ve lojistik yönetimi alt konusu olan Araç Rotalama Problemi (ARP) işletmelerde toplam dağıtım maliyetinin önemli bölümünü oluşturmakta ve finansal olarak ciddi harcamalar yapılmaktadır. Bu çalışmada ARP ve Çinli Postacı Problemi (ÇPP) tanıtılmış, Malatya Büyükşehir Belediyesi ilaçlama araçlarının optimal rotaları, Hierholzer & Floyd Warshall Algoritmaları ve Excel-Solver ile hesaplanmış, sonuçlar karşılaştırılmıştır.
FULL TEXT (PDF): 
PDF icon arastirmax-malatya-buyuksehir-belediyesi-ilaclama-araclarinin-guzergahlarinin-optimizasyonu.pdf
  • 1
13
24
  • Turkish

REFERENCES

References: 

Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory, Algorithms, And
Applications, Printice, Hall,1993.
Corberán, A., & Prins, C. (2010). Recent Results On Arc Routing Problems: An Annotated
Bibliography. Networks, 56(1), 50-69.
Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution Of A Large-Scale Traveling-Salesman
Problem. Journal of the operations research society of America, 2(4), 393-410.
Durucasu, H. (2004). Bir Polis Devriye Aracı Rotasının Elektronik Çalışma Sayfası Modeli Yardımıyla
Belirlenmesi. Anadolu Üniversitesi Sosyal Bilimler Dergisi 4(2), 49-72.
Edmonds, J. (1965a). Chinese Postmans Problem. In Operations Research (p. B73). 901 Elkrıdge
Landing Rd Ste 400, Lınthıcum Hts, Md 21090-2909: Inst Operations Research Management
Sciences.
Edmonds, J. (1965b). Paths, Trees, and Flowers. Canadian Journal of mathematics, 17(3), 449-467.
Edmonds, J., & Johnson, E. L. (1973). Matching, Euler Tours And The Chinese Postman.
Mathematical programming, 5(1), 88-124.
Eglese, R.W. ve Li, Y.O. L. (1996). An Interactive Algorithm For Vehicle Routeing ForWinter-Gritting,
The Journal Of The Operational Research Society, 47(2), 217- 228.
Eiselt, H. A., Gendreau, M., & Laporte, G. (1995a). Arc Routing Problems, Part I: The Chinese Postman
Problem. Operations Research, 43(2), 231-242.
Emel, G. G., Taşkın, Ç., & Dinç, E. (2003). Yönsüz Çinli Postacı Problemi: Polis Devriye Araçları İçin Bir
Uygulama.
Euler, L. (1741). Solutio Problematis Ad Geometriam Situs Pertinentis. Commentarii Academiae
Scientiarum Petropolitanae, 8, 128-140.
Fleury, M. (1883). Deux Problemes De Geometrie De Situation. Journal de Mathematiques
Elementaires, 2(2), 257-261.
Florian, M. (1984). An Introduction To Network Models Used In Transportation Planning.
Transportation Planning Models: Proceedings of the Course Given at the International Center
for Transportation Studies (ICTS), Amalfi, Italy, October 11-16, 1982, 137.
Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. 1962. Princeton U. Press, Princeton, NJ.
Guan, M. (1984). On The Windy Postman Problem. Discrete Applied Mathematics, 9(1), 41-46.
Söyler, Fendoğlu Route Optimization of Malatya Metropolitan Municipality Pesticide Vehicles 24
Alphanumeric Journal
Volume 6, Issue 1, 2018
Hierholzer, C., & Wiener, C. (1873). Über die Möglichkeit, einen Linienzug ohne Wiederholung und
ohne Unterbrechung zu umfahren. Mathematische Annalen, 6(1), 30-32.
Laporte, G. (1997). Modeling And Solving Several Classes of Arc Routing Problems As Traveling
Salesman Problems. Computers & operations research, 24(11), 1057-1061.
Ross, D. F. (2016). Introduction To E-Supply Chain Management: Engaging Technology To Build
Market-Winning Business Partnerships. CRC Press. Boca Raton, London, New York,
Washington, D.C.
Rushton, A., Croucher, P., & Baker, P. (2010). The Handbook Of Logistics and Distribution
Management, 4th. Kogan Page, London, Philadelphia, New Delhi.

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