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

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

0.00 Avg rating0 Votes
Article ID: iaor20084537
Country: Netherlands
Volume: 176
Issue: 2
Start Page Number: 1246
End Page Number: 1264
Publication Date: Jan 2007
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: scheduling, combinatorial optimization, programming: branch and bound
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.

Reviews

Required fields are marked *. Your email address will not be published.