Repositorio Institucional
Repositorio Institucional
CONICET Digital
  • Inicio
  • EXPLORAR
    • AUTORES
    • DISCIPLINAS
    • COMUNIDADES
  • Estadísticas
  • Novedades
    • Noticias
    • Boletines
  • Ayuda
    • General
    • Datos de investigación
  • Acerca de
    • CONICET Digital
    • Equipo
    • Red Federal
  • Contacto
JavaScript is disabled for your browser. Some features of this site may not work without it.
  • INFORMACIÓN GENERAL
  • RESUMEN
  • ESTADISTICAS
 
Artículo

Forest harvest operations productivity forecasting: a decisions tree approach

Rossit, Daniel AlejandroIcon ; Olivera, Alejandro; Viana-Céspedes, Víctor; Broz, Diego RicardoIcon
Fecha de publicación: 18/03/2024
Editorial: Taylor & Francis
Revista: International Journal of Forest Engineering
ISSN: 1494-2119
e-ISSN: 1913-2220
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:
Otras Ingenierías y Tecnologías

Resumen

In recent years, the machinery used in forest harvesting operations has incorporated the ability to collect data during the harvesting operation automatically. The processing of these data allows for obtaining new perspectives on the harvest characteristics. In this sense, it is that the development of predictive models for harvest productivity is approached by processing the automatically retrieved data. In turn, these new models pave the way to develop new tools for operations management decision-making processes, providing a data-driven approach. In this case, forest productivity is analyzed based on different harvesting operational configurations defined by stand, trees, species, operators, shifts, etc., which make it possible to adequately predict what the wood-harvested volume will be, and thus, synchronize the rest of the supply chain logistics operations. The data processing is done through decision tree methods. Different methods of decision trees based on exhaustive CHAID, recursive binary partition, and conditional inference based that also uses binary recursive partition are tested. The results show that decision recursive binary partition methods tend to model more balanced the entire spectrum of the target variable more. While exhaustive CHAID-based methods tend to be more accurate in global terms but more unbalanced. As a general comment for the method, global confusion matrices are around 50% of accuracy, and some operational configurations and productivity classes are predicted with almost 90% of accuracy.
Palabras clave: MACHINE LEARNING , FOREST HARVEST PRODUCTIVITY , BINARY RECURSIVE PARTITION , OPERATIONS MANAGEMENT , DATA-DRIVEN , OPERATIONS PLANNING
Ver el registro completo
 
Archivos asociados
Tamaño: 1.420Mb
Formato: PDF
.
Solicitar
Licencia
info:eu-repo/semantics/restrictedAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/232419
URL: https://www.tandfonline.com/doi/full/10.1080/14942119.2024.2327243?src=exp-la
URL: https://doi.org/10.1080/14942119.2024.2327243
Colecciones
Articulos(INMABB)
Articulos de INST.DE MATEMATICA BAHIA BLANCA (I)
Citación
Rossit, Daniel Alejandro; Olivera, Alejandro; Viana-Céspedes, Víctor; Broz, Diego Ricardo; Forest harvest operations productivity forecasting: a decisions tree approach; Taylor & Francis; International Journal of Forest Engineering; 18-3-2024; 1-13
Compartir

Enviar por e-mail
Separar cada destinatario (hasta 5) con punto y coma.
  • Facebook
  • X Conicet Digital
  • Instagram
  • YouTube
  • Sound Cloud
  • LinkedIn

Los contenidos del CONICET están licenciados bajo Creative Commons Reconocimiento 2.5 Argentina License

https://www.conicet.gov.ar/ - CONICET

Inicio

Explorar

  • Autores
  • Disciplinas
  • Comunidades

Estadísticas

Novedades

  • Noticias
  • Boletines

Ayuda

Acerca de

  • CONICET Digital
  • Equipo
  • Red Federal

Contacto

Godoy Cruz 2290 (C1425FQB) CABA – República Argentina – Tel: +5411 4899-5400 repositorio@conicet.gov.ar
TÉRMINOS Y CONDICIONES