Optimal Routes Analysis of Vehicles for Auxiliary Operations in Open-pit Mines using a Heuristic Algorithm for the Traveling Salesman Problem

摘要: Abstract This study analyzed the optimal routes of auxiliary vehicles in an open-pit mine that need to traverse entire through many working points. Unlike previous studies which usually used Dijkstra‘s algorithm, this utilized a heuristic algorithm for Traveling Salesman Problem(TSP). Thus, could be determined by considering visiting order multiple A case at Pasir coal mine, Indonesia was conducted analyze travel route vehicle monitors condition traversing without stopping. As result, we know TSP is more efficient than intuitive judgment determining route; 20 minutes can shortened when traverses 25 points according algorithm. It expected results as basis set direction future research system optimization mines.