Logo Repositorio Institucional

Please use this identifier to cite or link to this item: http://dspace.ucuenca.edu.ec/handle/123456789/22164
Title: Allocating reforestation areas for sediment flow minimization: an integer programming formulation and a heuristic solution method
Other Titles: Optimization and Engineering
Authors: Vanegas, Pablo
Cattrysse, Dirk
Van Orshoven, Jos
Keywords: Site Location
Site Allocation
Flow Minimization
Integer
Programming
Ip
Sediment Flow Minimization
Issue Date: Jun-2012
metadata.dc.ucuenca.paginacion: Páginas 247-269
metadata.dc.description.numberSequence: 
volumen 13; número 2
metadata.dc.identifier.doi: doi: 10.1007/s11081-011-9138-2
metadata.dc.description.city: 
Cuenca
metadata.dc.type: Article
Abstract: 
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.
URI: http://dspace.ucuenca.edu.ec/handle/123456789/22164
Appears in Collections:Artículos

Files in This Item:
There are no files associated with this item.


This item is protected by original copyright



This item is licensed under a Creative Commons License Creative Commons

 

Centro de Documentacion Regional "Juan Bautista Vázquez"

Biblioteca Campus Central Biblioteca Campus Salud Biblioteca Campus Yanuncay
Av. 12 de Abril y Calle Agustín Cueva, Telf: 4051000 Ext. 1311, 1312, 1313, 1314. Horario de atención: Lunes-Viernes: 07H00-21H00. Sábados: 08H00-12H00 Av. El Paraíso 3-52, detrás del Hospital Regional "Vicente Corral Moscoso", Telf: 4051000 Ext. 3144. Horario de atención: Lunes-Viernes: 07H00-19H00 Av. 12 de Octubre y Diego de Tapia, antiguo Colegio Orientalista, Telf: 4051000 Ext. 3535 2810706 Ext. 116. Horario de atención: Lunes-Viernes: 07H30-19H00