Development of an optimal way algorithm for oil transfer taking into account the location of public places

This article describes the process of finding the shortest path for oil transportation. Dijkstra's algorithm and its extended version, A * search, are considered as algorithms for finding a route. In drawing up the route, it is taken into account that when transporting dangerous goods by road, the route should not pass through populated areas, industrial buildings, nature reserves, etc. To find and exclude such roads, use the formula for finding the distance from a point to a straight line.