%0 Journal Article %A ZHONG Peihua %A WU Zhiyuan %A MIAO Jianqun %T Partition particle swarm optimization algorithm for multi-dimensional knapsack problem %D 2011 %R %J Computer Engineering and Applications %P 73-75 %V 47 %N 36 %X In order to overcome the premature convergence of discrete particle swarm optimi-zation(BPSO),a novel partition particle swarm optimization algorithm is proposed.With the partition method combined and some helpless points removed,the searching field of optimal solution is narrowed,and the probability of finding optimal solution enhances.To overcome the slow convergence of BPSO,the greedy method is used for a remedy to infeasible solutions and feasible solutions.Simulation results on benchmark problems show that the proposed algorithm is effective and has faster convergence speed and stronger global optimization ability.
%U http://cea.ceaj.org/EN/abstract/article_27438.shtml