An iterative solution approach for truck routing and scheduling in the forest industry

• Autores: Bordón, Maximiliano; Montagna, Jorge Marcelo; Corsano, Gabriela
• Año de publicación: 2018
• Idioma: inglés
• Tipo de recurso: documento de conferencia
• Materia: Ciencias Informáticas; vehicle routing; vehicle scheduling; forest; MILP
• Institución: Universidad Nacional de La Plata

Log transportation in forest industry is a resource-intensive operation and represents a great challenge for logistic planners. Several trips must be generated in order to satisfy plants demand; in addition, trucks arrivals at each plant must be considered in order to avoid unproductive waiting times. In the Argentine context, specifically in the Argentinean Northeast (NEA) region, these activities represent the main sustenance of the regional economies, so enhancing efficiency in the transport operation would represent a considerable improvement for these economies. In this work, an iterative solution approach for the truck routing and scheduling problems is presented. The proposed strategy involves two stages which are iteratively solved: product allocation, trip composition and truck routing problems are first solved through a Mixed-Integer Linear Programming model (MILP), while in the second stage, fixing the route for each truck according to the results of the previous step, a MILP model for the scheduling of truck arrivals at plants is considered. If no feasible solution for the scheduling problem is obtained, then an integer cut is applied in order to exclude from the search space truck routes already explored in previous iterations. The solution approach is tested in a case study representative of the Argentine context and conclusions are detailed.
Sociedad Argentina de Informática e Investigación Operativa