A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem.
Méziane AïderOussama GacemMhand HifiPublished in: Expert Syst. Appl. (2022)
Keyphrases
- knapsack problem
- bi objective
- np hard
- dynamic programming
- optimal solution
- computational complexity
- test problems
- particle swarm optimization
- learning algorithm
- objective function
- bicriteria
- cost function
- combinatorial optimization problems
- implicit enumeration
- greedy heuristic
- efficient solutions
- worst case
- search space
- greedy algorithm
- optimization problems
- simulated annealing
- exact algorithms
- global optimization
- metaheuristic
- solution quality
- linear programming
- shortest path problem
- linear programming relaxation
- multi objective
- evolutionary algorithm
- set covering problem