An improved monkey algorithm for a 0-1 knapsack problem.
Yongquan ZhouXin ChenGuo ZhouPublished in: Appl. Soft Comput. (2016)
Keyphrases
- knapsack problem
- dynamic programming
- np hard
- optimal solution
- learning algorithm
- simulated annealing
- optimization algorithm
- objective function
- multidimensional knapsack problem
- greedy heuristic
- test problems
- convex hull
- computational complexity
- linear program
- ant colony optimization
- metaheuristic
- solution quality
- particle swarm optimization
- combinatorial optimization problems
- exact algorithms
- search space
- bicriteria
- np hard problems