A Modified Binary Particle Swarm Optimization for Knapsack Problems.
Jagdish Chand BansalKusum DeepPublished in: Appl. Math. Comput. (2012)
Keyphrases
- knapsack problem
- binary particle swarm optimization
- combinatorial optimization problems
- optimization problems
- optimal solution
- dynamic programming
- global optimization
- binary gravitational search algorithm
- routing problem
- test problems
- fitness function
- exact algorithms
- particle swarm
- greedy algorithm
- particle swarm optimization
- vehicle routing problem
- linear programming relaxation
- np hard
- higher recognition rate
- particle swarm optimization algorithm
- evolutionary algorithm
- implicit enumeration
- search space
- maximum profit
- genetic algorithm
- nsga ii
- integer programming
- optimization methods
- combinatorial optimization
- linear program
- evolutionary computation