Abstract
A Knapsack Problem is a typical NP complete problem. For solving Knapsack problem, A new improved Particle Swarm Optimization algorithm was proposed in this paper, the new algorithm combine Dantzigs theory of Knapsack Problem and crossover and mutation operation of Genetic Algorithm. According their fitness values, individuals are improved firstly by crossover, Daviss sequence crossover method and reverse mutation method are used respectively in the course of crossover and mutation. Numerical examples illustrate the validity and efficiency of the new hybrid Particle Swarm Optimization.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
