Abstract
Preliminary studies have shown the need to develop an integrated approach to the problem of reforestation, which would take into account current trends in the field of ecophysiology, technology and technology of forestry, as well as the efficiency of technological processes. At the first stage, a reforestation algorithm was developed to implement this approach. The algorithm consists of 31 enlarged technological operations and 268 implementations of the algorithm. The algorithm was decomposed for further detailed study of technological operations and the development of a mathematical model aimed at finding the optimal set of operations for reforestation. Six groups were identified, each of which should be considered separately. The work considers the 10th operator of the III-th and V-th groups. An algorithm for preparing seeds and an algorithm for separating seeds have been developed. The matrices for the implementation of the algorithms were constructed (a 13 × 16-dimensional matrix for the preparation of forest seeds and a 14×35-dimensional matrix for the separation of forest seeds, containing binary values). A visualized proximity matrix based on the squared Euclidean distance and the Ward method was used to study the operators of algorithms for similarity. As a result of data processing, the operators of the algorithm are determined, which are far enough from the center of the groups, which can be ignored in the future when developing an optimization mathematical model of the reforestation process
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.