In this paper we provide a comparative empirical analysis of four different generating sets for the algebraic Differential Evolution for Permutations (DEP) applied to the Traveling Salesman Problem (TSP). In particular, DEP has been extended in order to use the reversal moves as generating set. Two different randomized decomposers are proposed for the reversal generators. The experiments have been conducted on a selected set of commonly adopted TSP instances, and the results show the newly proposed generating set leads to better performances with respect to other three generating sets based on alternative search moves.
File in questo prodotto:
Non ci sono file associati a questo prodotto.