Delineating protected wildlife corridors with multi‐objective programming

Protected wildlife corridors can help counteract habitat fragmentation and link isolated reserve “islands” into connected reserve systems. The need for wildlife corridors will grow as expanding human populations place increasing pressure on remaining undeveloped land. A two‐objective zero–one programming model is formulated for the problem of selecting land for a system of wildlife corridors that must connect a known set of existing reserves or critical habitat areas. This problem is modeled as a network Steiner tree problem, under the objectives of minimizing corridor land costs and minimizing the amount of unsuitable land within the corridor system. Linear programming is used to find exact solutions with little or no branching and bounding, and the multi‐objective weighting method is used to generate non‐inferior alternatives. Two hypothetical examples demonstrate the model and solution procedure. Results can help inform planning and decision making for protected area land acquisition and habitat restoration.

[1]  Hugh P. Possingham,et al.  Effectiveness of alternative heuristic algorithms for identifying indicative minimum requirements for conservation reserves , 1997 .

[2]  Charles C. Mann,et al.  The high cost of biodiversity. , 1993, Science.

[3]  J. C. Allen.  Multiobjective regional forest planning using the noninferior set estimation (NISE) method in Tanzania and the united states , 1986 .

[4]  Hugh P. Possingham,et al.  Optimality in reserve selection algorithms: When does it matter and how much? , 1996 .

[5]  Raphael B. B. Mwalyosi,et al.  Ecological evaluation for wildlife corridors and buffer zones for Lake Manyara National Park, Tanzania, and its immediate environment , 1991 .

[6]  Richard L. Church,et al.  Reserve selection as a maximal covering location problem , 1996 .

[7]  Richard J. Hobbs,et al.  Nature Conservation 2: The Role of Corridors , 1993 .

[8]  Charles ReVelle,et al.  Applying mathematical programming to reserve selection , 1997 .

[9]  James A. Cox,et al.  Consequences and Costs of Conservation Corridors , 1987 .

[10]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[11]  N. Maculan.  The Steiner Problem in Graphs , 1987 .

[12]  Da. Saunders,et al.  The role of corridors in conservation: what do we know and where do we go? , 1991 .

[13]  Les G. Underhill,et al.  Optimal and suboptimal reserve selection algorithms , 1994 .

[14]  M. Soulé,et al.  Land Use Planning and Wildlife Maintenance: Guidelines for Conserving Wildlife in an Urban Landscape , 1991 .

[15]  L. M. Rasmussen.  Zero--one programming with multiple criteria , 1986 .

[16]  Charles C. Mann,et al.  Are Wildlife Corridors the Right Path? , 1995, Science.

[17]  E. L. Ulungu,et al.  Multi‐objective combinatorial optimization problems: A survey , 1994 .

[18]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  D. Simberloff,et al.  What do genetics and ecology tell us about the design of nature reserves , 1986 .

[20]  C. Revelle,et al.  A 0–1 Programming Approach to Delineating Protected Reserves , 1996 .

[21]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[23]  Harvey M. Salkin,et al.  Foundations of integer programming , 1989 .

[24]  R. Primack,et al.  Essentials of Conservation Biology , 1994 .

[25]  C. Margules,et al.  Modern biogeographic theory: Are there any lessons for nature reserve design? , 1982 .

[26]  John Sessions,et al.  Solving for Habitat Connections as a Steiner Network Problem , 1992 .

[27]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[28]  Justin C. Williams,et al.  Reserve assemblage of critical areas: A zero-one programming approach , 1998 .

[29]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[30]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.