Unifying reserve design strategies with graph theory and constraint programming

摘要: The delineation of areas high ecological or biodiversity value is a priority any conservation program. However, the selection optimal to be preserved necessarily results from compromise between complexity processes and managers’ constraints. Current reserve design models usually focus on few criteria, which often leads an oversimplification underlying issues. This paper shows that Constraint Programming (CP) can basis more unified, flexible extensible framework. First, problem formalized. Secondly, modeled two different angles by using graph-based models. Then CP used aggregate those through unique Satisfaction Problem. Our model finally evaluated real use case addressing rainforest fragmentation in New Caledonia, hotspot. Results are promising highlight challenging perspectives overtake future work.