ANT COLONY ALGORITHM FOR SOLVING THE COMPLEX VEHICLE ROUTING PROBLEM

Abstract

The logistics section, called transport logistics, is responsible for the movement of the required amount of cargo by the optimal route to the desired point in a certain time and at the lowest cost. Transport logistics is the most important component of the entire sphere of transport and logistics services. The development of this area, in particular in Kazakhstan, can significantly affect the country's economy, so now it is considered an urgent problem. An increase in the efficiency of cargo transportation in modern transport logistics can be achieved by using automated systems that allow computer processing, storage and visualization of initial data. The purpose of the article is to develop an algorithm for solving a complex problem of vehicle routing, characterized by a number of restrictions, based on the ant colony method and to study its effectiveness.

In the course of the study was presented a mathematical model of the vehicle routing problem with a limited load capacity and additional restrictions. There was described an algorithm for solving the problem, based on the ant colony method. Designed and developed a web application that allows you to determine the best routes when you specify the input data and restrictions. The effectiveness of the developed algorithm for solving the problem was studied by conducting experiments with different values ​​of the parameters