On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem.
Vahid RoostapourAneta NeumannFrank NeumannPublished in: PPSN (1) (2018)
Keyphrases
- knapsack problem
- evolutionary algorithm
- optimization problems
- combinatorial optimization problems
- multi objective
- dynamic programming
- exact algorithms
- optimal solution
- np hard
- differential evolution
- multi objective optimization
- evolutionary computation
- test problems
- simulated annealing
- metaheuristic
- bicriteria
- multidimensional knapsack problem
- genetic programming
- heuristic solution
- nsga ii
- genetic algorithm
- maximum profit
- greedy algorithm
- mutation operator
- differential evolution algorithm
- evolutionary strategy
- np hard problems
- neural network
- crossover operator
- combinatorial optimization
- fitness function
- greedy heuristic
- ant colony optimization
- optimization algorithm
- special case