Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem

DOI10.1016/j.tcs.2006.03.007zbMath1097.68155MaRDI QIDQ2503277

Rajeev Kumar, Nilanjan Banerjee

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.007

zbMATH Keywords

combinatorial optimization; evolutionary algorithm; Pareto front; multiobjective problem; Knapsack; approximate set; LOTZ; restricted EMO; simple EMO

Mathematics Subject Classification ID

68W40: Analysis of algorithms

90C29: Multi-objective and goal programming

68T05: Learning and adaptive systems in artificial intelligence

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Hybridizing evolutionary algorithms with variable-depth search to overcome local optima, The impact of parametrization in memetic evolutionary algorithms, Labeling algorithms for multiple objective integer knapsack problems, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

Uses Software

• SPEA2

Cites Work

• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• Multicriteria optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• How to analyse evolutionary algorithms.
• Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
• Approximating Multiobjective Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Evolutionary Multi-Criterion Optimization
• Theory of genetic algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item