On the Design of a Partition Crossover for the Quadratic Assignment Problem

Omar Abdelkafi (1, 2) , Bilel Derbel (1, 2) , Arnaud Liefooghe (1, 2, 3) , Darrell Whitley (4)

1 BONUS - Optimisation de grande taille et calcul large échelle
2 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
3 JFLI - Japanese French Laboratory for Informatics
4 CSU - Colorado State University [Fort Collins]

We conduct a study on the design of a partition crossover for the QAP. On the basis of a bipartite graph representation, we propose to recombine the unshared components from parents, while enabling their fast evaluation using a preprocessing step for objective function decomposition. Besides a formal description and complexity analysis of the proposed crossover, we conduct an empirical analysis on its relative behavior using a number of large-size QAP instances, and a number of baseline crossovers. The proposed operator is shown to have a relatively high intensification ability, while keeping execution time relatively low.

Domaines: Intelligence artificielle [cs.AI]

Omar Abdelkafi, Bilel Derbel, Arnaud Liefooghe, Darrell Whitley. On the Design of a Partition Crossover for the Quadratic Assignment Problem. PPSN 2020 - 16th International Conference on Parallel Problem Solving from Nature, Sep 2020, Leiden, Netherlands. pp.303-316, ⟨10.1007/978-3-030-58112-1_21⟩. ⟨hal-02921919⟩