Solving the area-restricted harvest-scheduling model using the branch and bound algorithm
Authors:
- Kevin CroweKCKevin Crowe
- John NelsonJNJohn Nelson
- Mark BoylandMBMark Boyland
- 1 September 2003
- journal article
- Published by Canadian Science Publishing in Canadian Journal of Forest Research
- Vol. 33 (9) , 1804-1814
Abstract
There are two broad approaches to the discrete optimization problem of harvest scheduling with adjacency constraints: the unit-restricted model and the area-restricted model. In this paper two formulations of the area-restricted model are solved using the branch and bound algorithm. These formulations are tested on a set of approximately 30 tactical planning problems that range in size from 346 to 6093 polygons scheduled over three time periods. Our results show that these formulations can be used to solve small- and medium-sized harvest-scheduling problems optimally, or near-optimally, within reasonable periods of computing time. Solution quality and computing time were found to be sensitive to the initial age-class distribution of the forest and the mean polygon size relative to the maximum opening size. In addition, computation of the opening size constraints was found to be very sensitive to the maximum number of polygons in an opening constraint.Keywords
This publication has 14 references indexed in Scilit:
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraintsEuropean Journal of Operational Research, 1998
- Forest management challenges for operational researchersEuropean Journal of Operational Research, 1998
- Measuring the efficacy of adjacency constraint structure in forest planning modelsCanadian Journal of Forest Research, 1995
- Heuristic solution approaches to operational forest planning problemsOR Spectrum, 1995
- Harvest scheduling with spatial constraints: a simulated annealing approachCanadian Journal of Forest Research, 1993
- Spatial and temporal allocation of stratum-based harvest schedulesCanadian Journal of Forest Research, 1993
- Harvest scheduling under adjacency constraints — a case study from the Swedish sub‐alpine regionScandinavian Journal of Forest Research, 1993
- An operational, spatially constrained harvest scheduling modelCanadian Journal of Forest Research, 1990
- Comparison of a random search algorithm and mixed integer programming for solving area-based forest plansCanadian Journal of Forest Research, 1990
- Spatially constrained timber harvest schedulingCanadian Journal of Forest Research, 1989