A Hybrid BPSO-GA Algorithm for 0-1 Knapsack Problems.
Jinshui WangJianhua LiuJeng-Shyang PanXingsi XueLili HuangPublished in: ECC (2017)
Keyphrases
- knapsack problem
- dynamic programming
- np hard
- learning algorithm
- particle swarm optimization
- optimal solution
- computational complexity
- bicriteria
- ant colony optimization
- search space
- hybrid algorithm
- implicit enumeration
- simulated annealing
- combinatorial optimization problems
- combinatorial optimization
- fitness function
- solution quality
- benchmark problems
- neural network
- optimization problems
- search algorithm
- cost function