Skip to main content
Top
Published in: Artificial Life and Robotics 1/2016

01-03-2016 | Original Article

Set-based particle swarm optimization with status memory for knapsack problem

Authors: Takahiro Hino, Sota Ito, Tao Liu, Michiharu Maeda

Published in: Artificial Life and Robotics | Issue 1/2016

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, pp 1942–1948 Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, pp 1942–1948
2.
go back to reference 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–1489CrossRef 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–1489CrossRef
3.
go back to reference 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–1239CrossRef 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–1239CrossRef
4.
go back to reference 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 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
5.
go back to reference 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 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
6.
go back to reference 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–299CrossRef 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–299CrossRef
7.
go back to reference Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New YorkMATH Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New YorkMATH
8.
go back to reference Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Longman Publishing Co., Inc Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Longman Publishing Co., Inc
9.
go back to reference Olsen AL (1994) Penalty function and the knapsack problem. In: Proceedings of the 1st IEEE international conference on evolutionary computation, pp 559–564 Olsen AL (1994) Penalty function and the knapsack problem. In: Proceedings of the 1st IEEE international conference on evolutionary computation, pp 559–564
10.
go back to reference 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–295CrossRef 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–295CrossRef
Metadata
Title
Set-based particle swarm optimization with status memory for knapsack problem
Authors
Takahiro Hino
Sota Ito
Tao Liu
Michiharu Maeda
Publication date
01-03-2016
Publisher
Springer Japan
Published in
Artificial Life and Robotics / Issue 1/2016
Print ISSN: 1433-5298
Electronic ISSN: 1614-7456
DOI
https://doi.org/10.1007/s10015-015-0253-6

Other articles of this Issue 1/2016

Artificial Life and Robotics 1/2016 Go to the issue