DocumentCode :
2787377
Title :
An improved particle swarm optimization algorithm for solving 0–1 Knapsack problem
Author :
Zhang, Guo-li ; Wei, Yi
Author_Institution :
Dept. of Math. & Phys., North China Electr. Power Univ., Baoding
Volume :
2
fYear :
2008
fDate :
12-15 July 2008
Firstpage :
915
Lastpage :
918
Abstract :
According to the correlation and dependence among items in 0-1 knapsack problem, this paper proposes an mproved PSO based on probability model to solve the problem. The algorithm proposes a new updating equation and operates on the probability vector according to the statistic probability to perform the evolution. The example shows that this algorithm has a faster convergence rate and a higher rate of success to solve the 0-1 knapsack problem.
Keywords :
knapsack problems; particle swarm optimisation; statistical analysis; 0-1 knapsack problem; particle swarm optimization algorithm; probability vector; statistic probability; Ant colony optimization; Birds; Cybernetics; Equations; Genetic algorithms; Machine learning; Machine learning algorithms; Mathematical model; Particle swarm optimization; Probability; Knapsack problem; PSO; Probability statistic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2008 International Conference on
Conference_Location :
Kunming
Print_ISBN :
978-1-4244-2095-7
Electronic_ISBN :
978-1-4244-2096-4
Type :
conf
DOI :
10.1109/ICMLC.2008.4620535
Filename :
4620535
Link To Document :
بازگشت