Several optimization problems have features that hinder the capabilities of searching heuristics. To cope with this issue, different methods have been proposed to manipulate search spaces and improve the optimization process. This paper focuses on Dilation Functions (DFs), which are one of the most promising techniques to manipulate the fitness landscape, by expanding or compressing specific regions. The definition of appropriate DFs is problem dependent and requires a-priori knowledge of the optimization problem. Therefore, it is essential to introduce an automatic and efficient strategy to identify optimal DFs. With this aim, we propose a novel method based on Genetic Programming, named GP4DFs, which is capable of evolving effective DFs. GP4DFs identifies optimal dilations, where a specific DF is applied to each dimension of the search space. Moreover, thanks to a knowledge-driven initialization strategy, GP4DFs converges to better solutions with a reduced number of fitness evaluations, compared to the state-of-the-art approaches. The performance of GP4DFs is assessed on a set of 43 benchmark functions mimicking several features of real-world optimization problems. The obtained results indicate the suitability of the generated DFs.

Papetti, D., Tangherloni, A., Farinati, D., Cazzaniga, P., Vanneschi, L. (2023). Simplifying Fitness Landscapes Using Dilation Functions Evolved With Genetic Programming. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 18(1), 22-31 [10.1109/MCI.2022.3222096].

Simplifying Fitness Landscapes Using Dilation Functions Evolved With Genetic Programming

Papetti, DM;Tangherloni, A;Vanneschi, L
2023

Abstract

Several optimization problems have features that hinder the capabilities of searching heuristics. To cope with this issue, different methods have been proposed to manipulate search spaces and improve the optimization process. This paper focuses on Dilation Functions (DFs), which are one of the most promising techniques to manipulate the fitness landscape, by expanding or compressing specific regions. The definition of appropriate DFs is problem dependent and requires a-priori knowledge of the optimization problem. Therefore, it is essential to introduce an automatic and efficient strategy to identify optimal DFs. With this aim, we propose a novel method based on Genetic Programming, named GP4DFs, which is capable of evolving effective DFs. GP4DFs identifies optimal dilations, where a specific DF is applied to each dimension of the search space. Moreover, thanks to a knowledge-driven initialization strategy, GP4DFs converges to better solutions with a reduced number of fitness evaluations, compared to the state-of-the-art approaches. The performance of GP4DFs is assessed on a set of 43 benchmark functions mimicking several features of real-world optimization problems. The obtained results indicate the suitability of the generated DFs.
Articolo in rivista - Articolo scientifico
Evolution; Genetic programming; Transforms; Benchmark testing; Search problems; Statistics
English
25-gen-2023
2023
18
1
22
31
none
Papetti, D., Tangherloni, A., Farinati, D., Cazzaniga, P., Vanneschi, L. (2023). Simplifying Fitness Landscapes Using Dilation Functions Evolved With Genetic Programming. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 18(1), 22-31 [10.1109/MCI.2022.3222096].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/434400
Citazioni
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
Social impact