Strength Pareto Evolutionary Algorithm Based on New Fitness Strategy for Multi Objective Knapsack Problem

problems. Many different experiments have shown that the evolutionary algorithm Strength Pareto Evolutionary Algorithm 2 (SPEA2) outperforms other approaches, and this makes it an excellent candidate for inclusion in the final design. According to Strength, one of SPEA2's core concepts, the population is sorted into niches based on the Pareto Front idea. With regard to outcomes this technique has a flaw that is mitigated by adding a fitness density estimator. Weakness in Strength is addressed with an approach called Strength by objective, which aims to include solution who do not dominate or are dominated by others inside the process. In this paper, the results will show a clear superiority of the proposed method comparing with the original method in solving the multi-objective Knapsack problem using three sizes of the Knapsack and the problem size of 750 items which is generated randomly. The comparison results between the proposed method and the other algorithms show outperformance of the Proposed algorithm using the dominance inductor showed the superiority of the proposed algorithm by a percentage of more than 1 %, Thanks to a highly diverse population and the inclusion of solutions that can be improved, the (SPEA2) algorithm's performance has been vastly enhanced by the Objective sorting mechanism