In this paper a new discrete Differential Evolution algorithm for the Permutation Flowshop Scheduling Problem with the total flowtime criterion is proposed. The core of the algorithm is the distance-based differential mutation operator defined by means of a new randomized bubble sort algorithm. This mutation scheme allows the Differential Evolution to directly navigate the permutations search space. Experiments were held on a well known benchmark suite and the results show that our proposal outperforms state-of-the-art algorithms on the majority of the problems.
A differential evolution algorithm for the permutation flowshop scheduling problem with total flow time criterion
Santucci Valentino
;
2014-01-01
Abstract
In this paper a new discrete Differential Evolution algorithm for the Permutation Flowshop Scheduling Problem with the total flowtime criterion is proposed. The core of the algorithm is the distance-based differential mutation operator defined by means of a new randomized bubble sort algorithm. This mutation scheme allows the Differential Evolution to directly navigate the permutations search space. Experiments were held on a well known benchmark suite and the results show that our proposal outperforms state-of-the-art algorithms on the majority of the problems.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
ppsn2014.pdf
non disponibili
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
234.82 kB
Formato
Adobe PDF
|
234.82 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
ppsn2014_preprint.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
331.51 kB
Formato
Adobe PDF
|
331.51 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.