Journals / El-Cezeri / 2022 / Cilt: 9 - Sayı: 4

Ant Colony Algorithm for Capacitated Vehicle Routing Problem: A Real Life Application

Karınca Kolonisi Algoritmasının Gerçek Hayat Kapasiteli Araç Rotalama Problemi İçin Uygulanması

Journal
El-Cezeri
Pages
1466–1483
Publication Date
2022-12-31
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 solution obtained provided the result of 297.6% better cost and 236.61% less distance compared to the current policy of the company.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, using the real data of a logistics company operating in Kayseri, Turkey, the homogeneous capacity multi-vehicle vehicle routing problem faced by the company is discussed.
📊
Key Findings & Data:The company wants to obtain the shipment route that will meet the orders of demand points in 50 different locations on a weekly basis from the warehouse in Kayseri, without exceeding the number of vehicles at hand, with minimum cost.
💡
Conclusion & Impact:The solution obtained provided the result of 297.6% better cost and 236.61% less distance compared to the current policy of the company.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Karınca Kolonisi Algoritması · Kapasite Kısıtlı Araç Rotalama · Matematiksel Modelleme

Abstract

In this study, using the real data of a logistics company operating in Kayseri, Turkey, the homogeneous capacity multi-vehicle vehicle routing problem faced by the company is discussed. The company wants to obtain the shipment route that will meet the orders of demand points in 50 different locations on a weekly basis from the warehouse in Kayseri, without exceeding the number of vehicles at hand, with minimum cost. For the solution of the problem, the linear mathematical model in the literature was coded with OpenSolver software. The mathematical model was able to obtain the optimum solution for small subproblems with 10, 15 and 20 demand points. Ant colony metaheuristic is coded for the real problem with 50 demand points. In the coding of the metaheuristic model, Python programming language was used over the Pycharm package program interface. The quality of metaheuristic solutions has been proven by mathematical solutions. The real problem solution obtained with the metaheuristic model is compared with the current state values ​​of the company. The solution obtained provided the result of 297.6% better cost and 236.61% less distance compared to the current policy of the company.

Özet

Bu çalışmada Türkiye’nin Kayseri ilinde faaliyet gösteren bir lojistik firmasının gerçek verileri kullanılarak, firmanın karşı karşıya kaldığı homojen kapasiteli çok araçlı araç rotalama problemi ele alınmıştır. Firma Kayseri’de bulunan depodan, 50 farklı konumda bulunan talep noktalarının siparişlerini haftalık periyotlar ile karşılayacak sevkiyat rotasını, elde bulunan araç sayısını aşmadan, minimum maliyet ile elde etmek istemektedir. Problemin çözümü için literatürde yer alan lineer matematiksel model OpenSolver yazılımı ile üzerinde kodlanmıştır. Matematiksel model 10, 15 ve 20 talep noktalı küçük alt problemler için optimum çözüm elde edebilmiştir. 50 talep noktalı gerçek problem için Karınca kolonisi metasezgiseli kodlanmıştır. Metasezgisel modelin kodlanmasında Pycharm paket program ara yüzü üzerinden Python programlama dili kullanılmıştır. Metasezgisel çözümlerinin kalitesi matematiksel çözümler ile ispat edilmiştir. Metasezgisel model ile elde edilen gerçek problem çözümü firmanın mevcut durum değerleri ile kıyaslanmıştır. Elde edilen çözüm firmanın mevcut politikasına oranla %297,6 daha iyi maliyet, %236,61 daha az mesafe sonucunu sağlamıştır.

🔖

Cite This Article

DAŞKIN, B. D., BÜYÜKÖZKAN, K. (2022). Ant Colony Algorithm for Capacitated Vehicle Routing Problem: A Real Life Application. El-Cezeri, Cilt: 9 - Sayı: 4, 1466–1483. https://ajindex.com/articles/859087

📄 Full Text PDF Viewer

📄

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

References (14)

  1. Irnich S., Toth P., and Vigo D., “Vehicle Routing, Chapter 1: The Family of Vehicle Routing Problems, MOS-SIAM Series on Optimization”, Philadelphia, pp.1 – 33, (2014)
  2. Vukadinovic K., Teodorovic D., Pavkovic G.Ö “ An application of neurofuzzy modeling: The vehicle assignment problem”, European Journal of Operational Research 114, 474-488 (1999
  3. Bashiri M., Rasoulinejad Z. & Fallahzade E. “A new approach on auxiliary vehicle assignment in capacitated location routing problem”, International Journal of Systems Science, 47:4, (2016
  4. Liong C-Y., Omar K., “Vehicle routing problem: Models and solutions”, Journal of Quality Measurement and Analysis JQMA 4(1), 205-218, (2008
  5. Cordeau J-F., Laporte G. & Mercier A, “A unified tabu search heuristic for vehicle routing problems with time Windows”, Journal of the Operational Research Society, 52:8, 928-936, (2001
  6. KESKİNTÜRK T., TOPUK & ÖZYEŞİL O., “Araç Rotalama Problemleri ile Çözüm Yöntemlerinin Sınıflandırılması ve Bir Uygulama”, İşletme Bilimi Dergisi Cilt:3 Sayı:2 77-107, (2015
  7. Chang M-S. “A vehicle routing problem with time windows and stochastic demands”, Journal of the Chinese Institute of Engineers, 28:5, 783-794, (2005
  8. Khodabandeh E., Bai L., Heragu S-S., Evans G-W., Elrod T. & Shirkness M. “Modelling and solution of a large-scale vehicle routing problem at GE appliances & lighting”, International Journal of Production Research, 55:4, 1100-1116, (2017
  9. Cantu-Funes R., Salazar-Aguilar M-A. & Boyer V. “Multi-depot periodic vehicle routing problem with due dates and time Windows”, Journal of the Operational Research Society, 69:2, 296-306, (2018
  10. Crainic T-G., Gajpal Y.& Gendreau M., “Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows”, INFOR: Information Systems and Operational Research, 53:2, 49-67, (2015
  11. Giosa I-D., Tansini I-L. & Viera I-O., “New assignment algorithms for the multi-depot vehicle routing problem”, Journal of the Operational Research Society, 53:9, 977-984, (2002
  12. Ng W-L., Leung S-C-H., Lam J-K-P. & Pan S-W., “Petrol delivery tanker assignment and routing: a case study in Hong Kong”, Journal of the Operational Research Society, 59:9, 1191-1200, (2008
  13. Liu F-H. & Shen S-Y., “The fleet size and mix vehicle routing problem with time windows”, Journal of the Operational Research Society, 50:7, 721-732, (1999
  14. ALAYKIRAN K., ENGİN O., “Karınca Kolonileri Metasezgiseli ve Gezgin Satıcı Problemleri Üzerinde Bir Uygulaması”,