The Modified Hybrid Adaptive genetic algorithm for 0–1 knapsack problem

The paper solves the 0–1 knapsack problem with the modified adaptive genetic transform algorithm which combined with greedy transform algorithm. By means of mixing adaptive crossover and mutation with diversity-guided mutation and modifying adaptive crossover stratagies, an adaptive genetic algorithm with diversity-guided mutation was developed and repaired the infeasible solution with greedy transform algorithm. New algorithm will converge to the global optimum and do not lead to premature convergence. Experimental results show that the new algorithm has faster convergent speed, higher robustness and more reliable stability, and it is very effective for 0–1 knapsack problem.