Abstract
Forest management is an activity of prime economic and ecological importance. Managed forest areas can span very large regions and their proper management is paramount to an effective development, in terms both of economic and natural resources planning. A managed activity consists of individual and mutually independent policy choices which apply to distinct patches of land—named stands—which, as a whole, make up the forest area. A forest management plan typically spans a period of time on the order of a century and is normally geared towards the optimisation of economic or environmental metrics (e.g. total wood yield.) In this article we present a method which uses a declarative programming approach to formalise and solve a long-term forest management problem. We do so based on a freely available state-of-the-art constraint programming system, which we extend to naturally express concepts related to the core problem and efficiently compute solutions thereto.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Note that both the management unit identifiers and the prescription identifiers are remapped from the original external arbitrary string representation, which is more complicated than what we have here.
References
Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence. Elsevier (2006)
Krzysztof, R.: Apt. Principles of Constraint Programming. Cambridge University Press (2003)
Machado, R., Abreu, S., Diaz, D.: Parallel performance of declarative programming using a PGAS model. In: Sagonas, K (ed.) Practical Aspects of Declarative Languages - 15th International Symposium, PADL 2013. Rome, Italy. Proceedings, volume 7752 of Lecture Notes in Computer Science, pp. 244–260. Springer, Berlin (2013)
Bettinger, P., Boston, K., Siry, J., Grebner, D.; Spatial restrictions and considerations in forest planning. In: Forest Management and Planning, pp. 249–267. Academic (2017)
Gharbi, C., Ronnqvist, M., Beaudoin, D., Carle, M.-A.: A new mixed-integer programming model for spatial forest planning. Can. J. For. Res. 49, 1493–1503 (2019)
Gunn, E., Richards, E.: Solving the adjacency problem with stand-centered constraints. Can. J. For. Res. 35, 832–842 (2005)
Hof, J., Joyce, L.: a mixed integer linear programming approach for spatially optimizing wildlife and timber in managed forest ecosystems. Forest Sci. 39, 816–834 (1993)
McDill, M.E., Rebain, S., Braze, M.E., McDill, J., Braze, J.: Harvest scheduling with area-based adjacency constraints. Forest Sci. 48(4), 631–642 (2002)
Murray, A.: Spatial restrictions in harvest scheduling. Forest Sci. 45(1), 45–52 (1999)
Goycoolea, M., Murray, A., Vielma, J.P., Weintraub, A.: Evaluating approaches for solving the area restriction model in harvest scheduling. Forest Sci. 55(2), 149–165 (2009)
Baskent, E.Z., Keles, S.: Spatial forest planning: a review. Ecol. Model. 188, 145–173 (2005)
Constantino, M., Martins, I., Borges, J.G.: A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions. Oper. Res. 56(3), 542–551 (2008)
McDill, M.E., Braze, J.: Using the branch and bound algorithm to solve forest planning problems with adjacency constraints. Forest Sci. 47(3), 403–418 (2001)
Boston, K., Bettinger, P.: An analysis of monte carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems. Forest Sci. 45(2), 292–301 (1999)
Borges, P., Eid, T., Bergseng, E.: Applying simulated annealing using different methods for the neighborhood search in forest planning problems. Eur. J. Oper. Res. 233(3), 700–710 (2014)
Boston, K., Bettinger, P.: Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. Forest Sci. 48(1), 35–46 (2002)
Borges, J.G., Hoganson, H.M., Rose, D.W.: Combining a decomposition strategy with dynamic programming to solve the spatially constrained forest management scheduling problem. Forest Sci. 45(1), 201–212 (1999)
Marques, S., Bushenkov, V., Lotov, A., Borges, J.G.: Building pareto frontiers for ecosystem services tradeoff analysis in forest management planning integer programs. Forests 12, 1244 (2021)
Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling. In: Schulte, C., Tack, G., Lagerkvist, M.Z. (eds.) Modeling and Programming with Gecode (2009). Corresponds to Gecode 6.2.0
Prud’homme, C., Fages, J.-G., Lorca, X.: Choco Solver Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2016)
Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: Minizinc: Towards a standard CP modelling language. In: Bessiere, C. (ed.) 13th International Conference on Principles and Practice of Constraint Programming—CP 2007, Providence, RI, USA, Proceedings, volume 4741 of Lecture Notes in Computer Science, pp. 529–543. Springer, Berlin (2007)
Lecoutre, C., Szczepanski, N.: Pycsp3: Modeling combinatorial constrained problems in python (2020). arXiv:2009.00326
Michel, L., Van Hentenryck, P.: Constraint-based local search. In: Martí, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 223–260. Springer, Berlin (2018)
Codognet, P., Munera, D., Diaz, D., Abreu, S.: Parallel local search. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning, pp. 381–417. Springer, Berlin (2018)
Régin, J.-C., Malapert, A.: Parallel constraint programming. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning, pp. 337–379. Springer, Berlin (2018)
Boussemart, F., Lecoutre, C., Audemard, G., Piette, C.: Xcsp3-core: a format for representing constraint satisfaction/optimization problems (2020). arXiv:2009.00514
Machado, R., Pedro, V., Abreu, S.: On the scalability of constraint programming on hierarchical multiprocessor systems. In: 42nd International Conference on Parallel Processing, ICPP 2013, pp. 530–535. IEEE Computer Society,Lyon, France (2013)
Acknowledgements
This work was partly funded by Fundação para a Ciência e Tecnologia (FCT) under grants LISBOA-01-0145-FEDER-030391, PTDC/ASP-SIL/30391/2017 (BIOECOSYS), PCIF/MOS/0217/2017 (MODFIRE), strategic projects UIDB/04674/ 2020 (CIMA) and UIDB/04516/2020 (NOVA LINCS). Some of the experimental work was carried out on the khromeleque cluster of the University of Évora, which was partly funded by grants ALENT-07-0262-FEDER-001872 and ALENT-07-0262-FEDER-001876.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Eloy, E., Bushenkov, V., Abreu, S. (2022). Constraint Modeling for Forest Management. In: Tchemisova, T.V., Torres, D.F.M., Plakhov, A.Y. (eds) Dynamic Control and Optimization. DCO 2021. Springer Proceedings in Mathematics & Statistics, vol 407. Springer, Cham. https://doi.org/10.1007/978-3-031-17558-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-17558-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-17557-2
Online ISBN: 978-3-031-17558-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)