Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Multiobjective 0/1 Knapsack Problem using Adaptive ε-Dominance
verfasst von : Crina Groşan
Erschienen in: Applied Soft Computing Technologies: The Challenge of Complexity
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.