Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming
The simultaneous choice of land-use allocation and production scheduling on forest lands is a complex management problem that is best addressed using integer programming. This paper presents the general form of the allocation and scheduling problem, provides two empirical examples that reflect two distinct problem types and presents strategies for increasing the efficiency with which one can solve larger-scale empirical problems. The mixed-integer linear programming techniques presented in this paper capitalize on the special structure of each problem type and explore the possibility of reducing the solution effort. Inherent in type one problems is a distinct relationship among the allocation variables that can be exploited to help reduce the number of integer variables as well as the allocation constraints. For problems of type two, however, there exists a set of multiple choice allocation constraints which can also be exploited for better solution performance.
- Forest management models and combinatorial algorithms: Analysis of state of the art
- Review of combinatorial problems induced by spatial forest harvesting planning
- A Heuristic System to Solve Mixed Integér Forest Planning Models
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- Convexity cuts for multiple choice problems
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- Surrogate Constraints
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- Forest management models and combinatorial algorithms: Analysis of state of the art
- Review of combinatorial problems induced by spatial forest harvesting planning
- A hybrid constraint programming approach to a wood procurement problem with bucking decisions
- Allocating reforestation areas for sediment flow minimization: an integer programming formulation and~a~heuristic solution method
- scientific article; zbMATH DE number 1949048 (Why is no real title available?)
- A Heuristic System to Solve Mixed Integér Forest Planning Models
- Polyhedral-based methods for mixed-integer SOCP in tree breeding
- Using mixed integer programming models to synchronously determine production levels and market prices in an integrated market for roundwood and forest biomass
- Optimal selection of forest patches using integer and fractional programming
This page was built for publication: Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821036)
