A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem.
Geng LinJian GuanZuoyong LiHui-Bin FengPublished in: Expert Syst. Appl. (2019)
Keyphrases
- tabu search
- knapsack problem
- test problems
- multidimensional knapsack problem
- simulated annealing
- metaheuristic
- binary particle swarm optimization
- feasible solution
- optimal solution
- path relinking
- vehicle routing problem
- hybrid algorithm
- search procedure
- candidate list
- dynamic programming
- combinatorial optimization problems
- memetic algorithm
- job shop scheduling problem
- heuristic methods
- scatter search
- special case
- tabu search algorithm
- flowshop
- simulated annealing and tabu search
- maximum profit
- reinforcement learning
- genetic programming
- optimization problems
- objective function