Article ID: | iaor20011867 |
Country: | Netherlands |
Volume: | 96 |
Issue: | 1 |
Start Page Number: | 271 |
End Page Number: | 285 |
Publication Date: | Nov 2000 |
Journal: | Annals of Operations Research |
Authors: | Guignard Monique, Church Richard L., Murray Alan T., Weintraub Andrs P. |
Keywords: | combinatorial analysis, programming: integer, geography & environment |
Linear Programming and Mixed Integer Linear Programs have been used for forest planning since the 60's to support decision making on forest harvesting and management. In particular, during the last two decades of forest management there has been an increased interest in spatial issues. Further, new environmental concerns, such as resource sustainability and wildlife protection, impose that increased attention be paid to activities carried out on the ground. Road building needed for access also requires spatial definition. As a result, more complex models must be used. We discuss the issues which have led to the combinatorial nature of some main forest management problems and the solution algorithms that have been proposed for these problems, including local search heuristics, random search approaches, strengthening of mixed integer model formulations and Langrangian relaxation. In this survey, we discuss which of the proposed approaches have been used successfully, the advantages and shortcomings of each and what are still open research problems.