If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Solving the area-restricted harvest-scheduling model using the branch and bound algorithm

$50.00 plus tax (Refund Policy)

Buy Article:

Abstract:

There are two broad approaches to the discrete optimization problem of harvest scheduling with adjacency constraints: the unit-restricted model and the area-restricted model. In this paper two formulations of the area-restricted model are solved using the branch and bound algorithm. These formulations are tested on a set of approximately 30 tactical planning problems that range in size from 346 to 6093 polygons scheduled over three time periods. Our results show that these formulations can be used to solve small- and medium-sized harvest-scheduling problems optimally, or near-optimally, within reasonable periods of computing time. Solution quality and computing time were found to be sensitive to the initial age-class distribution of the forest and the mean polygon size relative to the maximum opening size. In addition, computation of the opening size constraints was found to be very sensitive to the maximum number of polygons in an opening constraint.

Il existe deux grandes approches pour résoudre un problème d'optimisation discrète de calendrier de récolte avec des contraintes d'adjacence : le modèle avec superficies prédéterminées et le modèle avec superficies formées dynamiquement. Dans cet article, deux formulations du modèle avec superficies formées dynamiquement sont résolues à l'aide d'une méthode arborescente. Ces formulations sont testées sur un ensemble d'environ 30 problèmes de pla ni fication tactique variant en taille de 346 à 6093 polygones, prévus sur trois périodes. Les résultats montrent que ces formulations peuvent être utilisées pour résoudre de façon optimale ou quasi optimale et avec un temps de calcul raisonnable des problèmes d'ordonnancement de petite et de moyenne taille. On a observé que la qualité de la solution ainsi que le temps de calcul étaient sensibles à la distribution initiale des classes d'age de la forêt et à la taille moyenne des polygones en relation avec la taille maximale des aires de coupe. De plus, le calcul des contraintes de taille des aires de coupe était très sensible au nombre maximum de polygones pouvant être contenu dans une contrainte d'aire de coupe.[Traduit par la Rédaction]

Document Type: Research Article

Publication date: September 1, 2003

More about this publication?
  • Published since 1971, this monthly journal features articles, reviews, notes and commentaries on all aspects of forest science, including biometrics and mensuration, conservation, disturbance, ecology, economics, entomology, fire, genetics, management, operations, pathology, physiology, policy, remote sensing, social science, soil, silviculture, wildlife and wood science, contributed by internationally respected scientists. It also publishes special issues dedicated to a topic of current interest.
  • Information for Authors
  • Submit a Paper
  • Subscribe to this Title
  • Terms & Conditions
  • Sample Issue
  • Reprints & Permissions
  • ingentaconnect is not responsible for the content or availability of external websites
Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more