Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm.
Guo ZhouRuixin ZhaoYongquan ZhouPublished in: Int. J. Comput. Sci. Math. (2018)
Keyphrases
- knapsack problem
- optimisation algorithm
- randomly generated test instances
- implicit enumeration
- optimisation problems
- ant colony
- combinatorial optimization problems
- optimal solution
- optimization problems
- lp relaxation
- greedy algorithm
- np hard
- multidimensional knapsack problem
- test problems
- exact algorithms
- dynamic programming
- integer variables
- linear programming relaxation
- continuous relaxation
- genetic algorithm
- maximum profit
- evolutionary algorithm
- global optimization
- combinatorial optimization
- computational intelligence
- ant colony algorithm
- benchmark problems
- genetic programming
- evolutionary computation