An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem

Yang Yang

As an important part of genetic algorithms (GAs), mutation operators is widely used in evolutionary algorithms to solve $\mathcal{NP}$-hard problems because it can increase the pop…