Optimization of forest tractor transport using operacional research
摘要
This study addresses a routing and scheduling problem related to the transport of forest tractors between harvesting sites using ballast trucks. The problem is framed as a Pickup and Delivery Vehicle Routing Problem with Time Windows (PDVRPTW), and considers factors like road conditions, legal time limits, and a diverse fleet with specific compatibility rules. To address it, we developed a mixed-integer linear programming model aimed at minimizing travel distance, fleet usage, and delays. The model was implemented in CPLEX with a Branch-and-Bound approach and tested using real data from a Brazilian forestry company. Scenarios with varying demand levels–low, medium, and high–were solved optimally in under 3 min. These results show that exact optimization methods can be practical for complex planning in forest logistics, offering valuable insights for future decision-support applications.