Abstract
In this paper, we describe four decomposition models and a matheuristic based on column generation for the forest harvest scheduling problems subject to maximum area restrictions. Each of the four decomposition models can be seen as a Dantzig-Wolfe decomposition of the so-called bucket formulation (compact mixed integer program), in two cases with additional constraints on the connectivity of the buckets. The matheuristic is based on one of the decomposition models (the \(\mathcal{S}\)-knapsack-and-clique decomposition) and relies on the interaction of column generation with a general purpose mixed integer programming solver. We compare the quality of the solutions obtained for benchmark instances with the bucket formulation and with applying column generation and solving the integer restricted master problem (MipHeur) for the same time limit. We concluded that the proposed matheuristic provides, in general, better solutions than both the other approaches for small and medium instances, while, for large instances, the MipHeur approach outperformed the other two.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alvelos, F., Sousa, A., Santos, D.: Combining column generation and metaheuristics. In: Talbi, E.G. (ed.) Hybrid Metaheuristics. Studies in Computational Intelligence, vol. 434, pp. 285–334. Springer, Berlin (2013)
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46, 316–329 (1998)
Constantino, M., Martins, I., Borges, J.G.: A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions. Oper. Res. 56(3), 542–551 (2008)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 2nd edn. Springer, New York (2000)
Goycoolea, M., Murray, A.T., Barahona, F., Epstein, R., Weintraub, A.: Harvest scheduling subject to maximum area restrictions: exploring exact approaches. Oper. Res. 53(3), 90–500 (2005)
Goycoolea, M., Murray, A.T., Vielma, J.P., Weintraub, A.: Evaluating approaches for solving the area restricted model in harvest scheduling. For. Sci. 55(2), 149–165 (2009)
ILOG, ILOG CPLEX 12.4 – User’s Manual (2011)
Martins, I., Constantino, M., Borges, J.G.: A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints. Eur. J. Oper. Res. 161(2), 478–498 (2005)
Martins, I., Alvelos, F., Constantino, M.: A branch-and-price approach for harvest scheduling subject to maximum area restrictions. Comput. Optim. Appl. 51, 363–385 (2012)
Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26, 35–62 (1988)
Vielma, J.P., Murray, A.T., Ryan, D.M., Weintraub, A.: Improving computational capabilities for adressing volume constraints in forest harvest scheduling problems. Eur. J. Oper. Res. 176(2), 1246–1264 (2007)
Acknowledgements
This research was partially supported by Fundao para a Cincia e a Tecnologia, projects UID/MAT/04561/2013, PEst-OE/EEI/UI0319/2014 and PTDC/EIAEIA/100645/ 2008 (SearchCol: Metaheuristic search by column generation). We wish to thank Andres Weintraub and Jos G. Borges (through the project PTDC/AGR-CFL/64146/2006) for providing some real test forest data.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Martins, I., Alvelos, F., Constantino, M. (2015). Decompositions and a Matheuristic for a Forest Harvest Scheduling Problem. In: Almeida, J., Oliveira, J., Pinto, A. (eds) Operational Research. CIM Series in Mathematical Sciences, vol 4. Springer, Cham. https://doi.org/10.1007/978-3-319-20328-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-20328-7_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20327-0
Online ISBN: 978-3-319-20328-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)