In this paper we propose new mutation and replacement operators
that enable MuGA to optimize deceptive functions. In subsequent
sections we review MuGA, deceptive functions, new multiset
operators to tackle deceptive problems and the results of the
computational experiments to test the efficiency of these
operators. We conclude with the identification of the strengths and
weaknesses of this new approach and suggest solutions to increase
the success of this algorithm.