A Hybrid Algorithm Based on Tabu Search and Chemical Reaction Optimization for 0-1 Knapsack Problem.
Chaokun YanSiqi GaoHuimin LuoZhigang HuPublished in: ICSI (2) (2015)
Keyphrases
- tabu search
- hybrid algorithm
- knapsack problem
- optimization problems
- metaheuristic
- chemical reaction
- multidimensional knapsack problem
- hybrid optimization algorithm
- combinatorial optimization problems
- simulated annealing
- test problems
- optimal solution
- evolutionary algorithm
- ant colony optimization
- memetic algorithm
- combinatorial optimization
- scheduling problem
- feasible solution
- path relinking
- genetic algorithm
- heuristic methods
- search procedure
- objective function
- search algorithm
- optimization method
- np hard
- exact algorithms
- initial solution
- benchmark instances
- vehicle routing problem
- job shop scheduling problem
- hybrid method
- solution space
- combinatorial problems
- initial population
- tabu list
- dynamic programming
- tabu search algorithm
- benchmark problems
- max sat
- optimization algorithm
- linear program
- lower bound
- flowshop
- solution quality
- candidate list
- genetic programming
- cost function
- particle swarm optimization
- genetic algorithm ga
- evolutionary computation
- greedy algorithm
- differential evolution
- global optimization
- traveling salesman problem