Solving optimization problems using black hole algorithm

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.

[1]  Mathieu Serrurier,et al.  Improving inductive logic programming by using simulated annealing , 2008, Inf. Sci..

[2]  Janez Brest,et al.  A Brief Review of Nature-Inspired Algorithms for Optimization , 2013, ArXiv.

[3]  Georgios Dounias,et al.  Particle swarm optimization for pap-smear diagnosis , 2008, Expert Syst. Appl..

[4]  Abdolreza Hatamlou,et al.  Black hole: A new heuristic optimization approach for data clustering , 2013, Inf. Sci..

[5]  Levent Aksoy,et al.  Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Witold Pedrycz,et al.  Hybrid optimization with improved tabu search , 2011, Applied Soft Computing.

[7]  Anyong Qing.  Dynamic differential evolution strategy and applications in electromagnetic inverse scattering problems , 2006, IEEE Transactions on Geoscience and Remote Sensing.

[8]  Marcos José Santana,et al.  A Performance Evaluation Study for QoS-aware Web Services Composition Using Heuristic Algorithms , 2013, ICDS 2013.

[9]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[10]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[11]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[12]  José Torres-Jiménez,et al.  Improving the Performance of Heuristic Algorithms Based on Exploratory Data Analysis , 2013, Recent Advances on Hybrid Intelligent Systems.

[13]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[14]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[15]  K.Y. Lee,et al.  Differential Evolution and its Applications to Power Plant Control , 2007, 2007 International Conference on Intelligent Systems Applications to Power Systems.

[16]  Philip N. Klein,et al.  Approximation algorithms for NP-hard optimization problems , 2010 .

[17]  Shyi-Ming Chen,et al.  Parallelized genetic ant colony systems for solving the traveling salesman problem , 2011, Expert Syst. Appl..

[18]  Jemal H. Abawajy,et al.  An efficient meta-heuristic algorithm for grid computing , 2013, Journal of Combinatorial Optimization.

[19]  Michael J. Brusco,et al.  Exact and approximate algorithms for variable selection in linear discriminant analysis , 2011, Comput. Stat. Data Anal..

[20]  Martin Lukasiewycz,et al.  Opt4J: a modular framework for meta-heuristic optimization , 2011, GECCO '11.

[21]  Edward A. Hirsch,et al.  Optimal heuristic algorithms for the image of an injective function , 2011, Electron. Colloquium Comput. Complex..

[22]  Isa Maleki,et al.  New Approach for Solving Dynamic Traveling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization , 2012 .

[23]  Philip N. Klein,et al.  Approximation algorithms for NP-hard optimization problems (CRC Handbook Chapter 34) , 1999 .

[24]  Fevrier Valdez,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 , 2012, Inf. Sci..

[25]  William H. Hsu,et al.  A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problem , 2007, Ann. Oper. Res..

[26]  Shyi-Ming Chen,et al.  Multi-variable fuzzy forecasting based on fuzzy clustering and fuzzy rule interpolation techniques , 2010, Inf. Sci..

[27]  Paolo Ienne,et al.  Exact and approximate algorithms for the extension of embedded processor instruction sets , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[28]  Xin-She Yang,et al.  Metaheuristic Optimization: Nature-Inspired Algorithms and Applications , 2013, Artificial Intelligence, Evolutionary Computing and Metaheuristics.

[29]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[30]  Farhad Soleimanian Gharehchopogh,et al.  New Approach for Solving Dynamic Travelling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization , 2012 .

[31]  Kyuseok Shim,et al.  Approximate algorithms for K-anonymity , 2007, SIGMOD '07.

[32]  Jordan Ninin,et al.  A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms , 2011, J. Glob. Optim..

[33]  Martin Middendorf,et al.  Simple probabilistic population based optimization for combinatorial optimization , 2013, 2013 IEEE Symposium on Swarm Intelligence (SIS).