A Simulated Annealing-Based Algorithm for the Flatbed Truck Routing Problem in an Open Pit Mine

In open-pit mining operations, the efficient relocation of large-scale equipment between different mining fronts is crucial to maintaining productivity. This process depends on specialized tow trucks capable of safely transporting these machines. This study addresses the routing problem of these trucks, formulated as a Vehicle Routing Problem (VRP) with multiple operational constraints, including pickup and delivery, time windows, and a heterogeneous fleet. Given the limitations of exact methods in large-scale scenarios, a heuristic approach based on the Simulated Annealing (SA) metaheuristic is proposed. The methodology was validated using real-world data from a large open-pit mine and compared against a benchmark mathematical formulation. Considering the established experimental context, the results suggest that the SA-based approach yields high-quality solutions with lower computational time, highlighting its potential as an effective tool for logistical optimization in the mining industry.