Using the Ant Colony Optimization algorithm for the Capacitated Vehicle Routing Problem

This paper deals with the application of the Ant Colony Optimization (ACO) algorithm to solve the Capacitated Vehicle Routing Problem (CVRP). The first part presents the basic approach and concept which has been inspired by nature. Next, the basic features and parameters of the algorithm are discussed. Then, a number of experiments are introduced which served to verify the algorithm. We chose Christofides, Mingozzi and Toth´s CVRP instances as benchmark problems. The results we obtained are compared with other state-of-the-art algorithms. Next, the improvement of the algorithm is presented. The last part of the paper presents the application of the problem in practice; the primary objective is to plan the distribution of supplies and logistics in the real environment. Finally, the paper summarizes some perspectives of our future work.