The effectiveness of co-mutation in evolutionary algorithms: the /spl Mscr//sub ijn/ operator
Ivanoe De Falco, A. lazzetta, Ernesto Tarantino, Antonio Della Cioppa · 2002
A new mutation operator, designated /spl Mscr//sub ijn/, which is capable of operating on a set of adjacent bits in one single step, is introduced. Its properties are examined and compared against those of the bit-flip mutation. A simple evolutionary algorithm is described which is based only on selection and /spl Mscr//sub ijn/. This algorithm is used for the optimization of a well-known problem testbed, and its performance is compared against that offered by both a classical genetic algorithm and a more sophisticated one. The obtained results prove the effectiveness of the /spl Mscr//sub ijn/ operator.