Algorithms for calculating schemes of transport routes in a felling area

Abstract

The study considers the problem of constructing routes for the export of timber. The task reduced to building a rooted tree. The study presents two approximate algorithms for solving the problem of covering polygons with rooted trees. To simplify the task, the polygon is covered with a square grid. A greedy algorithm is described that should give an approximate solution. The article also describes the branch and bound method with a reduced number of iteration options. We have reduced the number of iterations by using a special way of building links.

Predicting the Passability of Wheeled Tractors

“…While simulating the mechanical behavior of the deformation medium, complex mathematical dependencies are formed that take a long time to resolve even a partial case [4]. Hence, the models are being simplified, referring to the fact that this will not degrade the quality of the modeling and show similar results with less time and effort [3,5].…”