Solving optimization problems using black hole algorithm

  • Authors

    • Masoum Farahmandian Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran
    • Abdolreza Hatamlou Department of Computer Engineering, Khoy Branch, Islamic Azad University, Khoy, Iran
    2015-02-18
    https://doi.org/10.14419/jacst.v4i1.4094
  • Optimization, Meta-Heuristic Optimization, Black Hole Algorithm, Particle Swarm Optimization, Genetic Algorithm.

  • Abstract

    Various meta-heuristic optimization approaches have been recently created and applied in different areas. Many of these approaches are inspired by swarm behaviors in the nature. This paper studies the solving optimization problems using Black Hole Algorithm (BHA) which is a population-based algorithm. Since the performance of this algorithm was not tested in mathematical functions, we have studied this issue using some standard functions. The results of the BHA are compared with the results of GA and PSO algorithms which indicate that the performance of BHA is better than the other two mentioned algorithms.

  • References

    1. [1] Rashedi, E., H. Nezamabadi-Pour, and S. Saryazdi, GSA: a gravitational search algorithm. Information sciences, 2009. 179(13): p. 2232-2248. http://dx.doi.org/10.1016/j.ins.2009.03.004.

      [2] Woeginger, G.J., Exact algorithms for NP-hard problems: A survey, in Combinatorial Optimization—Eureka, You Shrink! 2003, Springer. p. 185-207. http://dx.doi.org/10.1007/3-540-36478-1_17.

      [3] Pozzi, L., K. Atasu, and P. Ienne, Exact and approximate algorithms for the extension of embedded processor instruction sets. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 2006. 25(7): p. 1209-1229. http://dx.doi.org/10.1109/TCAD.2005.855950.

      [4] Park, H. and K. Shim. Approximate algorithms for k-anonymity. in Proceedings of the 2007 ACM SIGMOD international conference on Management of data. 2007: ACM. http://dx.doi.org/10.1145/1247480.1247490.

      [5] Aksoy, L., et al., Exact and approximate algorithms for the optimization of area and delay in multiple constant multiplications. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 2008. 27(6): p. 1013-1026. http://dx.doi.org/10.1109/TCAD.2008.923242.

      [6] Klein, P.N. and N.E. Young. Approximation algorithms for NP-hard optimization problems. in Algorithms and theory of computation handbook. 2010: Chapman & Hall/CRC.

      [7] Guo, H. and W.H. Hsu, machine learning approach to algorithm selection for mathcal {NP}-hard optimization problems: a case study on the MPE problem. Annals of Operations Research, 2007. 156(1): p. 61-82. http://dx.doi.org/10.1007/s10479-007-0229-6.

      [8] Quiroz, M., et al., Improving the Performance of Heuristic Algorithms Based on Exploratory Data Analysis, in Recent Advances on Hybrid Intelligent Systems. 2013, Springer. p. 361-375. http://dx.doi.org/10.1007/978-3-642-33021-6_29.

      [9] Do Prado, P.F., et al. A Performance Evaluation Study for QoS-aware Web Services Composition Using Heuristic Algorithms. in ICDS 2013, The Seventh International Conference on Digital Society. 2013.

      [10] Hirsch, E., et al., Optimal heuristic algorithms for the image of an injective function. Journal of Mathematical Sciences, 2013. 188(1): p. 7-16. http://dx.doi.org/10.1007/s10958-012-1102-y.

      [11] Lukasiewycz, M., et al. Opt4J: a modular framework for meta-heuristic optimization. In Proceedings of the 13th annual conference on Genetic and evolutionary computation. 2011: ACM.

      [12] Mashinchi, M.H., M.A. Orgun, and W. Pedrycz, Hybrid optimization with improved tabu search. Applied Soft Computing, 2011. 11(2): p. 1993-2006. http://dx.doi.org/10.1016/j.asoc.2010.06.015.

      [13] Serrurier, M. and H. Prade, Improving inductive logic programming by using simulated annealing. Information sciences, 2008. 178(6): p. 1423-1441. http://dx.doi.org/10.1016/j.ins.2007.10.015.

      [14] Marinakis, Y., M. Marinaki, and G. Dounias, Particle swarm optimization for pap-smear diagnosis. Expert Systems with Applications, 2008. 35(4): p. 1645-1656. http://dx.doi.org/10.1016/j.eswa.2007.08.089.

      [15] Van Sickel, J.H., K.Y. Lee, and J.S. Heo. Differential evolution and its applications to power plant control. In Intelligent Systems Applications to Power Systems, 2007. ISAP 2007. International Conference on. 2007: IEEE.

      [16] Qing, A., Dynamic differential evolution strategy and applications in electromagnetic inverse scattering problems. Geoscience and Remote Sensing, IEEE Transactions on, 2006. 44(1): p. 116-125. http://dx.doi.org/10.1109/TGRS.2005.859347.

      [17] Soleimanian, F., I. Maleki, and M. Farahmandian, New Approach for Solving Dynamic Travelling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization. Methods, 2012. 53(1).

      [18] Castillo, O., et al., Comparative study of bio-inspired algorithms applied to the optimization of type-1 and type-2 fuzzy controllers for an autonomous mobile robot. Information sciences, 2012. 192: p. 19-38. http://dx.doi.org/10.1016/j.ins.2010.02.022.

      [19] Wolpert, D.H. and W.G. Macready, No free lunch theorems for optimization. Evolutionary Computation, IEEE Transactions on, 1997. 1(1): p. 67-82. http://dx.doi.org/10.1109/4235.585893.

      [20] Yang, X.-S., Nature-inspired metaheuristic algorithms. 2010: Luniver Press.

      [21] Pooranian, Z., et al., An efficient meta-heuristic algorithm for grid computing. Journal of Combinatorial Optimization, 2013: p. 1-22.

      [22] Talbi, E.-G., Metaheuristics: from design to implementation. Vol. 74. 2009: John Wiley & Sons. http://dx.doi.org/10.1002/9780470496916.

      [23] Lin, Y.-C. And M. Middendorf. Simple probabilistic population based optimization for combinatorial optimization. In Swarm Intelligence (SIS), 2013 IEEE Symposium on. 2013: IEEE.

      [24] Yang, X.-S., Metaheuristic Optimization: Nature-Inspired Algorithms and Applications, in Artificial Intelligence, Evolutionary Computing and Metaheuristics. 2013, Springer. p. 405-420. http://dx.doi.org/10.1007/978-3-642-29694-9_16.

      [25] Fister Jr, I., et al., A Brief Review of Nature-Inspired Algorithms for Optimization. arXiv preprint arXiv:1307.4186, 2013.

      [26] Ninin, J. and F. Messine, A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms. Journal of Global Optimization, 2011. 50(4): p. 629-644. http://dx.doi.org/10.1007/s10898-010-9531-y.

      [27] Brusco, M.J. and D. Steinley, Exact and approximate algorithms for variable selection in linear discriminant analysis. Computational Statistics & Data Analysis, 2011. 55(1): p. 123-131. http://dx.doi.org/10.1016/j.csda.2010.05.027.

      [28] Hatamlou, A., Black hole: A new heuristic optimization approach for data clustering. Information sciences, 2012: p. 175-184.

      [29] Chen, S.-M. And Y.-C. Chang, Multi-variable fuzzy forecasting based on fuzzy clustering and fuzzy rule interpolation techniques. Information sciences, 2010. 180(24): p. 4772-4783. http://dx.doi.org/10.1016/j.ins.2010.08.026.

      [30] Chen, S.-M. And C.-Y. Chien, Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Systems with Applications, 2011. 38(4): p. 3873-3883. http://dx.doi.org/10.1016/j.eswa.2010.09.048.

  • Downloads

  • How to Cite

    Farahmandian, M., & Hatamlou, A. (2015). Solving optimization problems using black hole algorithm. Journal of Advanced Computer Science & Technology (JACST), 4(1), 68-74. https://doi.org/10.14419/jacst.v4i1.4094

    Received date: 2014-12-30

    Accepted date: 2015-01-26

    Published date: 2015-02-18