Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms.
Jakob BossekAneta NeumannFrank NeumannPublished in: GECCO (2021)
Keyphrases
- knapsack problem
- evolutionary algorithm
- optimization problems
- combinatorial optimization problems
- multi objective
- test problems
- optimal solution
- dynamic programming
- evolutionary computation
- exact algorithms
- evolutionary process
- np hard
- multi objective optimization
- differential evolution
- metaheuristic
- linear programming relaxation
- greedy algorithm
- bicriteria
- fitness function
- multidimensional knapsack problem
- combinatorial optimization
- np hard problems
- nsga ii
- multiple objectives
- heuristic solution
- genetic programming
- differential evolution algorithm
- simulated annealing
- continuous relaxation
- machine learning
- greedy heuristic
- bi objective
- crossover operator
- evolution strategy
- genetic algorithm
- neural network
- maximum profit
- randomly generated test instances