Abstract
Knapsack problem, a typical problem of combinatorial optimization in operational research, has broad applied foregrounds. This paper applies particle swarm optimization to solve discrete 0/1 knapsack problem. However, traditional particle swarm optimization has nonnegligible disadvantages: all the parameters in the formula affect the abilities of local searching and global searching greatly, which is liable to converge too early and fall into the situation of local optimum. This paper modifies traditional particle swarm optimization, and makes the position of particle which achieves global optimization reinitializated. Through analyzing the final result, the paper has proven that the improved algorithm could improve searching ability of particle swarm, avoid converging too early and solve 0/1 knapsack problem more effectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Li, J., Fang, P., Zhou, M.: A Hybrid Genetic Algorithm about Solving Knapsack Problem. Journal of Nanchang Institute of Aeronautical Technology 12(3), 31–35 (1998)
Shen, X.J., Wang, W.W., Zheng, B.J., Li, Y.X.: Based on Improved Optimizing Particle Swarm Optimization to Solve 0-l Knapsack Problem. Computer Engineering 32(18), 23–24 (2006)
Liu, Q.D., Wang, L.: Research and Application on the Intelligent Particle Swarm Optimization 5 (2005)
Zeng, J.C., Jie, J., Cui, Z.H.: Particle Swarm Optimization. Science and Technology Press (2004)
Wang, X.D.: Computer Algorithm Design and Analysis. Electronic Industry Press (2001)
Yang, W., Li, Q.Q.: Survey on Particle Swarm Optimization Algorithm. Engineering Science 5 (2004)
Hembecker, F., Lopes, H.S.: Particle Swarm Optimization for the Multidimensional Knapsack Problem. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol. 4431, pp. 358–365. Springer, Heidelberg (2007)
Ma, H.M., Ye, C.M., Zhang, S.: Binary improved particle swarm optimization algorithm for knapsack problem. Journal of University of Shanghai for Science and Technology 1 (2006)
Zhao, C.X., Ji, Y.M.: Particle Swarm Optimization for 0/1 Knapsack Problem. Microcomputer Development 15(10) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liang, Y., Liu, L., Wang, D., Wu, R. (2010). Optimizing Particle Swarm Optimization to Solve Knapsack Problem. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16336-4_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-16336-4_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16335-7
Online ISBN: 978-3-642-16336-4
eBook Packages: Computer ScienceComputer Science (R0)