Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/246435 
Year of Publication: 
2020
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 7 [Publisher:] Elsevier [Place:] Amsterdam [Year:] 2020 [Pages:] 1-13
Publisher: 
Elsevier, Amsterdam
Abstract: 
While optimal forest harvesting regulations (regional forest regeneration schedules) have been established using the linear programming technique, its modeling restriction is still a challenge in practice. In this study, we developed an alternative framework for establishing an optimal forest harvesting regulation using the continuous approximation technique. The regulation problem was reformulated as a problem to find optimal smooth control of regeneration area, thereby overcoming the difficulties in finding the global optimum for the optimization models that include nonlinear or more complex models. A seven-dimensional optimization model was developed involving efficient assurance of the convergence to a stable forest state and prohibition of clearcutting in immature stands. Using this model, we established optimal forest harvesting regulations in Nagano Prefecture, Japan. Simulated annealing was utilized to explore optimal solutions. Analyses based on extreme value theory and comparison with solutions produced by grid search indicated that the best solutions may be sufficiently close to global optima. The best solutions suggested controlling timber supply to keep prices high in the early years, due to the supply-demand log price model and the use of net present value as the objective function. Because of the low profitability of the region, the solution suggested delaying the achievement of the target state as far as possible.
Subjects: 
Continuous approximation
Forest harvesting regulation
Net present value
Simulated annealing
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.