Abstract
AbstractSustainable forest management is concerned with the management of forests according to the principles of sustainable development. As a contribution to the field, this paper combines the Vehicle Routing Problem (VRP) (in which the vehicles are harvesters) with the Multiple Stock Size Cutting Stock Problem under uncertainty (in which the stock is logs). We present an Integer Linear Program that dynamically combines the cutting of the uncertain stock with vehicle routing, and uses it to address real-life problems. In experiments on real data from the forestry harvesting industry, we show that it outperforms a commonly used metaheuristic algorithm.
Funder
Science Foundation Ireland
Universidad Autónoma de Madrid
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Statistics and Probability,Management Science and Operations Research,Information Systems and Management,Modeling and Simulation
Reference50 articles.
1. Ali O, Verlinden B, Van Oudheusden D (2009) Infield logistics planning for crop-harvesting operations. Eng Optim 41(2):183–197
2. Alves C, de Carvalho JMV (2008) A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput OR 35(4):1315–1328. https://doi.org/10.1016/j.cor.2006.08.014
3. Anderson D, Sweeney D, Williams T, Camm J, Cochran J (2015) An introduction to management science: quantitative approaches to decision making. Cengage Learn
4. Basnet C, Foulds LR, Wilson J (2006) Scheduling contractors’ farm-to-farm crop harvesting operations. Int Trans Oper Res 13(1):1–15
5. Bellman RE, Dreyfus SE (2015) Applied dynamic programming. Princeton university press
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献