Aiming at the scheduling problem of underground mining equipment in shot mining, this paper proposes an improved cultural gene algorithm (MA). The global search applies the genetic algorithm, and some adjustments are made in its crossover and mutation operations; the local search uses the simulated annealing algorithm. The global search applies the genetic algorithm, and some adjustments are made in its crossover and mutation operations; the local search uses the simulated annealing algorithm, considering that the algorithm will have a certain probability to jump out of the optimal solution range, so on the basis of the original algorithm, the Gaussian function is replaced by the Cauchy function to avoid this problem. The algorithm is applied to the scenario of 5S15J for simulation experiments. After that, compared with the results of the genetic algorithm, it shows that the improved MA algorithm is obviously better in total time and total interval time, and can obtain high-quality solutions and an ideal cooperative scheduling strategy.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: