A new mutation operator, called Mijn, 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 Mijn. 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 Mijn operator.
The Effectiveness of co-mutation in evolutionary algorithms: The Mijn operator
I De Falco;A Iazzetta;E Tarantino
1998
Abstract
A new mutation operator, called Mijn, 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 Mijn. 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 Mijn operator.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.