conditional probability mutation in lzwga
LZWGA is an algorithm that combines LZW compression algorithm with genetic algorithm (GA). An LZWGA chromosome can be decompressed to a GA binary-string chromosome. In this paper, we propose a new mutation operator for LZWGA called conditional probability mutation (CPM). In contrast to original LZWGA mutation which randomly changes some values in an individual, CPM takes advantage of the relationship between gene positions. We compare the performance of LZWGA with original mutation and LZWGA with CPM on non random and random version of standard benchmark problems. Furthermore, we vary mutation rate to see its effect in the performance. The experimental results show that our proposed mutation outperforms original LZWGA mutation in non random problems.
compression mutation method evolutionary algorithms estimation of distribution algorithm lempel-ziv-welch algorithm