Implement the Group Leader Optimisation Algorithm (GLOA)

The GLOA algorithm (https://arxiv.org/abs/1004.2242) is a genetic algorithm that can be used to find a decomposition of a given unitary in terms of standard gates. I could not find any articles about its characteristics (convergence, compute time, is it interesting in high dimensions?) and the algorithm might be interesting to speed-up the Solovay-Kitaev implementation for larger dimensions.