NONE

With this option we don't use any mutation type.

BINARY

This mutation type selects bits and inverts its with a probability Pm.

10010101110 --> 10000101110

GOTTLIEB-VOSS (only for SAT problem)

This mutation only modifies the clauses don't satisfy. It inverts every bit with a probability Pm.

[Gottlieb-Voss Mutation] for c=0 to N_CLAUSES do                //go round all clauses       if Satisty(Obtain_clause(c)) then           for i=0 to N_LITERALS do      // go round all current literals                change gene according to Pm;      // mutate, if it is necesary           end_for;      end_if; end_for;

 

FLEE MUTATION

This operator substitutes the standard mutation and crossover. First obtains the loser (L) and winner (W) models, and then it try to maximize the difference with the loser model, but this depends on the social strategy.

MARCHIORI_ROSSI (only for SAT problem)

It takes randomly every chromosome variable ,and then, it changes its value. Only, if the change produces more satisfy clauses, it will be maintain. Else, the change will be canceled and the operator will repeat the operation until it improves the results.

[Marchiori-Rossi Mutation] progress=1; while progress>0 do            progress=0;            i=1;          while i< N_VARS do                       change randomly a individual gene;                       calculate the profit obtained;                   if profit>=0 then                           acept the change;                   end_if;                       progress=progress+profit;                       i=i+1;          end_do; end_do;