List-Based Simulated Annealing Algorithm With Hybrid Greedy Repair and Optimization Operator for 0-1 Knapsack Problem.
Shi-hua ZhanZe-Jun ZhangLijin WangYiwen ZhongPublished in: IEEE Access (2018)
Keyphrases
- knapsack problem
- simulated annealing algorithm
- optimization problems
- greedy algorithm
- search algorithm
- simulated annealing
- greedy heuristic
- dynamic programming
- annealing algorithm
- greedy algorithms
- multiple objectives
- combinatorial optimization problems
- evolutionary algorithm
- decision variables
- test problems
- optimal solution
- genetic algorithm
- exact algorithms
- combinatorial optimization
- linear programming relaxation
- multidimensional knapsack problem
- global optimization
- bicriteria
- optimization methods
- optimization method
- continuous relaxation
- tabu search
- mutation operator
- global search
- optimization algorithm
- np hard
- search space
- objective function
- maximum profit
- approximation algorithms
- metaheuristic