Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Forest harvest scheduling with clearcut and core area constraints
Publication

Publications

Forest harvest scheduling with clearcut and core area constraints

Title
Forest harvest scheduling with clearcut and core area constraints
Type
Article in International Scientific Journal
Year
2017
Authors
Neto, T
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Constantino, M
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Martins, I
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Joao Pedro Pedroso
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Journal
Vol. 258
Pages: 453-478
ISSN: 0254-5330
Publisher: Springer Nature
Other information
Authenticus ID: P-00K-VDK
Abstract (EN): Many studies regarding environmental concerns in forest harvest scheduling problems deal with constraints on the maximum clearcut size. However, these constraints tend to disperse harvests across the forest and thus to generate a more fragmented landscape. When a forest is fragmented, the amount of edge increases at the expense of the core area. Highly fragmented forests can neither provide the food, cover, nor the reproduction needs of core-dependent species. This study presents a branch-and-bound procedure designed to find good feasible solutions, in a reasonable time, for forest harvest scheduling problems with constraints on maximum clearcut size and minimum core habitat area. The core area is measured by applying the concept of subregions. In each branch of the branch-and-bound tree, a partial solution leads to two children nodes, corresponding to the cases of harvesting or not a given stand in a given period. Pruning is based on constraint violations or unreachable objective values. The approach was tested with forests ranging from some dozens to more than a thousand stands. In general, branch-and-bound was able to quickly find optimal or good solutions, even for medium/large instances.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 26
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

A multi-objective Monte Carlo tree search for forest harvest scheduling (2020)
Article in International Scientific Journal
Neto, T; Constantino, M; Martins, I; Joao Pedro Pedroso

Of the same journal

Using GRASP to Solve the Unit Commitment Problem (2003)
Article in International Scientific Journal
Ana Viana; Jorge Pinho de Sousa; Manuel Matos
Tree search for the stacking problem (2013)
Article in International Scientific Journal
Rui Rei; Joao Pedro Pedroso
The performance of education systems in the light of Europe 2020 strategy (2019)
Article in International Scientific Journal
Dovile Stumbriene; Ana S. Camanho; Audrone Jakaitiene
The assessment of retailing efficiency using network data envelopment analysis (2010)
Article in International Scientific Journal
C. B. Vaz; A. S. Camanho; R. C. Guimarães
The assessment of retailing efficiency using Network Data Envelopment Analysis (2010)
Article in International Scientific Journal
Vaz, CB; Ana Maria Cunha Ribeiro dos Santos Ponces Camanho; Guimaraes, RC

See all (20)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-20 at 13:05:57 | Privacy Policy | Personal Data Protection Policy | Whistleblowing