Dynamic Resource Scheduling Based on Improved Genetic Algorithm

Aiming at the problem of how to realize the reasonable distribution of goods and the resource scheduling of route planning under dynamic conditions, a phased refresh method is proposed to deal with the requirements in sections. At the same time, the clustering method is introduced to generate the initial population. And the cross and mutation rate is determined by a step-by-step reduction method, which is used to solve the problem of the traditional genetic algorithm falling into the local optimum caused by the uneven distribution of searchable solutions. Finally, the effectiveness of the improved method is verified by simulation experiments.