A multi-population algorithm for multi-objective knapsack problem.
Imen Ben MansourMatthieu BasseurFrédéric SaubionPublished in: Appl. Soft Comput. (2018)
Keyphrases
- knapsack problem
- multi objective
- np hard
- multi population
- optimization algorithm
- dynamic programming
- optimal solution
- test problems
- np hard problems
- cost function
- genetic algorithm
- bicriteria
- simulated annealing
- optimization problems
- neural network
- learning algorithm
- greedy heuristic
- search space
- special case
- approximation algorithms
- multi objective optimization
- computational complexity
- evolutionary algorithm