Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup.
Samah BoukhariIsma DahmaniMhand HifiPublished in: SAI (1) (2021)
Keyphrases
- hybrid algorithm
- knapsack problem
- computational power
- optimal solution
- particle swarm optimization
- implicit enumeration
- combinatorial optimization problems
- hybrid algorithms
- computing power
- parallel processing
- randomly generated test instances
- simulated annealing
- optimization problems
- tabu search
- dynamic programming
- lp relaxation
- test problems
- exact algorithms
- artificial bee colony algorithm
- multidimensional knapsack problem
- ant colony optimization
- genetic algorithm
- imperialist competitive algorithm
- standard test problems
- combinatorial optimization
- differential evolution
- hybrid optimization algorithm
- greedy algorithm
- particle swarm optimization pso
- objective function
- integer variables
- clustering algorithm
- lower bound
- metaheuristic