Genetic algorithms for word problems in partially commutative groups

  • Authors:
  • Matthew J. Craven

  • Affiliations:
  • Mathematical Sciences, University of Exeter, Exeter, UK

  • Venue:
  • EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial optimisation. We obtain a method applicable to a wide range of problems and give results which indicate good behaviour of the genetic algorithm, hinting at the presence of a new deterministic solution and a framework for further results.