The Vehicle Routing Problem for Several Agents Among the Objects of Two Types
Сергей Николаевич Медведев, Anastasiya Sorokina, Olga Medvedeva · 2019
The paper considers the vehicle routing problem for several agents among the objects of two types. It is necessary to move all objects of the first type to objects of the second type. That is, it is necessary to create routes for agents so that all objects of the first type are to be visited, objects of different types should be alternated in the route and the total cost of moving is to be minimal. The mathematical model of the problem in the form of a mathematical programming problem is proposed. The paper describes the developed “greedy” and genetic solution algorithms. Special crossover and mutation operators have been developed for this problem to implement the genetic algorithm. The paper presents the computational experiment conducted on the basis of the developed software.