Approach to solve a pseudogeometric version of the traveling salesman problem

Background. The traveling salesman problem is an example of a mathematical model that, being created in one subject area, finds application in many other areas. The pseudogeometric version of this problem more adequately describes a set of its private cases, encountered in most subject areas, in comparison with a more widely-used geometric version. The aim of the work is to apply the developed approaches to solve the geometric version of the traveling salesman problem for its so-called pseudogeometric version. Materials and methods. To solve the pseudogeometric problem of traveling salesman the authors considered several randomly generated rearrangement of a set of dots, and for each one they applied the algorithm of pseudorestoration of their disposition. The choice of the only variant of disposition of each dot is possible after solution of the optimization problem, consisting in the turn of the generated set of dots through a certain angle and the shift along a certain vector. Results. The authors formulated various metrics and studied the properties thereof, on the basis of which they have developed a heuristic algorithm of local search. Conclusions. Applications of the metrics and the heuristic algorithm of local search, described in the paper, increased the efficiency of the geometric method of solution of the pseudogeometric problem of traveling salesman.