Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem

Adejuyigbe O. Fajemisin ^[1] ; Steven D. Prestwich ^[2] ; Laura Climent ^[3]
1. [1] University of Amsterdam
  
  University of Amsterdam
  
  Países Bajos
2. [2] University College Cork
  
  University College Cork
  
  Irlanda
3. [3] Universidad Autónoma de Madrid
  
  Universidad Autónoma de Madrid
  
  Madrid, España
Mostrar afiliaciones +
Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 31, Nº. 1, 2023, págs. 139-164
Idioma: inglés
Enlaces
- Texto completo
Resumen
- Sustainable forest management is concerned with the management of forests according to the principles of sustainable development.
  
  As a contribution to the feld, 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.