Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy.
Tung Khac TruongKenli LiYuming XuAijia OuyangTien Trong NguyenPublished in: J. Intell. Fuzzy Syst. (2015)
Keyphrases
- optimization algorithm
- knapsack problem
- greedy strategy
- chemical reaction
- greedy algorithm
- randomly generated test instances
- implicit enumeration
- multi objective
- combinatorial optimization problems
- dynamic programming
- optimization method
- exact algorithms
- differential evolution
- optimization strategy
- test problems
- evolutionary multi objective
- optimal solution
- particle swarm optimization pso
- maximum profit
- linear programming relaxation
- optimization problems
- lp relaxation
- multidimensional knapsack problem
- chemical reactions
- multiple objectives
- worst case
- objective function
- nsga ii
- integer variables
- combinatorial optimization
- global optima
- hybrid optimization algorithm
- np hard
- learning algorithm
- control parameters
- genetic algorithm
- artificial bee colony
- multi objective optimization
- computational intelligence
- continuous relaxation