Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems

Vielma JP; Murray, AT; Ryan, DM; Weintraub A.

Abstract

Forest Harvest Scheduling problems incorporating area-based restrictions have been of great practical interest for several years, but only recently have advances been made that allow them to be efficiently solved. One significant development has made use of formulation strengthening using the Cluster Packing Problem. This improved formulation has allowed medium sized problems to be easily solved, but when restrictions on volume production over time are added, problem difficulty increases substantially. In this paper, we study the degrading effect of certain types of volume constraints and propose methods for reducing this effect. Developed methods include the use of constraint branching, the use of elastic constraints with dynamic penalty adjustment and a simple integer allocation heuristic. Application results are presented to illustrate the computational improvement afforded by the use of these methods. © 2005 Elsevier B.V. All rights reserved.

Más información

Título según WOS: Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
Título según SCOPUS: Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
Título de la Revista: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 176
Número: 2
Editorial: ELSEVIER SCIENCE BV
Fecha de publicación: 2007
Página de inicio: 1246
Página final: 1264
Idioma: English
URL: http://linkinghub.elsevier.com/retrieve/pii/S0377221705007174
DOI:

10.1016/j.ejor.2005.09.016

Notas: ISI, SCOPUS