Modeling and Performance Analysis of Knapsack Problem Solving
In order to improve the performance of knapsack problem and solve local search ability and convergence speed slow defects in standard particle swarm optimization algorithm,article velocity weighting value adaptive adjustment strategy is introduced to solve modeling of knapsack problem,the performance of the improved particle swarm optimization (IPSO)algorithm is tested by using two specific knapsack problems,compared with the other algorithms,IPSO algorithm has better convergence speed and searching,not only can obtain higher accuracy,but also improve the stability for knapsack problem,advan-tage is very obvious for large knapsack problem.
NETL
NSTL
万方数据
维普
