A Novel Quantum Swarm Evolutionary Algorithm for Solving 0-1 Knapsack Problem.
Yan WangXiaoyue FengYanxin HuangWengang ZhouYanchun LiangChunguang ZhouPublished in: ICNC (2) (2005)
Keyphrases
- knapsack problem
- evolutionary algorithm
- optimization problems
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- quantum evolutionary algorithm
- evolutionary process
- multi objective
- evolutionary computation
- combinatorial optimization
- linear relaxation
- test problems
- exact algorithms
- particle swarm optimization
- differential evolution
- bicriteria
- optimal solution
- multidimensional knapsack problem
- lp relaxation
- metaheuristic
- linear programming relaxation
- multi objective optimization
- dynamic programming
- simulated annealing
- integer variables
- swarm intelligence
- genetic programming
- greedy heuristic
- np hard
- greedy algorithm
- mutation operator
- fitness function
- genetic algorithm
- continuous relaxation
- function optimization
- linear programming problems
- traveling salesman problem
- nsga ii
- neural network
- particle swarm optimization pso
- exact solution
- crossover operator
- maximum profit
- learning algorithm