Global Optimisation through Hyper-Heuristics: Unfolding Population-Based Metaheuristics

Abstract

Optimisation has been with us since before the first humans opened their eyes to natural phenomena that inspire technological progress. Nowadays, it is quite hard to find a solver from the overpopulation of metaheuristics that properly deals with a given problem. This is even considered an additional problem. In this work, we propose a heuristic-based solver model for continuous optimisation problems by extending the existing concepts present in the literature. We name such solvers ‘unfolded’ metaheuristics (uMHs) since they comprise a heterogeneous sequence of simple heuristics obtained from delegating the control operator in the standard metaheuristic scheme to a high-level strategy. Therefore, we tackle the Metaheuristic Composition Optimisation Problem by tailoring a particular uMH that deals with a specific application. We prove the feasibility of this model via a two-fold experiment employing several continuous optimisation problems and a collection of diverse population-based operators with fixed dimensions from ten well-known metaheuristics in the literature. As a high-level strategy, we utilised a hyper-heuristic based on Simulated Annealing. Results demonstrate that our proposed approach represents a very reliable alternative with a low computational cost for tackling continuous optimisation problems with a tailored metaheuristic using a set of agents. We also study the implication of several parameters involved in the uMH model and their influence over the solver performance.

Honeywords Generation Technique based on Meerkat Clan Algorithm and WordNet

“…The primary goal of this strategy is to enhance the efficiency of problem-solving by leveraging the effectiveness of collaborative endeavors. This concept is frequently utilized in optimization and problem-solving scenarios [14]. Meerkats demonstrate collective decision-making, allocation of tasks based on individual capabilities, communication through vocalizations and body language, as well as adaptability and the ability to learn from mistakes.…”

GIS-Based Simulated Annealing Algorithm for the Optimum Location of Fire Stations in the Madrid Region, Spain: Monitoring the Collapse Index

“…This method has advantages compared to other heuristic methods such as its ability to solve continuous problems [39,40], establishing a strong stochastic neighbourhood search technique compared to the genetic algorithm approach [32,41] In addition to these characteristics, simulated annealing can be integrated in geographic information systems [42] and is more suitable for combinatorial optimisation problems than other types of optimisation techniques using GIS, such as Greenfield analysis. This method does not take into account roads, cities, and peculiarities of geographical areas and cannot address combinatorial optimisation problems [43].…”

Emergence of New Local Search Algorithms with Neuro-Evolution

“…Comment faire émerger de nouveaux opérateurs de recherche locale bien adaptés à un problème combinatoire particulier ? Certains travaux proposent déjà une génération automatique d'opérateurs à partir de constituants de base d'heuristiques [1], ce qui limite cependant la possibilité de produire des opérateurs complètement nouveaux. La spécificité de ce travail, est de faire émerger de nouveaux algorithmes de recherche locale grâce aux techniques de neuroévolution [3] et d'apprentissage par renforcement, sans présupposer l'existence de constituants prédéfinis, mais en faisant "jouer" et évoluer ces "agents de recherche locale" dans un monde ouvert constitué du paysage de fitness du problème à résoudre, à la manière de ce qui a été récemment fait pour l'étude de l'émergence de nouveaux moyens de locomotions par des intelligences artificielles dans des environnements complexes [4].…”