Application of the Ant Colony Algorithm for solving routing optimization problem in logistics

Abstract

In logistics there are different options of how the Traveling Salesman Problem can be solved. For that purpose, the Ant Colony Optimization (ACO) may be used. In the thesis, the method is implemented in order to solve the routing optimization problem. In that case, the mathematical application is observed and analyzed. ACO parameters that affecting the working principles were researched in the thesis with the corresponding graphical representation. Based on the theoretical logic the Java language program is written for the purpose of realizing the ACO algorithm. In order to grade the effectiveness of the obtained results the additional model the Greedy method was applied. The developed program tool demonstrates the practical applications and a solution of the routing problem based on the real data in Wesel region. The thesis is focused on the route length optimization and cost reduction in terms of ACO implementation