Using Black Holes Algorithm in Discrete Space by Nearest Integer Function

Mostafa Nemati, Navid Bazrkar, Reza Salimi, Behdad Moshref

Abstract


In this paper we Using Black Holes Algorithm in Discrete Space by Nearest Integer Function. Black holes algorithm is a Swarm Algorithm inspired of Black Holes for Optimization Problems. We suppose each solution of problem as an integer black hole and after calculating the gravity and electrical forces use Nearest Integer Function. The experimental results on different benchmarks show that the performance of the proposed algorithm is better than    PSO (Binary Particle Swarms Optimization), and GA (Genetic Algorithm).

DOI: http://dx.doi.org/10.11591/ij-ai.v2i4.4319


Keywords


Binary Black Hole,discrete search spaces,Optimization Problem,Sigmoid Function,gravity and electrical forces.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

IAES International Journal of Artificial Intelligence (IJ-AI)
ISSN/e-ISSN 2089-4872/2252-8938 
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

View IJAI Stats