Your browser doesn't support javascript.
loading
Autonomous Parameter Balance in Population-Based Approaches: A Self-Adaptive Learning-Based Strategy.
Vega, Emanuel; Lemus-Romani, José; Soto, Ricardo; Crawford, Broderick; Löffler, Christoffer; Peña, Javier; Talbi, El-Gazhali.
Afiliação
  • Vega E; Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Valparaíso 2362807, Chile.
  • Lemus-Romani J; Escuela de Construcción Civil, Pontificia Universidad Católica de Chile, Avenida Vicuña Mackenna 4860, Macul, Santiago 7820436, Chile.
  • Soto R; Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Valparaíso 2362807, Chile.
  • Crawford B; Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Valparaíso 2362807, Chile.
  • Löffler C; Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Valparaíso 2362807, Chile.
  • Peña J; Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Valparaíso 2362807, Chile.
  • Talbi EG; CNRS/CRIStAL, University of Lille, 59655 Villeneuve d'Ascq, France.
Biomimetics (Basel) ; 9(2)2024 Jan 31.
Article em En | MEDLINE | ID: mdl-38392128
ABSTRACT
Population-based metaheuristics can be seen as a set of agents that smartly explore the space of solutions of a given optimization problem. These agents are commonly governed by movement operators that decide how the exploration is driven. Although metaheuristics have successfully been used for more than 20 years, performing rapid and high-quality parameter control is still a main concern. For instance, deciding the proper population size yielding a good balance between quality of results and computing time is constantly a hard task, even more so in the presence of an unexplored optimization problem. In this paper, we propose a self-adaptive strategy based on the on-line population balance, which aims for improvements in the performance and search process on population-based algorithms. The design behind the proposed approach relies on three different components. Firstly, an optimization-based component which defines all metaheuristic tasks related to carry out the resolution of the optimization problems. Secondly, a learning-based component focused on transforming dynamic data into knowledge in order to influence the search in the solution space. Thirdly, a probabilistic-based selector component is designed to dynamically adjust the population. We illustrate an extensive experimental process on large instance sets from three well-known discrete optimization problems Manufacturing Cell Design Problem, Set covering Problem, and Multidimensional Knapsack Problem. The proposed approach is able to compete against classic, autonomous, as well as IRace-tuned metaheuristics, yielding interesting results and potential future work regarding dynamically adjusting the number of solutions interacting on different times within the search process.
Palavras-chave

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Idioma: En Revista: Biomimetics (Basel) Ano de publicação: 2024 Tipo de documento: Article País de afiliação: Chile País de publicação: Suíça

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Idioma: En Revista: Biomimetics (Basel) Ano de publicação: 2024 Tipo de documento: Article País de afiliação: Chile País de publicação: Suíça