Tree-Based Optimization: A Meta-Algorithm for Metaheuristic Optimization

Designing search algorithms for finding global optima is one of the most active research fields, recently. These algorithms consist of two main categories, i.e., classic mathematical and metaheuristic algorithms. This article proposes a meta-algorithm, Tree-Based Optimization (TBO), which uses other heuristic optimizers as its sub-algorithms in order to improve the performance of search. The proposed algorithm is based on mathematical tree subject and improves performance and speed of search by iteratively removing parts of the search space having low fitness, in order to minimize and purify the search space. The experimental results on several well-known benchmarks show the outperforming performance of TBO algorithm in finding the global solution. Experiments on high dimensional search spaces show significantly better performance when using the TBO algorithm. The proposed algorithm improves the search algorithms in both accuracy and speed aspects, especially for high dimensional searching such as in VLSI CAD tools for Integrated Circuit (IC) design.

[1]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[2]  Ardeshir Bahreininejad,et al.  Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems , 2015, Appl. Soft Comput..

[3]  Xin-She Yang,et al.  Binary bat algorithm , 2013, Neural Computing and Applications.

[4]  M. J. Mahjoob,et al.  A new meta-heuristic optimization algorithm: Hunting Search , 2009, 2009 Fifth International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control.

[5]  John R. Koza,et al.  Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems , 1990 .

[6]  Nysret Musliu,et al.  Metaheuristic Algorithms and Tree Decomposition , 2015, Handbook of Computational Intelligence.

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  Patrice Boizumault,et al.  Guiding VNS with Tree Decomposition , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[9]  Nysret Musliu.  Generation of Tree Decompositions by Iterated Local Search , 2007, EvoCOP.

[10]  J. Franklin,et al.  The elements of statistical learning: data mining, inference and prediction , 2005 .

[11]  Andrew Lewis,et al.  Grey Wolf Optimizer , 2014, Adv. Eng. Softw..

[12]  Ur Informationssysteme.  An Iterative Heuristic Algorithm for Tree Decomposition , 2007 .

[13]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[14]  John Fulcher,et al.  Computational Intelligence: An Introduction , 2008, Computational Intelligence: A Compendium.

[15]  Carlos Cotta,et al.  Embedding Branch and Bound within Evolutionary Algorithms , 2003, Applied Intelligence.

[16]  Mauro Birattari,et al.  Dm63 Heuristics for Combinatorial Optimization Ant Colony Optimization Exercises Outline Ant Colony Optimization: the Metaheuristic Application Examples Generalized Assignment Problem (gap) Connection between Aco and Other Metaheuristics Encodings Capacited Vehicle Routing Linear Ordering Ant Colony , 2022 .

[17]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[18]  Ana Maria A. C. Rocha,et al.  Solving Large 0–1 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm , 2015, J. Math. Model. Algorithms Oper. Res..

[19]  Amir Hossein Alavi,et al.  Krill herd: A new bio-inspired optimization algorithm , 2012 .

[20]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[21]  El-Ghazali Talbi,et al.  Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts , 2012, Comput. Oper. Res..

[22]  Seyed Mohammad Mirjalili,et al.  Multi-Verse Optimizer: a nature-inspired algorithm for global optimization , 2015, Neural Computing and Applications.

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

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

[25]  Christian Blum,et al.  Beam-ACO for Simple Assembly Line Balancing , 2008, INFORMS J. Comput..

[26]  Nysret Musliu,et al.  Ant Colony Optimization for Tree Decompositions , 2010, EvoCOP.

[27]  Muzaffar Eusuff,et al.  Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization , 2006 .

[28]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[29]  Juliane Jung,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[30]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[31]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

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

[33]  N. Musliu,et al.  Genetic algorithms for generalised hypertree decompositions , 2007 .

[34]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[35]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[36]  Pedro Larrañaga,et al.  Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms , 1997, Stat. Comput..

[37]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[38]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[39]  Seyed Mohammad Mirjalili,et al.  The Ant Lion Optimizer , 2015, Adv. Eng. Softw..

[40]  Xin-She Yang,et al.  Firefly algorithm with chaos , 2013, Commun. Nonlinear Sci. Numer. Simul..

[41]  Broderick Crawford,et al.  A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem , 2015 .

[42]  Robert Tibshirani,et al.  The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.

[43]  Gülay Tezel,et al.  Artificial algae algorithm (AAA) for nonlinear global optimization , 2015, Appl. Soft Comput..

[44]  Manuel López-Ibáñez,et al.  Beam-ACO for the travelling salesman problem with time windows , 2010, Comput. Oper. Res..

[45]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[46]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[47]  Fariborz Jolai,et al.  Lion Optimization Algorithm (LOA): A nature-inspired metaheuristic algorithm , 2016, J. Comput. Des. Eng..

[48]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[49]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .