A Parallelized Variable Fixing Process for Solving Multistage Stochastic Programs with Progressive Hedging. (12th December 2020)

• Record Type: Journal Article
• Authors: Bagaram, Martin B.; Tóth, Sándor F.; Jaross, Weikko S.; Weintraub, Andrés
• Other Names: Repoussis Panagiotis P. Academic Editor.
• Is Part Of: Advances in operations research. Volume 2020(2020)
• Publication Date: 2020-12-12
• Subjects: Operations research -- Periodicals; Operations research; Periodicals; 003
• DOI: 10.1155/2020/8965679
• Languages: English
• ISSNs: 1687-9147

Abstract

Abstract : Long time horizons, typical of forest management, make planning more difficult due to added exposure to climate uncertainty. Current methods for stochastic programming limit the incorporation of climate uncertainty in forest management planning. To account for climate uncertainty in forest harvest scheduling, we discretize the potential distribution of forest growth under different climate scenarios and solve the resulting stochastic mixed integer program. Increasing the number of scenarios allows for a better approximation of the entire probability space of future forest growth but at a computational expense. To address this shortcoming, we propose a new heuristic algorithm designed to work well with multistage stochastic harvest-scheduling problems. Starting from the root-node of the scenario tree that represents the discretized probability space, our progressive hedging algorithm sequentially fixes the values of decision variables associated with scenarios that share the same path up to a given node. Once all variables from a node are fixed, the problem can be decomposed into subproblems that can be solved independently. We tested the algorithm performance on six forests considering different numbers of scenarios. The results showed that our algorithm performed well when the number of scenarios was large.