Modified ant colony optimization algorithm for solving the vehicle routing problem with a given load capacity

Abstract

Abstract The article presents a mathematical model of the Vehicle routing problem with loading constraints in the form of a mathematical programming problem. A modification of the Ant colony optimization algorithm is presented to solve the problem. The main idea of the modification is to use the probabilistic rule of returning the agent (ant) to the depot before full unloading. The source of such behavior of the agent can be the concept of «fullness» of the ant. The computational experiment for comparing the classical and modified Ant colony optimization algorithms is presented. Testing was carried out according to two schemes: intensive testing and cross-testing. The conclusions about the efficiency of the proposed algorithm are presented.