The multiobjective 0/1 knapsack problem is a generalization of the well known 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. This algorithm try to improve another algorithm which also uses an ε-domination relation between solutions. In this new algorithm the value of ε is adaptive (can be changed) depending on the solutions quality improvement. 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. © 2006 Springer.
CITATION STYLE
Groşan, C. (2006). Multiobjective 0/1 knapsack problem using adaptive ε-dominance. Advances in Soft Computing, 34, 547–556. https://doi.org/10.1007/3-540-31662-0_42
Mendeley helps you to discover research relevant for your work.