Ant Colony Algorithm for Capacitated Vehicle Routing Problem: A Real Life Application Karınca Kolonisi Algoritmasının Kapasite Kısıtlı Araç Rotalama Problemine Uygulanması


Creative Commons License

Daşkin B. D., BÜYÜKÖZKAN K.

El-Cezeri Journal of Science and Engineering, vol.9, no.4, pp.1466-1483, 2022 (Scopus) identifier

  • Publication Type: Article / Article
  • Volume: 9 Issue: 4
  • Publication Date: 2022
  • Doi Number: 10.31202/ecjse.1135814
  • Journal Name: El-Cezeri Journal of Science and Engineering
  • Journal Indexes: Scopus
  • Page Numbers: pp.1466-1483
  • Keywords: Ant colony algorithm, artificial intelligence, capacitated vehicle routing, mathematical modelling, real life application
  • Karadeniz Technical University Affiliated: Yes

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.