Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems

Citations Over TimeTop 10% of 2020 papers

Abstract

Metaheuristics have become a widely used approach for solving a variety of practical problems. The literature is full of diverse metaheuristics based on outstanding ideas and with proven excellent capabilities. Nonetheless, oftentimes metaheuristics claim novelty when they are just recombining elements from other methods. Hence, the need for a standard metaheuristic model is vital to stop the current frenetic tendency of proposing methods chiefly based on their inspirational source. This work introduces a first step to a generalised and mathematically formal metaheuristic model, which can be used for studying and improving them. This model is based on a scheme of simple heuristics, which perform as building blocks that can be modified depending on the application. For this purpose, we define and detail all components and concepts of a metaheuristic (i.e., its search operators), such as heuristics. Furthermore, we also provide some ideas to take into account for exploring other search operator configurations in the future. To illustrate the proposed model, we analyse search operators from four well-known metaheuristics employed in continuous optimisation problems as a proof-of-concept. From them, we derive 20 different approaches and use them for solving some benchmark functions with different landscapes. Data show the remarkable capability of our methodology for building metaheuristics and detecting which operator to choose depending on the problem to solve. Moreover, we outline and discuss several future extensions of this model to various problem and solver domains.

Related Papers

• → The Ant Colony Optimization Metaheuristic(2004)1,418 cited
• → Parallel Implementations of the Ant Colony Optimization Metaheuristic(2016)3 cited
• → Metaheuristic Optimization Methods(2019)2 cited
• PARALLELIZATION STRATEGY FOR ANT COLONY OPTIMIZATION METAHEURISTIC(2016)
• → Parallel metaheuristic algorithm(2023)