Search

Forest biomass and carbon monitoring play a key role in climate change mitigation. Operational large area monitoring approaches are needed to enable forestry stakeholders to meet the increasing monitoring and reporting requirements. Here, we demonstrate the functionality of a cloud-based approach utilizing Sentinel-2 composite imagery and process-based ecosystem model to produce large area forest volume and primary production estimates. We describe the main components of the approach and implementation of the processing pipeline into the Forestry TEP cloud processing platform and produce four large area output maps: (1) Growing stock volume (GSV), (2) Gross primary productivity (GPP), (3) Net primary productivity (NPP) and (4) Stem volume increment (SVI), covering Finland and the Russian boreal forests until the Ural Mountains in 10 m spatial resolution. The accuracy of the forest structural variables evaluated in Finland reach pixel level relative Root Mean Square Error (RMSE) values comparable to earlier studies (basal area 39.4%, growing stock volume 58.5%, diameter 35.5% and height 33.5%), although most of the earlier studies have concentrated on smaller study areas. This can be considered a positive sign for the feasibility of the approach for large area primary production modelling, since forest structural variables are the main input for the process-based ecosystem model used in the study. The full coverage output maps show consistent quality throughout the target area, with major regional variations clearly visible, and with noticeable fine details when zoomed into full resolution. The demonstration conducted in this study lays foundation for further development of an operational large area forest monitoring system that allows annual reporting of forest biomass and carbon balance from forest stand level to regional analyses. The system is seamlessly aligned with process based ecosystem modelling, enabling forecasting and future scenario simulation. [ABSTRACT FROM AUTHOR]

The dial-a-ride problem (DARP) involves the dispatching of a fleet of vehicles to transport customers requesting service and is one of the most challenging tasks of combinatorial optimization. We study the DARP as a constraint satisfaction problem, where the goal is to find a feasible solution with respect to the time, capacity, and precedence constraints, or to prove infeasibility. The main contribution of our work is a new robust method for this problem formulation. The algorithm is based on a dynamic subroutine that finds for any set of customers a maximum cluster, that is, a maximal set of customers that can be served by a single vehicle. The performance of the algorithm is analyzed and evaluated by means of computational experiments, justifying the efficiency of the solution method. [ABSTRACT FROM AUTHOR]