Abstract
Inspiring by nature have motivated many researchers in many fields of sciences and engineering. The Gravitational search algorithm (GSA) is a recent created metaheuristic algorithm by using law of gravity and mass interactions. In this paper, a new operator inspired by some of the characteristics of the black hole as an astronomy phenomenon for GSA is presented. When a star is converted to a black hole under situations, it has the extremely strong gravity that prevents anything to escape from, and the objects that are closed to the black hole, experience very strong force called tidal force which it causes to collapse them to the black hole. We propose a new operator using these features and hybridize it with GSA (BH-GSA) in order to prevent facing the premature convergence and to improve the abilities of GSA in exploration and exploitation. The proposed algorithm is applied to two sets of standard benchmark functions. The first set includes 23 standard benchmark functions and in this set the performance of the proposed algorithm is compared with the standard GSA, the disruption GSA, the particle swarm optimization (PSO), and the real genetic algorithm (GA). The second set contains the CEC 2005 benchmark functions. In this set, we compare the BH-GSA with some well-known metaheuristic algorithms. The obtained results and comparing with the competing algorithms prove that the BH-GSA has merit in the field of continuous space optimization.
Article PDF
Avoid common mistakes on your manuscript.
References
K. S. Tang, K. F. Man, S. Kwong and Q. He, Genetic algorithms and their applications, IEEE Signal Processing Magazine 13 (6) (1996) 22–37.
F. V. D. Bergh and A. P. Engelbrecht, A study of particle swarm optimization particle trajectories, Information Sciences, 176(8), pp. 937–971 (2006).
J. Kennedy and R. C. Eberhart, Particle swarm optimization, in: Proceedings of IEEE International Conference on Neural Networks, vol. 4, 1995, pp. 1942–1948.
S. Kirkpatrick, C. D. Gelatto and M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680.
M. Dorigo, V. Maniezzo and A. Colorni, The ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics – Part B 26 (1) (1996) 29–41.
O. K. Erol and I. Eksin, A new optimization method: big bang–big crunch, Advances in Engineering Software 37 (2006) 106–111.
Ch. Guo, Zh. Jiang, H. Zhang and N. Li, Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system, Computers & Industrial Engineering 62 (2012) 141–151.
S. Mondal, A. Bhattacharya and S. H. N. Dey, Multi-objective economic emission load dispatch solution using gravitational search algorithm and considering wind power penetration, Electrical Power and Energy Systems 44(2013) 282–292.
D. Hu, A. Sarosh and Y. F. Dong, An improved particle swarm optimizer for parametric optimization of flexible satellite controller, Applied Mathematics and Computation 217 (2011) 8512–8521.
T. Ganesan, I. Elamvazuthi, Ku Zilati Ku Shaari and P. Vasant, Swarm intelligence and gravitational search algorithm for multi-objective optimization of synthesis gas production, Applied Energy, 2012 in Press.
E. Rashedi, H. Nezamabadi-pour, and S. Saryazdi, Filter modeling using gravitational search algorithm, Engineering Application of Artificial Intelligence, vol. 24, no.1 pp. 117–122, 2011.
F. Xhafa, A. Barolli, C. Sánchez and L. Barolli, A simulated annealing algorithm for router nodes placement problem in Wireless Mesh Networks, Simulation Modelling Practice and Theory, vol. 19, pp. 2276–2284, 2011.
D. d. Serafino, S. Gomez, L. Milano, F. Riccio and G. Toraldo, A genetic algorithm for a global optimization problem arising in the detection of gravitational waves, Springer Science and Business Media, (2010) 48:41–55.
P. C. Chang, J. J. Lin and C. H. Liu, An attribute weight assignment and particle swarm optimization algorithm for medical database classifications, Computer Methods and Programs in Biomedicine 107 (2012) 382–392.
B. Sahu and D. Mishra, A Novel Feature Selection Algorithm using Particle Swarm Optimization for Cancer Microarray Data, Procedia Engineering 38 ( 2012 ) 27 – 31.
D. Mishra, Discovery of Overlapping Pattern Biclusters from Gene Expression Data using Hash based PSO, Procedia Technology 4 (2012) 390–394.
U. Güvença, Y. Sönmezb, S. Dumanc and N. Yörükerend, Combined economic and emission dispatch solution using gravitational search algorithm, Scientia Iranica, 2012 in Press.
F. Musharavati and A. M. S. Hamouda, Simulated annealing with auxiliary knowledge for process planning optimization in reconfigurable manufacturing, Robotics and Computer-Integrated Manufacturing 28 (2012) 113–131.
Q. Zhua, J. Hu and L Henschen, A new moving target interception algorithm for mobile robots based on sub-goal forecasting and an improved scout ant algorithm, Applied Soft Computing 13 (2013) 539–549.
K. Ioannidis, G. Ch. Sirakoulis and I. Andreadis, Cellular ants: A method to create collision free trajectories for a cooperative robot team, Robotics and Autonomous Systems 59 (2011) 113–127.
E. G. Talbi, A taxonomy of hybrid metaheuristics, Journal of Heuristics, 8 (2002) pp. 541–564.
Z. Ye, Z. Li and M. Xie, Some improvements on adaptive genetic algorithms for reliability-related applications, Reliability Engineering and System Safety, 95(2), pp. 120–126 (2010).
S. H. Ling, H. H. C. Iu, K. Y. Chan, H. K. Lam, B. C. W. Yeung and F. H. Leung, Hybrid Particle Swarm Optimization With Wavelet Mutation and Its Industrial Applications, Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, vol. 38, pp. 743–763, June 2008.
H. Cheng, N. Xiong, A. V. Vasilakos, L. Tianruo Yang, G. Chen and X. Zhuang, Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks, Ad Hoc Networks 10 (2012) 760–773.
B. Yu, Z-Z. Yang and B. Yao, An improved ant colony optimization for vehicle routing problem, European Journal of Operational Research, vol. 196, pp. 171–176, July 2009.
E. Rashedi, H. Nezamabadi-pour and S. Saryazdi, BGSA: binary gravitational search algorithm, Natural Computing, vol.9, no. 3, pp. 727–745, 2010.
E. Rashedi, H. Nezamabadi-pour and S. Saryazdi, GSA: a gravitational search algorithm, Information Sciences, 179(13), pp. 2232–2248, 2009.
S. Sarafrazi, H. Nezamabadi-pour and S. Saryazdi, Disruption: A new operator in gravitational search algorithm, ScientiaIranica, pp. 539–548, Feb 2011.
C. Li and J. Zhou, Parameters identification of hydrulic turbine governing system using improved gravitational search algorithm, Energy Conversion and Management 52 (2011) 374–381.
M. Doraghinejad, H. Nezamabadi-pour and M.M. Farsangi, Black hole: a new operator in gravitational search algorithm for unimodal problems, 20th Iranian Conference on Electrical Engineering (ICEE’12), Tehran, Iran, May 2012 (in Farsi).
M. Doraghinejad, H. Nezamabadi-pour, A. H. Sadeghian and M.M.Farsangi, A Hybrid Algorithm Based on Gravitational Search Algorithm for Unimodal Optimization, 2nd International eConference on Computer and Knowledge Engineering (ICCKE’12), Mashhad, Iran, (Oct. 2012), pp. 129–132.
A. Hatamlou, Black hole: a new heuristic optimization approach for data clustering, Information Sciences 222 (2013) 175–184.
M. Markou and S. Singh, Feature selection based on a Black Hole model of data reorganization. In: 17th International conference on pattern recognition (ICPR04), (Cambridge, 2004), pp. 565–568.
S. Singh and M. Markou, A black hole novelty detector for video analysis. Pattern Anal Appl, (2005), 8:102– 114.
B. Schutz, A First Course in General Relativity, 2nd edn. (Cambridge University Press, 2009).
B. W.Carrol, D. A. Ostlie, An Introduction to Modern Astrophysics, 2nd edn. (Addison Wesley Publishing Company, 2007).
N. K. Glendenning, Special and General Relativity, (Springer, 2007).
R. A D’Inverno, Introducing Einstein’s Relativity, (The United States by Oxford University Press lnc, New York, 1998).
X. Yao, Y. Liu and G. Lin, Evolutionary programming made faster, IEEE Transactions on Evolutionary Computation 3 (1999) 82–102.
R. L. Haupt and E. Haupt, Practical Genetic Algorithms, 2nd edn. (John Wiley & Sons, 2004).
J. Derrac, S. Garcia, D. Molina and F. Herrera, A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm and Evolutionary Computation 1 (2011) 3–18.
L. Costa, A Parameter-less Evolution Strategy for Global Optimization, PhD thesis, Escola de Engenharia, Universidade do Minho, 2005.
J. Sun, B. Feng, W. Xu, Particle Swarm Optimization with particles having Quantum Behavior, In Proc. of Congress on Evolutionary Computation, Portland, USA, 2004, pp. 325 – 331.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Doraghinejad, M., Nezamabadi-pour, H. Black Hole: A New Operator for Gravitational Search Algorithm. Int J Comput Intell Syst 7, 809–826 (2014). https://doi.org/10.1080/18756891.2014.966990
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1080/18756891.2014.966990