Designing connected nature reserve networks using a graph theory approach

Habitat fragmentation has been cited as one of the critical reasons for biodiversity loss. Establishing connected nature reserve networks is an effective way to reduce habit fragmentation. However, the resources devoted to nature reserves have always been scarce. Therefore it is important to allocate our scarce resources in an optimal way. The optimal design of a reserve network which is effective both ecologically and economically has become an important research topic in the reserve design literature. The problem of optimal selection of a subset from a larger group of potential habitat sites is solved using either heuristic or formal optimization methods. The heuristic methods, although flexible and computationally fast, can not guarantee the solution is optimal therefore may lead to scarce resources being used in an ineffective way. The formal optimization methods, on the other hand, guarantees the solution is optimal, but it has been argued that it would be difficult to model site selection process using optimization models, especially when spatial attributes of the reserve have to be taken into account. This paper presents a linear integer programming model for the design of a minimal connected reserve network using a graph theory approach. A connected tree is determined corresponding to a connected reserve. Computational performance of the model is tested using datasets randomly generated by the software GAMS. Results show that the model can solve a connected reserve design problem which includes 100 potential sites and 30 species in a reasonable period of time. As an empirical application, the model is applied to the protection of endangered and threatened bird species in the Cache River basin area in Illinois, US. Two connected reserve networks are determined for 13 bird species.