A Comparison of Memetic Recombination Operators for the MinLA Problem

Abstract

Abstract. In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Crossover (TX) is introduced and its performance is compared with four previous crossover operators. It is shown that the TX crossover induces a better population diversity. The MA using TX is evaluated on a set of wellknown benchmark instances and is compared with several state-of-art MinLA algorithms.