Graph Theory and Open-space Network Design

A decision support system designed to aid the planning and creation of green-space or open-space networks is described. The system relies on data describing current land cover and existing conservation lands, and may be extended to include any number of other ancillary data sources. The system incorporates algorithms developed in the fields of graph theory and operations research but also describes two new algorithms. The system demonstrates the application of existing graph theory algorithms in reserve design problems by illustrating the similarity and differences between classic graph theory problems and those faced by planning officials. Notions of connectivity and parsimony important to researchers in both fields are explicitly addressed.

[1]  Stefan Voß,et al.  A chunking based genetic algorithm for the Steiner tree problem in graphs , 1997, Network Design: Connectivity and Facilities Location.

[2]  E. Rapoport,et al.  The design of nature reserves: A simulation trial for assessing specific conservation value , 1986 .

[3]  A. V. Jaarsveld,et al.  Ranking priority biodiversity areas : An iterative conservation value-based approach , 1997 .

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  R. W. Purdie,et al.  Selection of a conservation reserve network in the Mulga Biogeographic Region of South-Western Queensland, Australia , 1986 .

[6]  M. Lockwood,et al.  Integrated Protected Area Selection in Australian Biogeographic Regions , 1997, Environmental management.

[7]  E. Russell,et al.  The use of theory in land management decisions: The New Jersey pine barrens , 1994 .

[8]  Ferenc Jordán,et al.  A reliability-theory approach to corridor design , 2000 .

[9]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

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

[11]  Zhijun Ma,et al.  Designing the core zone in a biosphere reserve based on suitable habitats: Yancheng Biosphere Reserve and the red crowned crane (Grus japonensis) , 1999 .

[12]  A. O. Nicholls,et al.  An upgraded reserve selection algorithm , 1993 .

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

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

[15]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

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

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

[18]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

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

[20]  K. D. Cocks,et al.  Using mathematical programming to address the multiple reserve selection problem: An example from the Eyre Peninsula, South Australia , 1989 .

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

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

[23]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

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