To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack Problem, which makes it difficult to obtain the optimal solution scheme, in this paper, we present a greedy induced mutation method for locally optimal solutions, namely, an improved Shuffled Frog Leaping Algorithm (Shuffled Frog Leaping Algorithm based on Greedy Algorithm and Mutation, SFLA-GA-M). First, the proposed algorithm adjusts the population generation o...
