“…To get the optimal crossover probability and mutation probability of GGA, a data set was generated with the following random method, the size of which was: n = 30, l = 15, m = 30. The number of skills possessed by r i (r i ∈ R) was random (1,5), with the skill possessed by r i (r i ∈ R) being random (1, l). T SN k = random(1, 4), 1 ≤ k ≤ m, and which skill was needed by t k (t k ∈ T ) was random (1, l).…”