A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem.
Isma DahmaniMeriem FerroumMhand HifiShohre SadeghsaPublished in: CoDIT (2020)
Keyphrases
- knapsack problem
- swarm optimization
- optimal solution
- dynamic programming
- cost function
- np hard
- bicriteria
- optimization algorithm
- test problems
- learning algorithm
- artificial intelligence
- objective function
- computational complexity
- search space
- convergence rate
- multidimensional knapsack problem
- greedy heuristic
- simulated annealing
- continuous relaxation
- hybrid algorithm
- particle swarm optimization
- optimization problems
- neural network
- special case
- genetic algorithm
- machine learning