A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem.
Asaju La'aro BolajiFriday Zinzendoff OkwonuPeter Bamidele SholaBabatunde Sulaiman BalogunObinna Damian AdubisiPublished in: J. Intell. Syst. (2021)
Keyphrases
- knapsack problem
- multi dimensional
- dynamic programming
- optimal solution
- np hard
- exact algorithms
- implicit enumeration
- gradient projection
- greedy heuristic
- combinatorial optimization problems
- learning algorithm
- bicriteria
- search space
- computational complexity
- objective function
- cost function
- multidimensional knapsack problem
- combinatorial optimization
- lagrangian relaxation
- randomly generated test instances
- np hard problems
- lp relaxation
- test problems
- greedy algorithm
- metaheuristic
- optimization algorithm
- simulated annealing
- special case