Distribution of Permutations with Different Cyclic Structure in Mathematical Models of Transportation Problems

The paper is devoted to the investigation of problems of the class Pick-up and Delivery routing problems (PDP). Among the heuristic algorithms used to solve PDP problems is a class of neighborhood algorithms, in which algorithms based on the use of cyclic transfer theory deserve special attention. The study of the cyclic structure of permutations is a promising direction for increasing of efficiency of the cyclic transfers.