Pareto Artificial Life Algorithm for Multi-Objective Optimization

Multi-Objective Optimization Problems

A MOP is defined as a problem which has two or more objective functions. A general MOP is defined asMinimize (1) subject to (2), (3) where fi(x) is the set of k objective functions, ci(x) is the set of m constraints, xj is the n optimization parameters, and S ∈ Rn is the solution or parameter space. Obtainable objective vectors {F(x)|x ∈ S} are denoted as Y, where Y ∈ Rk is usually referred to the attribute space.