International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 79 - Issue 6 |
Published: October 2013 |
Authors: Mostafa Nemati, Hossein Momeni, Navid Bazrkar |
![]() |
Mostafa Nemati, Hossein Momeni, Navid Bazrkar . Binary Black Holes Algorithm. International Journal of Computer Applications. 79, 6 (October 2013), 36-42. DOI=10.5120/13748-1561
@article{ 10.5120/13748-1561, author = { Mostafa Nemati,Hossein Momeni,Navid Bazrkar }, title = { Binary Black Holes Algorithm }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 79 }, number = { 6 }, pages = { 36-42 }, doi = { 10.5120/13748-1561 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A Mostafa Nemati %A Hossein Momeni %A Navid Bazrkar %T Binary Black Holes Algorithm%T %J International Journal of Computer Applications %V 79 %N 6 %P 36-42 %R 10.5120/13748-1561 %I Foundation of Computer Science (FCS), NY, USA
In this paper we adapt black holes optimization algorithms for binary search spaces by applying a sigmoid transformation to the gravity and electrical forces. Black holes algorithm is a Swarm Algorithm inspired of Black Holes for Optimization Problems. We supposes each solution of problem as a binary black hole and after calculating the gravity and electrical forces use a mapping function for set it. The proposed method is verified using several benchmark problems used in the area of optimization. The experimental results on different benchmarks show that the performance of the proposed algorithm is better than BPSO (Binary Particle Swarms Optimization), BAFS (Binary Artificial Fish Swarm Algorithm) and GA (Genetic Algorithm).