Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ϵ -dominance

The 0/1 knapsack problem is a well known problem occurring in many real world applications. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a ε-dominance relation for direct comparison of two solutions. Several numerical experiments are performed using the best recent algorithms proposed for this problem. Experimental results clearly show that the proposed algorithm outperforms the existing evolutionary approaches for this problem.