Skip to main content

Solving the Afforestation Problem

  • Chapter
Applied Simulated Annealing

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 396))

  • 314 Accesses

Abstract

In this paper the afforestation problem is presented, that is the location and design of new forest compartments to be planted in a given area. This problem was formulated in connection with discussions both in Denmark and in the EEC related to the optimal utilization of land. These discussions ended with a decision of increasing the amount of forest surface in Denmark. In addition, two Decision Support Systems to solve the above mentioned problem will be discussed. The first system has been implemented in a main frame while the second one has been implemented in a PC-environment. A central element in the problem solving process is the simulated annealing algorithm. The implemented heuristic am proaches will be described. Finally, our numerical experiences will be shortly reported.

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

Access this chapter

eBook
USD 16.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. Jorgensen, R.M., and Thomsen, II., Areal allokering: Konstruktion of et beslutningsstottesystem, M.Sc. Thesis nr. 1/90, IMSOR, The Technical University of Denmark, 1990 (in Danish).

    Google Scholar 

  2. Jorgensen, R.M. Thomsen, H., and Vidal, R.V.V., The Afforestation Problem: a heuristic method based on simulated annealing, European Journal of Operational Research 56 (1992) 184–191.

    Article  Google Scholar 

  3. Andersen, K., Anvendt Simuleret Udglodning, M.Sc. Thesis nr. 8/90, IMSOR, The Technical University of Denmark, 1990 (in Danish).

    Google Scholar 

  4. Kurozumi, Y., and Davies, W.A., Polygonial Approximations by the Minimax Method, Computer Graphics and Image Processing 19 (1982) 248–264.

    Article  Google Scholar 

  5. Silver, E.A., Vidal, R.V.V., and de Verra, D., A tutorial on heuristic methods, European Journal of Operational Research 5 (1980) 153–162.

    Article  Google Scholar 

  6. Jarvis, RR.A., On the identification of the convex hull of a finite set of points in the plane, Info. Proc. Lett. 2 (1973) 18–21.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Vidal, R.V.V. (1993). Solving the Afforestation Problem. In: Vidal, R.V.V. (eds) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol 396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46787-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46787-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56229-0

  • Online ISBN: 978-3-642-46787-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics