Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.
Jakob BossekAneta NeumannFrank NeumannPublished in: CoRR (2021)
Keyphrases
- knapsack problem
- evolutionary algorithm
- optimization problems
- multi objective
- combinatorial optimization problems
- evolutionary computation
- test problems
- differential evolution
- multi objective optimization
- exact algorithms
- dynamic programming
- simulated annealing
- genetic algorithm
- linear programming relaxation
- evolutionary process
- metaheuristic
- optimal solution
- fitness function
- np hard
- continuous relaxation
- greedy heuristic
- nsga ii
- multiple objectives
- genetic programming
- mutation operator
- multidimensional knapsack problem
- differential evolution algorithm
- heuristic solution
- maximum profit
- neural network
- higher dimensional
- implicit enumeration
- particle swarm optimization
- solution quality