Time Efficiency of Selected Types of Adjacency Constraints in Solving Unit Restriction Models
Open Access
Abstract
Spatial restrictions of harvesting have been extensively studied due to a number of environmental, social and legal regulations. Many spatial restrictions are defined by adjacency constraints, for which a number of algorithms have been developed. Research into the unit restriction model (URM) using a branch and bound algorithm focused on decreasing the number of adjacency constraints in harvest scheduling models, since the early solvers have been limited by the number of constraints and integer decision variables. However, this approach can lead to a loss of efficiency in solving mixed integer models. Recent improvements in commercial solvers and personal computers have made the reduction of constraints less relevant, since many solvers now accept an unlimited number of constraints and decision variables. The aim of this paper was to compare the time efficiency of solving unit restriction harvest scheduling models with different types of adjacency constraints using a commercial solver. The presented results indicate that the type of adjacency constraints can have a significant effect on the solving time and therefore could be a crucial factor of the time required for developing forest plans. We note that pairwise adjacency constraints may be sufficient today for addressing unit restriction forest harvest scheduling problems.Keywords
Funding Information
- National Agency for Agriculture Research (QJ1320230)
- Internal Grant Agency of Faculty of Forestry and Wood Sciences Czech University of Life Sciences in Prague (B07/15)
This publication has 18 references indexed in Scilit:
- GIS tool for optimization of forest harvest-schedulingComputers and Electronics in Agriculture, 2015
- Decision Support Systems (DSS) Optimal—A Case Study from the Czech RepublicForests, 2015
- Spatial forest planning: A reviewEcological Modelling, 2005
- Spatial forest plan development with ecological and economic goalsEcological Modelling, 2003
- Solving the area-restricted harvest-scheduling model using the branch and bound algorithmCanadian Journal of Forest Research, 2003
- The spatial structure of forests in the optimization calculations of forest planning — a landscape ecological perspectiveForest Ecology and Management, 2001
- Measuring the efficacy of adjacency constraint structure in forest planning modelsCanadian Journal of Forest Research, 1995
- Comparative analysis of algorithms to generate adjacency constraintsCanadian Journal of Forest Research, 1994
- Spatial and temporal allocation of stratum-based harvest schedulesCanadian Journal of Forest Research, 1993
- Adjacency constraints in harvest scheduling: an aggregation heuristicCanadian Journal of Forest Research, 1990