Linear Ordering Optimization with a Combinatorial Differential Evolution

Abstract

In this work, the Linear Ordering Problem (LOP) has been approached using 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 combinatorial Differential Evolution scheme designed by exploiting the group structure of the LOP solutions in order to mimic the classical Differential Evolution behavior observed in continuous spaces. In particular, the proposed differential mutation operator allows to obtain both scaled and extended differences among LOP solutions represented by permutations. The performances have been evaluated over widely known LOP benchmark suites and have been compared to the state-of-the-art results.