Solving 0-1 knapsack problem by a novel global harmony search algorithm.
Dexuan ZouLiqun GaoSteven LiJianhua WuPublished in: Appl. Soft Comput. (2011)
Keyphrases
- knapsack problem
- harmony search algorithm
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- optimal solution
- numerical optimization
- test problems
- optimization problems
- dynamic programming
- harmony search
- exact algorithms
- greedy algorithm
- np hard
- combinatorial optimization
- metaheuristic
- integer variables
- neural network
- particle swarm optimization
- initial solution
- special case
- simulated annealing
- computational intelligence
- cost function
- reinforcement learning