On the Design of a Partition Crossover for the Quadratic Assignment Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

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

Abstract

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.
Fichier principal
Vignette du fichier
abdelkafi_ppsn2020.pdf (493.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02921919 , version 1 (02-03-2023)

Identifiers

Cite

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⟩
96 View
8 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More