Experiments with pseudoperipheral vertex finders for heuristics for bandwidth reduction evolved by an ant colony hyperheuristic approach

This article compares the results of the Diagonal Dominance algorithm with the George-Liu algorithm to find pseudo-peripheral vertices for heuristics for bandwidth reduction evolved by an ant colony optimization hyperheuristic to accelerate the zero-fill incomplete Cholesky-preconditioned conjugate gradient method. The hyperheuristic approach was recently published and evolves low-cost heuristics for bandwidth reduction applied to matrices arising from specific application areas. The results obtained on a set of 13 standard benchmark matrices showed that the George-Liu algorithm dominated the Diagonal Dominance algorithm.