Log transportation in the forest industry is a key issue for the success of any firm. This operation involves complex decision making, requiring suitable approaches with high computational performance. The main decisions to be considered are related to the fleet size and log supply to minimize transportation costs. Thus, the number of vehicles to be used, the harvest areas that supply each plant and, the type and quantity of raw material to be transported must be determined. This article focuses on transportation planning. Specifically, the objective is to determine the set of routes to be performed by the truck fleet to supply raw material from harvest areas to plants in order to satisfy their demands. The contribution of this paper is twofold: first, an efficient Integer Programming (IP) model is presented to solve this problem; second, taking into account the solution requirements, a Column Generation based approach is developed to obtain near-optimal solutions in a short computational time. Through the examples, both proposals are evaluated and the benefits of each approach are presented.

森林工业中的原木运输是任何公司成功的关键问题。此操作涉及复杂的决策制定，需要具有高计算性能的合适方法。要考虑的主要决策与车队规模和原木供应有关，以最大限度地降低运输成本。因此，必须确定要使用的车辆数量、供应每种植物的收获区域以及要运输的原材料的类型和数量。本文重点介绍交通规划。具体而言，目标是确定卡车车队要执行的一组路线，以将原材料从收获区供应到工厂以满足他们的需求。本文的贡献有两个：首先，提出了一个有效的整数规划（IP）模型来解决这个问题；第二，考虑到解决方案的要求，开发了一种基于列生成的方法，以在较短的计算时间内获得接近最优的解决方案。通过示例，对这两个建议进行了评估，并介绍了每种方法的好处。