Research on Coal Mine Inspection Path Planning Considering Time Window Constraints

The article studies the service path planning problem of overhaul workers in coal mining industry. Firstly, combined with the characteristics of coal mining industry, the problem studied in the article can be attributed to the traveler problem, and the multi-objective constraint model with time window is constructed by describing and making corresponding assumptions from the traveler problem, with the goal of optimal path and shortest time. Secondly, in order to solve the problem, the ant colony algorithm, which is more flexible, is selected, and the parameters are adjusted appropriately to make it closer to the actual situation. Finally, the ACO algorithm is designed for example validation using the actual mine data as the experimental data. The results show that the proposed ACO algorithm can greatly shorten the delivery distance, reduce the number of maintenance workers, lower the company's cost and provide a better customer experience while meeting the time window requirements.