Abstract
Set-based particle swarm optimization (S-PSO) operates on discrete space. S-PSO can solve combinatorial optimization problem with high quality and is successful to apply to the large-scale problem. In S-PSO, a velocity is a set with possibility and a position is a candidate solution. In this paper, we present a novel algorithm of set-based particle swarm optimization with status memory (S-PSOSM) to decide the position based on the previous position for solving knapsack problem. Some operators are redefined for S-PSOSM. S-PSOSM is a simple algorithm because the state of probability reduces. In addition, the weight of S-PSOSM is discussed. S-PSOSM shows high qualities in experimental results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, pp 1942–1948
Chatterjee A, Pulasinghe K, Watanabe K et al (2005) A particle-swarm-optimized fuzzy-neural network for voice-controlled robot systems. IEEE Trans Ind Electron 52(6):1478–1489
Yoshida H, Kawata K, Fukuyama Y et al (2000) A particle swarm optimization for reactive power and voltage control considering voltage security assessment. IEEE Trans Power Syst 15(4):1232–1239
Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE international conference on systems man and cybernetics, pp 4104–4109
Ji Z, Tian T, He S (2012) A Memory binary particle swarm optimization. In: Proceedings of the IEEE international conference on evolutionary computation, pp 1–5
Chen WN, Zhang J, Chung HSH (2010) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14(2):278–299
Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Longman Publishing Co., Inc
Olsen AL (1994) Penalty function and the knapsack problem. In: Proceedings of the 1st IEEE international conference on evolutionary computation, pp 559–564
Liang JJ, Qin AK, Suganthan PN et al (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281–295
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Hino, T., Ito, S., Liu, T. et al. Set-based particle swarm optimization with status memory for knapsack problem. Artif Life Robotics 21, 98–105 (2016). https://doi.org/10.1007/s10015-015-0253-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-015-0253-6