Genetic algorithm for minimisation of fixed polarity Reed-Muller expressions

A genetic algorithm (GA) is developed to find small or minimal fixed polarity Reed-Muller expressions (FPRMs) for large functions. The authors combine the GA with greedy heuristics, i.e. they use hybrid GAs (HGAs). They show by experiments that results superior to all other approaches for large functions can be obtained using GAs. This mainly results from the use of a problem specific data structure and the incorporation of heuristics in the GA