Finding the efficient frontier of a bi-criteria, spatially explicit, harvest scheduling problem

Forest Science

Volumn 52, Issue 1, 2006, Pages 93-107

  Tóth, Sándor F ^a   McDill, Marc E ^a   Rebain, Stephanie ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b USDA FOREST SERVICE   (United States)

Author keywords

0 1 programming; Multicriteria optimization; Trade off analysis; Wildlife habitat

Indexed keywords

FORESTRY; OPTIMIZATION; SCHEDULING;

MULTICRITERIA OPTIMIZATION; TRADE-OFF ANALYSIS;

HARVESTING;

FORESTRY; HARVESTING; SCHEDULING;

EID: 33644557779     PISSN: 0015749X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (51)

1. ARP, P.A., AND D.R. LAVIGNE. 1982. Planning with goal programming: A case study for multiple-use of forested land. For. Chron. October:225-232.
2. ARTHAUD, G.J., AND D.W. ROSE. 1996. A methodology for estimating production possibility frontiers for wildlife habitat and timber value at the landscape level. Can. J. For. Res. 26:2191-2200.
3. BETTINGER, P., J. SESSIONS, AND K. BOSTON. 1997. Using Tabu search to schedule timber harvests subject to spatial wildlife goals for big game. Eco. Mod. 94:111-123.
4. BOWMAN, V.J. JR. 1975. On the relationship of Tchebycheff norm and the efficient frontier of multiple-criteria objectives. Notes in Econ. and Math. Systems 130:76-85.
5. CARTER, D.R., M. VOGIATZIS, C.B. MOSS, AND L.G. ARVANITIS. 1997. Ecosystem management or infeasible guidelines? Implications of adjacency restrictions for wildlife habitat and timber production. Can. J. For. Res. 27:1302-1310.
6. CHALMET, L.G., L. LEMONIDIS, AND D.J. ELZINGA. 1986. An algorithm for the bi-criterion integer programming problem. Eur. J. Oper. Res. 25:292-300.
7. CHURCH, R.L., R. GERRARD, A. HOLLANDER, AND D. STOMS. 2000. Understanding the tradeoffs between site quality and species presence in reserve site selection. For. Sci. 46(2):157-167.
8. CHURCH, R.L., D.M. STOMS, AND F.W. DAVIS. 1996. Reserve selection as a maximal covering location problem. Biol. Cons. 76:105-112.
9. COHON, J.L., R.L. CHURCH, AND D.P. SHEER. 1979. Generating multiobjective trade-offs: An algorithm for bicriterion problems. Water Resource Res. 15(5):1001-1010.
10. COX, E.S., AND J. SULLIVAN. 1995. Harvest scheduling with spatial wildlife constraints: An empirical examination of tradeoffs. J. Environ. Mgmt. 43:333-348.
11. DAVIS, L.S., AND G. LUI. 1991. Integrated forest planning across multiple ownerships and decision makers. For. Sci. 37:200-226.
12. ESWARAN, P.K., A. RAVINDRAN, AND H. MOSKOWITZ. 1989. Algorithms for nonlinear integer bicriterion problems. J. Optimization Theory and Appl. 63:261-279.
13. FEDKIW, J. 1997. The Forest Service's pathway towards ecosystem management. J. For. 95(1):30-34.
14. FIELD, D.B. 1973. Goal programming for forest management. For. Sci. 19(2):125-135.
15. FIELD, R.C., P.E. DRESS, AND J.C. FORTSON. 1980. Complementary linear and goal programming procedures for timber harvest scheduling. For. Sci. 26(1):121-133.
16. FRANKLIN, J.F., AND R.T. FORMAN. 1987. Creating landscape patterns by forest cutting: Ecological consequences and principles. Land. Ecol. 1:5-18.
17. GEOFFRION, A.M. 1968. Proper efficiency and the theory of vector maximization. J. Math. Anal. and Appl. 22:618-630.
18. HAIMES, Y.Y., L.S. LASDON, AND D.A. WISMER. 1971. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transactions on Systems, Man, and Cybernetics. 1:296-297.
19. HARRIS, L.D. 1984. The fragmented forest: Island biogeography theory and the preservation of biotic diversity. The University of Chicago Press, Chicago, IL. 211 p.
20. HOF, J., AND L. JOYCE. 1993. A mixed integer linear programming approach for spatially optimizing wildlife and timber in managed forest ecosystems. For. Sci. 39(4):816-834.
21. HOLLAND, D.N., R.J. LILIEHOLM, D.W. ROBERTS, AND J.K. GILLESS. 1994. Economic trade-offs of managing forests for timber production and vegetative diversity. Can. J. For. Res. 24:1260-1265.
22. HOTVEDT, J.E. 1983. Application of linear goal programming to forest harvest scheduling. South. J. Agric. Econ. 15:103-108.
23. ILOG S. A. 2002. ILOG CPLEX 8.1 reference manual. ILOG optimization documentation. ILOG, Inc., Mountain View, CA.
24. JONES, J.G., B.J. MENEGHIN, AND M.W. KIRBY. 1991. Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning. For. Sci. 37(5):1283-1297.
25. KAO, C., AND J.D. BRODIE. 1979. Goal programming for reconciling economic, even-flow, and regulation objectives in forest harvest scheduling. Can. J. For. Res. 9:525-531.
26. LEUSCHNER, W.A., J.R. PORTER, M.R. REYNOLDS, AND H.E. BURKHART. 1975. A linear programming model for multiple-use planning. Can. J. For. Res. 5:485-491.
27. MCDILL, M.E., AND J. BRAZE. 2001. Using the branch and bound algorithm to solve forest planning problems with adjacency constraints. For. Sci. 47(3):403-418.
28. MCDILL, M.E., S. REBAIN, AND J. BRAZE. 2002. Harvest scheduling with area-based adjacency constraints. For. Sci. 48(4):631-642.
29. MEALEY, S.P., AND J.R. HORN. 1981. Integrating wildlife habitat objectives into the forest plan. Trans. N. Am. Wildl. and Natural Resources Conf. 46:488-500.
30. MENDOZA, G.A. 1987. Goal programming formulations and extensions, an overview and analysis. Can. J. For. Res. 17:575-581.
31. MIETTINEN, K.M. 1999. Non-linear multiobjective optimization. Kluwer Academic Publishers, Boston/London/Dordrecht. 298 p.
32. MURRAY, A.T. 1999. Spatial restrictions in harvest scheduling. For. Sci. 45(1):45-52.
33. MURRAY, A.T., AND R.L. CHURCH. 1996a. Analyzing cliques for imposing adjacency restrictions in forest models. For. Sci. 42(2):166-175.
34. MURRAY, A.T., AND R.L. CHURCH. 1996b. Constructing and selecting adjacency constraints. INFOR 34(3):232-248.
35. PUKKALA, T. (ED.). 2002. Multi-objective forest planning. Kluwer Academic Publishers, Dordrecht /Boston/London. 207 p.
36. REBAIN, S., AND M.E. MCDILL. 2003a. A mixed-integer formulation of the minimum patch size problem. For. Sci. 49(4):608-618.
37. REBAIN, S., AND M.E. MCDILL. 2003b. Can mature patch constraints mitigate the fragmenting effect of harvest opening size restrictions? Int. Trans. Oper. Res. 10(5):499-513.
38. REVELLE, C. 1993. Facility siting and integer-friendly programming. Eur. J. Oper. Res. 65:147-158.
39. RICHARDS, E.W., AND E.A. GUNN. 2000. A model and tabu search method to optimize stand harvest and road construction schedules. For. Sci. 46(2):188-203.
40. ROISE, J., J. CHUNG, R. LANCIA, AND M. LENNARTZ. 1990. Redcockaded woodpecker habitat and timber management: Production possibilities. South. J. Appl. For. 14:6-12.
41. RUSTAGI, K.P., AND B.B. BARE. 1987. Resolving multiple goal conflicts with interactive goal programming. Can J. For. Res. 17:1401-1407.
42. SADAGOPAN, S., AND A. RAVINDRAN. 1982. Interactive solution of bi-criteria mathematical programs. Naval Res. Logist. Q. 29(3):443-459.
43. SNYDER, S., AND C. REVELLE. 1996a. Temporal and spatial harvesting of irregular systems of parcels. Can. J. For. Res. 26:1079-1088.
44. SNYDER, S., AND C. REVELLE. 1996b. The grid packing problem: Selecting a harvest pattern in an area with forbidden regions. For. Sci. 42(1):27-34.
45. SNYDER, S., AND C. REVELLE. 1997a. Multiobjective grid packing model: An application in forest management. Loc. Sci. 5(3):165-180.
46. SNYDER, S., AND C. REVELLE. 1997b. Dynamic selection of harvests with adjacency restrictions: The SHARe model. For. Sci. 43(2):213-222.
47. THOMPSON, E.F., B.G. HALTERMAN, T.J. LYON, AND R.L. MILLER. 1973. Integrating timber and wildlife management planning. The For. Chron. December:247-250.
48. T'KINDT, V., AND J. BILLAUT. 2002. Multicriteria scheduling: Theory, models, and algorithms. Springer, New York. 303 p.
49. WENDELL, R.E., AND D.N. LEE. 1977. Efficiency in multiple objective optimization problems. Math. Programming 12(3):406-414.
50. WILLIAMS, J.C. 1998. Delineating protected wildlife corridors with multi-objective programming. Envir. Mod. and Assess. 3:77-86.
51. WOLSEY, L.A. 1998. Integer programming. Wiley-Interscience, New York. 266 p.