Real-World, Large Scale, Multi-Period Log Truck Routing and Scheduling : Application to Canadian Forestry

This paper addresses the multi-period log-truck routing and scheduling problem ($\mathcal{LTRSP}$), a key operational activity in the forestry industry, where transportation accounts for more than one-third of total operational costs.

The Canadian forestry sector faces significant logistical difficulties driven by vast geographic distances, seasonal variability, volatile markets, and environmental considerations.

Our research tackles a long-standing open question in the forestry operations literature, namely the absence of an exact and scalable formulation of the forestry vehicle routing problem integrating the full range of operational constraints \cite{ronnqvist2015operations}: \textit{How can we model and solve an exact formulation of the forestry VRP problem?} In response, we analyze business rules specific to the forestry sector to construct a routing network reflecting real operational practices, and then propose a comprehensive improved mixed-integer linear programming (MILP) formulation incorporating all known forestry operational constraints, with a detailed justification of key modeling choices such as time discretization, along with a decomposition-based solution methodology tailored for large-scale, multi-period industrial instances.

To address the inherent combinatorial complexity, we combine state-of-the-art solvers with a metaheuristic decomposition strategy based on \textit{Relax\&Fix} and \textit{Fix\&Optimize}.

Computational experiments on historical data from a Canadian forest company demonstrate near-optimal results within practical computation times, with significant financial gains and reduced greenhouse gas emissions.