Solving A Multi-Dimensional Knapsack Problem Using A Hybrid Particle Swarm Optimization Algorithm.
Nam Fai WanLars NollePublished in: ECMS (2009)
Keyphrases
- particle swarm optimization algorithm
- knapsack problem
- multi dimensional
- randomly generated test instances
- implicit enumeration
- integer programming problems
- particle swarm optimization
- combinatorial optimization problems
- convergence speed
- optimization problems
- optimal solution
- test problems
- dynamic programming
- particle swarm
- global search
- lp relaxation
- multidimensional knapsack problem
- pso algorithm
- cutting plane
- greedy algorithm
- np hard
- exact algorithms
- linear programming relaxation
- integer variables
- multilevel thresholding
- combinatorial optimization
- inertia weight
- neural network
- evolution strategy
- exact solution
- objective function
- vehicle routing problem
- evolutionary algorithm
- worst case
- multi objective
- special case