In this paper we propose a discrete algebraic-based Differential Evolution for the Linear Ordering Problem (LOP). The search space of LOP is composed by permutations of objects, thus it is possible to use some group theoretical concepts and methods. Indeed, the proposed algorithm is a fully discrete Differential Evolution scheme and has been designed by exploiting the group structure of LOP solutions in order to mimic the classical Differential Evolution behavior observed in continuous numerical spaces. The performances have been evaluated over widely known LOP benchmark suites and have been compared to the state-of-the-art results.
An algebraic differential evolution for the linear ordering problem
Santucci Valentino
;
2015-01-01
Abstract
In this paper we propose a discrete algebraic-based Differential Evolution for the Linear Ordering Problem (LOP). The search space of LOP is composed by permutations of objects, thus it is possible to use some group theoretical concepts and methods. Indeed, the proposed algorithm is a fully discrete Differential Evolution scheme and has been designed by exploiting the group structure of LOP solutions in order to mimic the classical Differential Evolution behavior observed in continuous numerical spaces. The performances have been evaluated over widely known LOP benchmark suites and have been compared to the state-of-the-art results.File | Dimensione | Formato | |
---|---|---|---|
gecco2015_preprint.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
289.09 kB
Formato
Adobe PDF
|
289.09 kB | Adobe PDF | Visualizza/Apri |
gecco2015.pdf
non disponibili
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
706.63 kB
Formato
Adobe PDF
|
706.63 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.