Incorporating operational road planning constraints into an integrated tactical level harvest-scheduling and road-planning model

Abstract

At the operational scale of forest planning, the location of roads, in a complex terrain, is a decision of major economic importance. The objective is to locate a network of roads connecting pre-selected cut-blocks, at minimal cost, subject to a host of feasibility constraints. The location of the pre-selected cut-blocks is a made at the tactical level of planning, and the decision is made with relative indifference to the cost of the connecting these blocks at the operational scale of planning. The objective of this thesis is to design and evaluate an optimization model by which the location of an operationally feasible road-network can be made simultaneously with the selection of cut-block locations. The underlying assumption of this undertaking is that the optimal locations of both cut-blocks and operational roads are interdependent Our methods are summarized in three steps: first, an exhaustive library of candidate roads is generated, using an operational-scale, road location model; second, a subset of these roads is selected in a tactical planning model which optimally schedules the harvest of cut-blocks and location and construction of roads simultaneously; and third, the tactical solution is mapped, enabling inspection of road-locations at the scale of 50m X 50m. This innovative approach was tested on a portion of the Kenogami Forest, in Ontario, and the results demonstrate its feasibility and ability to reduce road-construction costs. We conclude that the approach is useful for three reasons: first, it can reduce the total cost of constructing a road-network; second, it facilitates innovation in tactical planning by making operational road-location planning methods relevant to tactical level modeling; and finally, it can be practiced on large forests

Similar works

This paper was published in Lakehead University Knowledge Commons.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.