Skip to main content
Erschienen in: Natural Computing 3/2010

01.09.2010

BGSA: binary gravitational search algorithm

verfasst von: Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi

Erschienen in: Natural Computing | Ausgabe 3/2010

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Gravitational search algorithm is one of the new optimization algorithms that is based on the law of gravity and mass interactions. In this algorithm, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws of gravity and motion. In this article, a binary version of the algorithm is introduced. To evaluate the performances of the proposed algorithm, several experiments are performed. The experimental results confirm the efficiency of the BGSA in solving various nonlinear benchmark functions.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Avishek P, Maiti J (2010) Development of a hybrid methodology for dimensionality reduction in Mahalanobis–Taguchi system using Mahalanobis distance and binary particle swarm optimization. Expert Syst Appl 37(2):1286–1293CrossRef Avishek P, Maiti J (2010) Development of a hybrid methodology for dimensionality reduction in Mahalanobis–Taguchi system using Mahalanobis distance and binary particle swarm optimization. Expert Syst Appl 37(2):1286–1293CrossRef
Zurück zum Zitat Beretaa M, Burczynski T (2007) Comparing binary and real-valued coding in hybrid immune algorithm for feature selection and classification of ECG signals. Eng Appl Artif Intell 20:571–585CrossRef Beretaa M, Burczynski T (2007) Comparing binary and real-valued coding in hybrid immune algorithm for feature selection and classification of ECG signals. Eng Appl Artif Intell 20:571–585CrossRef
Zurück zum Zitat Cheng YM, Li L et al (2007) Performance studies on six heuristic global optimization methods in the location of critical slip surface. Comput Geotech 34(6):462–484CrossRef Cheng YM, Li L et al (2007) Performance studies on six heuristic global optimization methods in the location of critical slip surface. Comput Geotech 34(6):462–484CrossRef
Zurück zum Zitat Chuang LH, Chang HW et al (2008) Improved binary PSO for feature selection using gene expression data. Comput Biol Chem 32(1):29–38MATHCrossRef Chuang LH, Chang HW et al (2008) Improved binary PSO for feature selection using gene expression data. Comput Biol Chem 32(1):29–38MATHCrossRef
Zurück zum Zitat Digalakis JG, Margaritis KG (2002) An experimental study of benchmarking functions for genetic algorithms. Int J Comput Math 79(4):403–416MATHCrossRefMathSciNet Digalakis JG, Margaritis KG (2002) An experimental study of benchmarking functions for genetic algorithms. Int J Comput Math 79(4):403–416MATHCrossRefMathSciNet
Zurück zum Zitat Dorigo M, Maniezzo V et al (1996) The Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26(1):29–41CrossRef Dorigo M, Maniezzo V et al (1996) The Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26(1):29–41CrossRef
Zurück zum Zitat Elbetagi E, Hegazy T et al (2005) Comparison among five evolutionary-based optimization algorithms. Adv Eng Inf 19:43–53CrossRef Elbetagi E, Hegazy T et al (2005) Comparison among five evolutionary-based optimization algorithms. Adv Eng Inf 19:43–53CrossRef
Zurück zum Zitat Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, Chichester, UK Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, Chichester, UK
Zurück zum Zitat Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MAMATH Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MAMATH
Zurück zum Zitat Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, Michigan Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, Michigan
Zurück zum Zitat Holliday D, Resnick R et al (1993) Fundamentals of physics. Wiley, New York Holliday D, Resnick R et al (1993) Fundamentals of physics. Wiley, New York
Zurück zum Zitat Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol 4, pp 1942–1948 Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol 4, pp 1942–1948
Zurück zum Zitat Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on computational cybernetics and simulation, vol 5, pp 4104–4108 Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on computational cybernetics and simulation, vol 5, pp 4104–4108
Zurück zum Zitat Rashedi E, Nezamabadi-pour H et al (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef Rashedi E, Nezamabadi-pour H et al (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef
Zurück zum Zitat Schutz B (2003) Gravity from the ground up. Cambridge University Press, Cambridge Schutz B (2003) Gravity from the ground up. Cambridge University Press, Cambridge
Zurück zum Zitat Srinivasa KG, Venugopal KR et al (2007) A self-adaptive migration model genetic algorithm for data mining applications. Inf Sci 177(20):4295–4313MATHCrossRef Srinivasa KG, Venugopal KR et al (2007) A self-adaptive migration model genetic algorithm for data mining applications. Inf Sci 177(20):4295–4313MATHCrossRef
Zurück zum Zitat Wang X, Yang J et al (2007) Feature selection based on rough sets and particle swarm optimization. Pattern Recogn Lett 28:459–471CrossRef Wang X, Yang J et al (2007) Feature selection based on rough sets and particle swarm optimization. Pattern Recogn Lett 28:459–471CrossRef
Zurück zum Zitat Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef
Zurück zum Zitat Wu TH, Chang CC et al (2008) A simulated annealing algorithm for manufacturing cell formation problems. Expert Syst Appl 34(3):1609–1617CrossRefMathSciNet Wu TH, Chang CC et al (2008) A simulated annealing algorithm for manufacturing cell formation problems. Expert Syst Appl 34(3):1609–1617CrossRefMathSciNet
Zurück zum Zitat Yao X, Liu Y et al (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–102CrossRef Yao X, Liu Y et al (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–102CrossRef
Zurück zum Zitat Youssef H, Sait SM et al (2001) Evolutionary algorithms, simulated annealing and tabu search: a comparative study. Eng Appl Artif Intell 14:167–181CrossRef Youssef H, Sait SM et al (2001) Evolutionary algorithms, simulated annealing and tabu search: a comparative study. Eng Appl Artif Intell 14:167–181CrossRef
Zurück zum Zitat Yuan X, Nie et al (2009) An improved binary particle swarm optimization for unit commitment problem. Expert Syst Appl 36(4):8049–8055CrossRef Yuan X, Nie et al (2009) An improved binary particle swarm optimization for unit commitment problem. Expert Syst Appl 36(4):8049–8055CrossRef
Zurück zum Zitat Zeng XP, Li YM et al (2009) A dynamic chain-like agent genetic algorithm for global numerical optimization and feature selection. Neurocomputing 72:214–1228CrossRef Zeng XP, Li YM et al (2009) A dynamic chain-like agent genetic algorithm for global numerical optimization and feature selection. Neurocomputing 72:214–1228CrossRef
Metadaten
Titel
BGSA: binary gravitational search algorithm
verfasst von
Esmat Rashedi
Hossein Nezamabadi-pour
Saeid Saryazdi
Publikationsdatum
01.09.2010
Verlag
Springer Netherlands
Erschienen in
Natural Computing / Ausgabe 3/2010
Print ISSN: 1567-7818
Elektronische ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-009-9175-3

Weitere Artikel der Ausgabe 3/2010

Natural Computing 3/2010 Zur Ausgabe

Premium Partner