This record is currently in review state, the data hasn’t been validated yet.
Bont, Leo G.
Heinimann, Hans Rudolf
- Other Conference Item
A well-performing network of forest reserve areas can support the conservation of biodiversity in densely populated and intensively used landscapes. Reserve area quality, network connectivity as well as the existence of some large reserve areas are suitable indicators for performance assessment. Amongst others, optimal location of the latter can be a cumbersome task in those landscapes because suitable areas are rare. Here, we will present a mixed integer-linear programming (MILP) model which selects the best-performing contiguous reserve area pattern. Performance is measured via criteria dependent on the conservation goal for each potential reserve area. Contiguity is assessed based on a network representation of the problem, where the nodes represent potential forest reserve areas and edges connect adjacent areas. A network flow approach is then applied to identify a contiguous sub graph which connects all potential reserve sites. The initial optimization results may include cycles (i.e., isolated sub graphs) which are iteratively resolved by adding cycle-breaking constraints until a contiguous sub graph results. The model has been implemented in MATLAB, and GUROBI was used as a solver. We report on its application on the Entlebuch region (forested area 230 km2) in Switzerland which requires the consideration of ecological and economic criteria Show more
External linksSearch via SFX
Organisational unit03331 - Heinimann, Hans-Rudolf
NotesConference lecture on 19 August 2016
MoreShow all metadata