Allocating reforestation areas for sediment flow minimization: an integer programming formulation and a heuristic solution method

Policy and decision makers dealing with environmental conservation and land use planning often require identifying potential sites for contributing to minimize sediment flow reaching riverbeds. This is the case of reforestation initiatives, which can have sediment flow minimization among their objec...

Full description

Bibliographic Details
Main Author: Vanegas Peralta, Pablo Fernando
Format: ARTÍCULO
Language:es_ES
Published: 2018
Subjects:
Online Access:https://www.scopus.com/record/display.uri?eid=2-s2.0-84861221103&origin=resultslist&sort=plf-f&src=s&sid=bdd5623d1847f74991b72c215bf58c6b&sot=b&sdt=b&s=TITLE-ABS-KEY%28Allocating+reforestation+areas+for+sediment+flow+minimization%29&sl=76&sessionSearchId=bdd5623d1847f74991b72c215bf58c6b&relpos=0
Description
Summary:Policy and decision makers dealing with environmental conservation and land use planning often require identifying potential sites for contributing to minimize sediment flow reaching riverbeds. This is the case of reforestation initiatives, which can have sediment flow minimization among their objectives. This paper proposes an Integer Programming (IP) formulation and a Heuristic solution method for selecting a predefined number of locations to be reforested in order to minimize sediment load at a given outlet in a watershed. Although the core structure of both methods can be applied for different sorts of flow, the formulations are targeted to minimization of sediment delivery. The proposed approaches make use of a Single Flow Direction (SFD) raster map covering the watershed in order to construct a tree structure so that the outlet cell corresponds to the root node in the tree. The results obtained with both approaches are in agreement with expert assessments of erosion levels, slopes and distances to the riverbeds, which in turn allows concluding that this approach is suitable for minimizing sediment flow. Since the results obtained with the IP formulation are the same as the ones obtained with the Heuristic approach, an optimality proof is included in the present work. Taking into consideration that the heuristic requires much less computation time, this solution method is more suitable to be applied in large sized problems.