Partitioning and solving large-scale tactical harvest scheduling problems for industrial plantation forests

Spatially explicit, tactical forest planning is a necessary but challenging task in the management of plantation forests. It involves harvest scheduling and planning for road access and log transportation over time and space. This combinatorial problem can be formulated into the fixed-charge transportation problem (FCTP), in which the sum of fixed and variable costs is minimized while meeting harvest volume requirements and allowing necessary road maintenance and log hauling activities. The problem can be solved using general optimization methods such as mixed-integer linear programming (MILP), but the computational efficiency of the MILP-based approach quickly drops as the size and complexity of the problem increases. We developed a new optimization procedure that partitions the large planning problem into smaller subproblems. We applied a hybrid optimization approach using both MILP and heuristic rules to efficiently solve the large FCTP that otherwise may not be solvable using traditional methods. We applied our approach to an industrial plantation forest in Brazil. Our applications demonstrate the performance of the new optimization procedure and the benefit of solving large forest planning problems that integrate harvest scheduling with road access and transportation.The accepted manuscript in pdf format is listed with the files at the bottom of this page. The presentation of the authors' names and (or) special characters in the title of the manuscript may differ slightly between what is listed on this page and what is listed in the pdf file of the accepted manuscript; that in the pdf file of the accepted manuscript is what was submitted by the author