A long-term, spatially constrained harvest scheduling model for Eucalyptus plantations in the southeast of Mexico
AuthorCruz-Bello, Gustavo Manuel
MetadataShow full item record
PublisherThe University of Arizona.
RightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
AbstractIn the states of Tabasco and Chiapas, Mexico there is a lack of long-term harvest scheduling models that consider the effects of the harvest activities on the surrounding areas. Additionally, these problems are combinatorial in nature, which makes them hard to solve. Consequently, only harvest scheduling for small areas can be solved to optimality using traditional approaches such as integer programming (IP). In this study, a genetic algorithms (GA) model was used to generate multiple viable solutions for long-term spatially constrained problems on large areas with a great number of management units. This model enables consideration of regeneration and reharvest in forest planning. The flexibility of the model allows it to handle a different set of time periods, database sizes, different species and diverse tree growth models. The data set employed corresponds to a eucalyptus plantation with a cutting cycle seven years and a planning horizon of 10 rotation periods. Total plantation area is 300,000 ha, divided in 5,388 harvest units. IP was used as a standard to validate the efficiency and accuracy of the GA method. The GA performance with different combinations of genetic operators was tested. Scheduled volume flow for simulated communities was computed. Additionally, three different volume assignment scenarios (low, medium and high) were compared to estimate the effect of volume assignment on the spatial optimization output. The significant findings of this research are: (1) a long-term spatially constrained robust solution was found through the use of genetic algorithms for a large area with more harvest units than those reported elsewhere, (2) the solution allowed re-harvest in the same planning horizon, (3) most of the genetic algorithms runs performed better than the integer programming, and (4) on average the volume scheduled for every simulated community was comparable for the two methods used in the work. In both cases, the percentages of the potential volume ranged between 7 and 29%.
Degree ProgramGraduate College
Renewable Natural Resources