Solving 0-1 Knapsack Problems by Binary Dragonfly Algorithm.
Mohamed Abdel-BassetQifang LuoFahui MiaoYongquan ZhouPublished in: ICIC (3) (2017)
Keyphrases
- knapsack problem
- test problems
- detection algorithm
- dynamic programming
- computational complexity
- optimization algorithm
- implicit enumeration
- combinatorial optimization problems
- np hard
- search space
- simulated annealing
- exact algorithms
- learning algorithm
- optimal solution
- computational efficiency
- combinatorial optimization
- objective function
- branch and bound algorithm
- genetic algorithm
- cost function
- non binary
- hamming distance
- reinforcement learning
- benchmark problems
- greedy algorithm
- mathematical model
- ant colony optimization
- expectation maximization
- particle swarm optimization
- linear programming
- optimization problems
- k means