Solving multiobjective optimization problems using an artificial immune system

In this paper, we propose an algorithm based on the clonal selection principle to solve multiobjective optimization problems (either constrained or unconstrained). The proposed approach uses Pareto dominance and feasibility to identify solutions that deserve to be cloned, and uses two types of mutation: uniform mutation is applied to the clones produced and non-uniform mutation is applied to the "not so good" antibodies (which are represented by binary strings that encode the decision variables of the problem to be solved). We also use a secondary (or external) population that stores the nondominated solutions found along the search process. Such secondary population constitutes the elitist mechanism of our approach and it allows it to move towards the true Pareto front of a problem over time. Our approach is compared with three other algorithms that are representative of the state-of-the-art in evolutionary multiobjective optimization. For our comparative study, three metrics are adopted and graphical comparisons with respect to the true Pareto front of each problem are also included. Results indicate that the proposed approach is a viable alternative to solve multiobjective optimization problems.