The application of the improved Ant Colony Algorithm in mine locomotive scheduling problem

摘要

Ant Colony Algorithm has some advantages in solving complex optimization problems, in particular discrete optimization problem. A mine locomotive scheduling algorithm based on the improved Ant Colony Algorithm for the mine locomotive scheduling problem has proposed in this paper. The method takes simulated annealing algorithm as a local search strategy of ant colony algorithm, aim at expanding the solution search space, avoiding falling into local optimum that improve convergence rate of the algorithm by dynamic pheromone evaporation factor. Simulation results show that the algorithm is more efficiency in locomotive scheduling than the basic ant colony algorithm.