A heuristic system to solve mixed integer forest planning models

A heuristic system to solve mixed integer forest planning models

0.00 Avg rating0 Votes
Article ID: iaor19961258
Country: United States
Volume: 42
Issue: 6
Start Page Number: 1010
End Page Number: 1024
Publication Date: Nov 1994
Journal: Operations Research
Authors: , , , ,
Keywords: planning, transportation: road, Transportation: Road, networks: scheduling, programming: integer
Abstract:

Implementing forest plans involves decisions regarding the geographic arrangement and timing of management activities, and the design of efficient transportation networks to provide access for these activities. These planning problems have been modeled successfully as mixed integer linear programs. However, these models are difficult to solve with commercial software due to their relatively large number of binary variables. The authors present a heuristic approach that has solved these problems well. The heuristic rules and a linear programming package interact within a closed system requiring no special user intervention. The authors describe several applications of this system for decision making in the USDA Forest Service.

Reviews

Required fields are marked *. Your email address will not be published.