Finding the optimal route of wood transportation

Abstract

This article describes an algorithm for finding the optimal routes and volumes of cargo transportation along the routes at minimal transportation cost of a given cargo' volume from the starting to the final point . The algorithm, based on Dijkstra's approach (shortest path search) and dynamic programming method, is used for the calculation of the optimal route of wood transportation from the cutting area. The peculiarity of forest roads are different transport costs and carrying capacities on the forest road network sections influenced by the natural and climatic conditions of the route section. The cost of delivery includes both costs, depending on the volume of cargo (transportation), and not depending on it (construction and restoration of roads). The peculiarity of the task is that the costs of restoration (construction), transportation along the section included in the route may vary depending on the transported cargo volume.