Multiple solution harvest scheduling
Van Deusen P. C. (1999). Multiple solution harvest scheduling. Silva Fennica vol. 33 no. 3 article id 657. https://doi.org/10.14214/sf.657
Application of the Metropolis algorithm for forest harvest scheduling is extended by automating the relative weighting of objective function components. Previous applications of the Metropolis algorithm require the user to specify these weights, which demands substantial trial and error in practice. This modification allows for general incorporation of objective function components that are either periodic or spatial in nature. A generic set of objective function components is developed to facilitate harvest scheduling for a wide range of problems. The resulting algorithm generates multiple feasible solutions rather than a single optimal solution.
simulated annealing; Metropolis algorithm; Gibb’s sampler
Received 11 March 1999 Accepted 27 July 1999 Published 31 December 1999
Available at https://doi.org/10.14214/sf.657 | Download PDF