Approaches to solve the vehicle routing problem in the valuables delivery domain

The various extensions of the vehicle routing problem with time windows (VRPTW) are considered. In addition to the VRPTW, the authors present a method to solve the SDVRPTW - the variation of the task allowing separate goods supply to the customers. The two developed metaheuristic algorithms (genetic and hybrid) are described that use the unique task-oriented operators and approaches, such as the limited route inversion, the upgraded heuristic procedure, the initialization of the initial population by ant colonies method, Pareto ranking. The features of this problem solved are additional route restrictions, such as: the maximum time, the number of customers and cost, as well as the maximum number of vehicles required for delivery. This article is devoted to valuables delivery problems and methods to resolve them.