GEOMETRIC MODELS OF LOCAL OPTIMIZATION OF TRACING TRANSPORT AND LOGISTICS NETWORKS OF HIGHWAYS

Abstract

Tracing and building an optimal network configuration is one of the main tasks of logistics. The article is devoted to improving the methods of discrete local optimization of tracing transport and logistics networks of highways. The main goal is to determine the shortest distance of cargo delivery from the place of loading to the place of unloading that meets the specified requirements in advance. To solve the problem, various variants of geometric network models with a polar metric are systematized and generalized. Based on the method of least elongation, an algorithm for tracing  a  local  network for four points is formulated and developed. Network tracing belongs to the extreme and class of NP-hard discrete optimization problems. The required network configuration is achieved by adding a Steiner point. The algorithm allows you to take into account the obstacle avoidance and build the shortest route of the road. The constructed network configuration consists of radial segments and arcs of circles. The total length of the arcs and circles should be minimal.