Which algorithm should I choose: An evolutionary algorithm portfolio approach

A novel predictive measure that predicts which algorithm is best at any given point in time. Always select the predicted best algorithm to run for the next generation.The performance of our method is very competitive if viewed as another novel "individual" algorithm.A very interesting positive synergistic effect is found between algorithms in our method.A novel performance evaluation method that makes a lot of sense when one has an absolute maximum number of function evaluations allowed in your application.Application on a Heating Ventilation and Air Conditioning design problem demonstrates that the method can be used to solve real world problems with constraints and that it performs better than choosing an algorithm randomly. Many good evolutionary algorithms have been proposed in the past. However, frequently, the question arises that given a problem, one is at a loss of which algorithm to choose. In this paper, we propose a novel algorithm portfolio approach to address the above problem for single objective optimization. A portfolio of evolutionary algorithms is first formed. Covariance Matrix Adaptation Evolution Strategy (CMA-ES), History driven Evolutionary Algorithm (HdEA), Particle Swarm Optimization (PSO2011) and Self adaptive Differential Evolution (SaDE) are chosen as component algorithms. Each algorithm runs independently with no information exchange. At any point in time, the algorithm with the best predicted performance is run for one generation, after which the performance is predicted again. The best algorithm runs for the next generation, and the process goes on. In this way, algorithms switch automatically as a function of the computational budget. This novel algorithm is named Multiple Evolutionary Algorithm (MultiEA). The predictor we introduced has the nice property of being parameter-less, and algorithms switch automatically as a function of budget. The following contributions are made: (1) experimental results on 24 benchmark functions show that MultiEA outperforms (i) Multialgorithm Genetically Adaptive Method for Single Objective Optimization (AMALGAM-SO); (ii) Population-based Algorithm Portfolio (PAP); (iii) a multiple algorithm approach which chooses an algorithm randomly (RandEA); and (iv) a multiple algorithm approach which divides the computational budget evenly and execute all algorithms in parallel (ExhEA). This shows that it outperforms existing portfolio approaches and the predictor is functioning well. (2) Moreover, a neck to neck comparison of MultiEA with CMA-ES, HdEA, PSO2011, and SaDE is also made. Experimental results show that the performance of MultiEA is very competitive. In particular, MultiEA, being a portfolio algorithm, is sometimes even better than all its individual algorithms, and has more robust performance. (3) Furthermore, a positive synergic effect is discovered, namely, MultiEA can sometimes perform better than the sum of its individual EAs. This gives interesting insights into why an algorithm portfolio is a good approach. (4) It is found that MultiEA scales as well as the best algorithm in the portfolio. This suggests that MultiEA scales up nicely, which is a desirable algorithmic feature. (5) Finally, the performance of MultiEA is investigated on a real world problem. It is found that MultiEA can select the most suitable algorithm for the problem and is much better than choosing algorithms randomly.

[1]  Andries Petrus Engelbrecht,et al.  Investigating the impact of alternative evolutionary selection strategies on multi-method global optimization , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[2]  Andries P. Engelbrecht,et al.  Computational Intelligence: An Introduction , 2002 .

[3]  Shiu Yin Yuen,et al.  On composing an algorithm portfolio , 2015, Memetic Computing.

[4]  John Rachlin,et al.  A-Teams: An Agent Architecture for Optimization and Decision Support , 1998, ATAL.

[5]  Jano I. van Hemert,et al.  Discovering the suitability of optimisation algorithms by learning from evolved instances , 2011, Annals of Mathematics and Artificial Intelligence.

[6]  Jürgen Schmidhuber,et al.  Adaptive Online Time Allocation to Search Algorithms , 2004, ECML.

[7]  Jasper A Vrugt,et al.  Improved evolutionary optimization from genetically adaptive multimethod search , 2007, Proceedings of the National Academy of Sciences.

[8]  K. Deb An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[9]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[10]  Jürgen Schmidhuber,et al.  Algorithm portfolio selection as a bandit problem with unbounded losses , 2011, Annals of Mathematics and Artificial Intelligence.

[11]  Shiu Yin Yuen,et al.  On composing an (evolutionary) algorithm portfolio , 2013, GECCO '13 Companion.

[12]  Xin Zhang,et al.  A novel artificial bee colony algorithm for HVAC optimization problems , 2013 .

[13]  Günter Rudolph,et al.  Tuning optimization algorithms for real-world problems by means of surrogate modeling , 2010, GECCO '10.

[14]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[15]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[16]  Fei Peng,et al.  Population-Based Algorithm Portfolios for Numerical Optimization , 2010, IEEE Transactions on Evolutionary Computation.

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

[18]  Alex Fukunaga,et al.  Genetic algorithm portfolios , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[19]  Gary J. Koehler,et al.  Conditions that Obviate the No-Free-Lunch Theorems for Optimization , 2007, INFORMS J. Comput..

[20]  Nikolaus Hansen,et al.  The CMA Evolution Strategy: A Tutorial , 2016, ArXiv.

[21]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[22]  Andrew M. Sutton,et al.  Differential evolution and non-separability: using selective pressure to focus search , 2007, GECCO '07.

[23]  Rajkumar Roy,et al.  Evolutionary-based techniques for real-life optimisation: development and testing , 2002, Appl. Soft Comput..

[24]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[25]  Georgios C. Anagnostopoulos,et al.  Online model racing based on extreme performance , 2014, GECCO.

[26]  Xin Yao,et al.  Population-based Algorithm Portfolios with automated constituent algorithms selection , 2014, Inf. Sci..

[27]  Rajkumar Roy,et al.  Recent advances in engineering design optimisation: Challenges and future trends , 2008 .

[28]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[29]  Mark Hoogendoorn,et al.  Parameter Control in Evolutionary Algorithms: Trends and Challenges , 2015, IEEE Transactions on Evolutionary Computation.

[30]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[31]  Bruce A. Robinson,et al.  Self-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces , 2009, IEEE Transactions on Evolutionary Computation.

[32]  David H. Wolpert,et al.  What makes an optimization problem hard? , 1995, Complex..

[33]  Shiu Yin Yuen,et al.  Which algorithm should i choose at any point of the search: an evolutionary portfolio approach , 2013, GECCO '13.

[34]  Yew-Soon Ong,et al.  A Probabilistic Memetic Framework , 2009, IEEE Transactions on Evolutionary Computation.

[35]  Mario A. Muñoz,et al.  The Algorithm Selection Problem on the Continuous Optimization Domain , 2013 .

[36]  Shiu Yin Yuen,et al.  An Evolutionary Algorithm That Makes Decision Based on the Entire Previous Search History , 2011, IEEE Transactions on Evolutionary Computation.

[37]  Dirk Thierens,et al.  An Adaptive Pursuit Strategy for Allocating Operator Probabilities , 2005, BNAIC.

[38]  Michèle Sebag,et al.  Toward comparison-based adaptive operator selection , 2010, GECCO '10.