The Application of Symmetry Sets in Problems of Transport Logistics

The paper studies the problem of constructing an optimal route on a plane that leads from the current point to the nearest infrastructure objects, such as a warehouse, store or technical service center. The authors proposed algorithms for segmenting the plane into zones of influence for each object and singled out the characteristic set – the bisector, which delimits these zones. They also found the necessary conditions for a segment to be an optimal trajectory leading to the nearest object and the conditions for the smoothness of the bisector. The paper provides an example of building logistic zones for several objects. Also, a function of distance to them is built, which sets the costs for reaching them.