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

Mixed integer linear programming approaches for solving the raw material allocation, routing and scheduling problems in the forest industry

Bordon, Maximiliano RamonIcon ; Montagna, Jorge MarceloIcon ; Corsano, GabrielaIcon
Fecha de publicación: 09/2020
Editorial: Growing Science
Revista: International Journal of Industrial Engineering Computations
ISSN: 1923-2926
e-ISSN: 1923-2934
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:
Otras Ingeniería Química

Resumen

Transportation planning in forest industry is a challenging activity since it involves complex decisions about raw material allocation, vehicle routing and scheduling of trucks arrivals to both harvest areas and the plants. In the Argentine context, specifically in the Argentinean Northeast (NEA) region, the forest industry plays essential role for the economic development and, among the included activities, the transportation is the key element considering the volumes that must be moved and the distances to be traveled. Therefore, enhancing efficiency in the transportation activity improves significantly the performance of this industry. In this work, a Mixed Integer Linear Programming (MILP) model is presented, where raw material allocation, vehicle routing and scheduling of trucks arrivals are simultaneously addressed. Since the resolution times of the proposed integrated MILP model are prohibitive for large instances, a hierarchical approach is also presented. The considered decomposition approach involves two stages: in the first phase, the raw material allocation and vehicle routing problems are solved through a MILP model, while in the second phase, fixing the route for each truck according to the results of the previous step, the scheduling of truck arrivals to both the harvest areas and the plants is solved through a new MILP model. The obtained results show that the proposed approach is very effective and could be easily applied in this industry.
Palabras clave: FOREST INDUSTRY , LOG TRANSPORTATION , MILP , SCHEDULING , VEHICLE ROUTING
Ver el registro completo
 
Archivos asociados
Thumbnail
 
Tamaño: 496.5Kb
Formato: PDF
.
Descargar
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution 2.5 Unported (CC BY 2.5)
Identificadores
URI: http://hdl.handle.net/11336/136171
URL: http://growingscience.com/beta/ijiec/4020-mixed-integer-linear-programming-appro
DOI: http://dx.doi.org/10.5267/j.ijiec.2020.5.001
Colecciones
Articulos(INGAR)
Articulos de INST.DE DESARROLLO Y DISEÑO (I)
Citación
Bordon, Maximiliano Ramon; Montagna, Jorge Marcelo; Corsano, Gabriela; Mixed integer linear programming approaches for solving the raw material allocation, routing and scheduling problems in the forest industry; Growing Science; International Journal of Industrial Engineering Computations; 11; 4; 9-2020; 525-548
Compartir
Altmétricas
 

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