We address a multiobjective forest-management problem that maximizes harvested timber volume and maximizes the protection of species through the selection of protected habitat reserves. As opposed to reserving parcels of the forest for general habitat purposes, as most published works do, the model we present, and its several variants, concentrate on the preservation status of each one of the species living in the forest under study. Thus, all of the formulations we propose trade off harvested timber volume against the weighted number of preserved species. Each formulation represents a different management policy. Casting the models in a static setting allows us to analyze the effect of several management policies through computational experience with different forest-stucture — species relationships.
Get full access to this article
View all access options for this article.
References
1.
CammJPolaskySSolowACsutiB, 1996, “A note on optimal algorithms for reserve site selection”Biological Conservation78, 353–355
2.
ChurchRReVelleC, 1974, “The maximal covering location problem”Papers in Regional Science71, 199–215
3.
ChurchRStomsDDavisF, 1996, “Reserve selection as a maximal covering location problem”Biological Conservation76, 105–112
4.
ChurchRGerrardRHollanderAStomsD, 2000, “Understanding the tradeoffs between site quality and species presence in reserve site selection”Forest Science46, 157–167
5.
CocksKBairdI, 1989, “Using mathematical programming to address the multiple reserve selection problem: An example from the Eyre Peninsula, South Africa”Biological Conservation49, 113–130
6.
CsutiBPolaskySWilliamsPPresseyRCammJKershawMKiesterADownsBHamiltonRHusoMSahrK, 1997, “A comparison of reserve selection algorithms using data on terrestrial vertebrates in Oregon”Biological Conservation80, 83–97
7.
FischerDChurchR, 2003, “Clustering and compactness in reserve site selection; an extension of the biodiversity management area selection model”Forest Science49, 555–565
8.
HogansonHBorgesJ, 2000, “Impacts of the time horizon for adjacency constraints in harvest scheduling”Forest Science46, 176–187
JonesJMeneghinBKirbyM, 1991, “Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning”Forest Science37, 1283–1297
11.
McDillMBrazeJ, 2000, “Comparing adjacency constraint formulations for randomly generated forest planning problems with four age–class distributions”Forest Science46, 423–436
12.
McDillMRebainSBrazeJ, 2002, “Harvest scheduling with area-based adjacency constraints”Forest Science48, 631–642
13.
McDonnellMPossinghamHBallICousinsE, 2002, “Mathematical methods for spatially cohesive reserve design”Environmental Modeling and Assessment7, 107–114
14.
MeneghinBKirbyMJonesJ, 1988, “An algorithm for writing adjacency constraints efficiently in linear programming models”, in 1988 Symposium on Systems Analysis in Forest Resources General Technical Report, RM-161, USDA Forest Service, PO Box 96090, Washington, DC 20090–6090, pp 46–53
15.
MurrayA, 1999, “Spatial restrictions in harvest scheduling”Forest Science45, 45–52
16.
MurrayAChurchR, 1996, “Constructing and selecting adjacency constraints”INFOR Journal34, 232–247
17.
NalleDArthurJSessionsJ, 2002, “Designing compact and contiguous reserve networks with a hybrid heuristic algorithm”Forest Science48, 59–68
18.
SaetersdalMLineJBirksH, 1993, “How to maximize biological diversity in nature reserve selection: Vascular plants and breeding birds in deciduous woodlands, western Norway”Biological Conservation66, 131–138
19.
SnyderSReVelleC, 1996a, “The grid-packing problem: Selecting a harvesting pattern in an area with forbidden regions”Forest Science42, 27–34
20.
SnyderSReVelleC, 1996b, “Temporal and spatial harvesting of irregular systems of parcels”Canadian Journal of Forest Research26, 1079–1088
21.
SnyderSReVelleC, 1997, “Multiobjective grid packing model: An application in forest management”Location Science5(3) 165–180
22.
SnyderSTyrrellLHaightR, 1999, “An optimization approach to selecting research natural areas in National Forests”Forest Science45, 459–469
23.
ToregasCReVelleC, 1973, “Binary logic solutions to a class of location problems”Geographical Analysis5, 145–155
24.
Torres-RojoJBrodieJ, 1990, “Adjacency constraints in harvest scheduling: An aggregation heuristic”Canadian Journal of Forest Research20, 978–986
USDA, 1992, “Preparing for the future: Forest Service research natural areas”, FS-503, USDA Forest Service, PO Box 96090, Washington, DC 20090-6090
27.
WilliamsJ CReVelleC S, 1997, “Applying mathematical programming to reserve selection”Environmental Modeling and Assessment2, 167–175
28.
WilliamsJ CReVelleC S, 1998, “Reserve assemblage of critical areas: A zero – one programming approach”European Journal of Operations Research104, 497–509
29.
WillisC KLombardA TCowlingR MHeydenrychB JBurgersC J, 1996, “Reserve systems for limestone endemic flora of the Cape lowland fynbos: Iterative vs. linear programming”Biological Conservation77, 53–62
30.
YoshimotoABrodieJ, 1994, “Comparative analysis of algorithms to generate adjacency constraints”Canadian Journal of Forest Research24, 1277–1288
