Motivated from the previously proposed algebraic framework for combinatorial optimization, here we introduce a novel formal languages-based perspective on discrete search spaces that allows to automatically derive algebraic evolutionary algorithms. The practical effect of the proposed approach is that the algorithm designer does not need to choose a solutions encoding and implement algorithmic procedures. Indeed, he/she only has to provide the group presentation of the discrete solutions of the problem at hand. Then, the proposed mechanism allows to automatically derive concrete implementations of a chosen evolutionary algorithms. Theoretical guarantees about the feasibility of the proposed approach are provided.
Automatic Algebraic Evolutionary Algorithms
Santucci, Valentino
2018-01-01
Abstract
Motivated from the previously proposed algebraic framework for combinatorial optimization, here we introduce a novel formal languages-based perspective on discrete search spaces that allows to automatically derive algebraic evolutionary algorithms. The practical effect of the proposed approach is that the algorithm designer does not need to choose a solutions encoding and implement algorithmic procedures. Indeed, he/she only has to provide the group presentation of the discrete solutions of the problem at hand. Then, the proposed mechanism allows to automatically derive concrete implementations of a chosen evolutionary algorithms. Theoretical guarantees about the feasibility of the proposed approach are provided.File | Dimensione | Formato | |
---|---|---|---|
PAPER.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
399.16 kB
Formato
Adobe PDF
|
399.16 kB | Adobe PDF | Visualizza/Apri |
wivace2017.pdf
non disponibili
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
645.2 kB
Formato
Adobe PDF
|
645.2 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.