AutoMH: Automatically Create Evolutionary Metaheuristic Algorithms Using Reinforcement Learning
Open Access
Abstract
Machine learning research has been able to solve problems in multiple domains. Machine learning represents an open area of research for solving optimisation problems. The optimisation problems can be solved using a metaheuristic algorithm, which can find a solution in a reasonable amount of time. However, the time required to find an appropriate metaheuristic algorithm, that would have the convenient configurations to solve a set of optimisation problems properly presents a problem. The proposal described in this article contemplates an approach that automatically creates metaheuristic algorithms given a set of optimisation problems. These metaheuristic algorithms are created by modifying their logical structure via the execution of an evolutionary process. This process employs an extension of the reinforcement learning approach that considers multi-agents in their environment, and a learning agent composed of an analysis process and a process of modification of the algorithms. The approach succeeded in creating a metaheuristic algorithm that managed to solve different continuous domain optimisation problems from the experiments performed. The implications of this work are immediate because they describe a basis for the generation of metaheuristic algorithms in an online-evolution.Keywords
All Related Versions
This publication has 38 references indexed in Scilit:
- Multi-Verse Optimizer: a nature-inspired algorithm for global optimizationNeural Computing and Applications, 2015
- Grey Wolf OptimizerAdvances in Engineering Software, 2014
- A literature survey of benchmark functions for global optimisation problemsInternational Journal of Mathematical Modelling and Numerical Optimisation, 2013
- Using machine learning in a cooperative hybrid parallel strategy of metaheuristicsInformation Sciences, 2009
- Nonparametric multiple comparison procedures for unbalanced two-way layoutsJournal of Statistical Planning and Inference, 2008
- Nonparametric multiple comparison procedures for unbalanced one-way factorial designsJournal of Statistical Planning and Inference, 2008
- A genetic algorithm tutorialStatistics and Computing, 1994
- Generalized descent for global optimizationJournal of Optimization Theory and Applications, 1981
- An Automatic Method for Finding the Greatest or Least Value of a FunctionThe Computer Journal, 1960
- The Kolmogorov-Smirnov Test for Goodness of FitJournal of the American Statistical Association, 1951