Heuristic procedures for solving mixed-integer harvest scheduling–transportation planning models

Modeling both road construction and land management activities as 0–1 variables greatly enhances the spatial aspect of linear programming models dealing with harvest scheduling and transportation planning. In previous work we developed a heuristic procedure that modeled only road construction as 0–1 variables. We have expanded this past procedure to also consider land management decisions as 0–1 variables. This paper outlines the heuristic procedure developed for modeling both road building and land management decisions as integer variables in light of adjacency constraints. The heuristic procedure allows economic or physical objectives to be maximized or minimized. A wide variety of side constraints can be accommodated and these constraints can include both road construction and land management decision variables. These heuristic procedures have performed well on models tested thus far.