BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis.
Mohamed Abdel-BassetReda MohamedKaram M. SallamRipon K. ChakraborttyMichael J. RyanPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- metaheuristic
- knapsack problem
- combinatorial optimization
- optimization method
- dynamic programming
- harmony search
- simulated annealing
- cost function
- combinatorial optimization problems
- multi dimensional
- optimization algorithm
- objective function
- comprehensive analysis
- ant colony optimization
- optimization problems
- optimal solution
- computational complexity
- implicit enumeration
- computational efficiency
- search space
- particle swarm optimization
- metaheuristic algorithms
- test problems
- genetic algorithm
- mathematical model
- hybrid metaheuristic
- learning algorithm
- scatter search
- exact algorithms
- heuristic methods
- hill climbing
- vehicle routing problem
- tabu search
- linear programming
- worst case
- aco algorithm
- solution quality
- benchmark problems
- routing problem
- evolutionary algorithm
- greedy randomized adaptive search procedure