Skip to main content

Compactness and Flow Minimization Requirements in Reforestation Initiatives: An Integer Programming (IP) Formulation

  • Conference paper
Computational Science and Its Applications – ICCSA 2009 (ICCSA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5592))

Included in the following conference series:

Abstract

Identifying optimal sites on raster maps is a complex problem when the sites are larger than the cell size. Optimal sites involves a trade-off between the intrinsic characteristics of individual cells and the spatial configuration of the cells. Although there are a number of techniques to solve the site allocation problem, those solutions do not consider spatial interactions between the cells forming the site. This paper presents an Integer Programming Formulation (IP) for allocating a predefined number of cells satisfying the following criteria: 1) minimize flow (water, sediment) reaching the outlet of a watershed, 2) maximize/minimize intrinsic characteristics of the cells, and 3) form a compact patch. Although the core structure of the IP formulation can be applied for different sorts of flow and intrinsic characteristics, it is targeted to a reforestation application. The proposed approach is applied to perform several experiments in two watersheds in South Dakota in the USA for searching a given number of best cells (1) minimizing sediment reaching the watershed outlet,(2) maximizing the environmental criteria, and (3) forming a compact patch. The results obtained with the IP formulation are in agreement with expert assessments of erosion levels, slopes and distances to the riverbeds.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vanegas, P., Cattrysse, D., Van Orshoven, J.: Comparing exact and heuristic methods for site location based on multiple attributes: An afforestation application. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part I. LNCS, vol. 5072, pp. 389–404. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Church, R., Gerrard, R., Gilpin, M., Stine, P.: Constructing cell-based habitat patches useful in conservation planning. Annals of the Association of American Geographers 93, 814–827 (2003)

    Article  Google Scholar 

  3. Gilbert, K., Holmes, D., Rosenthal, R.: A multiobjective discrete optimization model for land allocation. Management Science 31, 1509–1522 (1985)

    Article  Google Scholar 

  4. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory algorithms, and applications. Prentice-Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  5. Van-Orshoven, J.: Introduction to spatial data modelling and functionality of geospatial technology. Department of Earth and Environmental Sciences. K.U.Leuven (2007)

    Google Scholar 

  6. Hof, J., Bevers, M.: Direct spatial optimization in natural resource management: Four linear programming examples. Annals of Operations Research 95, 67–91 (2000)

    Article  MATH  Google Scholar 

  7. Church, R., ReVelle, C.: The maximal covering location model. Regional Science Association 32, 101–118 (1974)

    Article  Google Scholar 

  8. Dimopoulou, M., Giannoikos, I.: Spatial optimization of resources deployment for forest-fire management. International Transactions in Operational Research 8, 523–534 (2001)

    Article  MATH  Google Scholar 

  9. Church, R., Stoms, D., Davis, F., Okin, B.: Planning management activities to protect biodiversity with a gis and an integrated optimization model. In: Proceedings of the Third international conference/workshop on Integrating GIS and environmental modeling (1996)

    Google Scholar 

  10. Fischer, D., Church, R.: Clustering and compactness in reserve site selection: An extension of the biodiversity management area selection model. Forest Science 49, 555–565 (2003)

    Google Scholar 

  11. Williams, J.: A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs. Networks 39, 53–60 (2001)

    Article  MATH  Google Scholar 

  12. Williams, J.: A zero-one programming model for contiguous land acquisition. Geographical Analysis 34, 330–349 (2002)

    Article  Google Scholar 

  13. Shirabe, T.: Modeling topological properties of a raster region for spatial optimization. In: Proceedings of the 11th International Symposium on Spatial Data Handling (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vanegas, P., Cattrysse, D., Van Orshoven, J. (2009). Compactness and Flow Minimization Requirements in Reforestation Initiatives: An Integer Programming (IP) Formulation. In: Gervasi, O., Taniar, D., Murgante, B., Laganà, A., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2009. ICCSA 2009. Lecture Notes in Computer Science, vol 5592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02454-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02454-2_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02453-5

  • Online ISBN: 978-3-642-02454-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics