A memetic algorithm instantiated with selection sort consistently finds global optima for the error-correcting graph isomorphism

We study several tested cases of the error-correcting graph isomorphism problem. The set Sn of n! permutations on n items is the search space for this optimization problem. We apply MA-sorting. This is a memetic algorithm with domain-independent mutation operators based on classical sorting. Each sorting algorithm works on results to a comparison predicate and defines a path in SI.,. In MA-sorting the mutation operator is a local-search that evaluates permutations suggested by the sorting algorithm. When such evaluation results in an improvement, the mutation is accepted and the comparison operator of the sorting algorithm evaluates to true. In contrast with previous proposals, our MA-sorting instantiated with selection sort finds optimal solutions for this case study