A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem.
Mert SahinkoçÜmit BilgePublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- knapsack problem
- evolutionary algorithm
- optimization problems
- reference set
- combinatorial optimization problems
- multi objective
- test problems
- differential evolution
- multidimensional knapsack problem
- dynamic programming
- optimal solution
- simulated annealing
- background knowledge
- exact algorithms
- metaheuristic
- semi automatically
- np hard
- multi objective optimization
- nsga ii
- fitness function
- genetic programming
- mutation operator
- implicit enumeration
- traveling salesman problem
- genetic algorithm
- combinatorial optimization
- scheduling problem
- search engine
- learning algorithm
- neural network