An empirical study of population-based metaheuristics for the multiple-choice multidimensional knapsack problem.
Francis J. VaskoYun LuKenneth ZymaPublished in: Int. J. Metaheuristics (2016)
Keyphrases
- multidimensional knapsack problem
- multiple choice
- particle swarm optimization
- combinatorial optimization
- simulated annealing
- tabu search
- open ended
- metaheuristic
- genetic algorithm
- optimization problems
- differential evolution
- knapsack problem
- genetic algorithm ga
- neural network
- evolutionary algorithm
- traveling salesman problem