In this paper, we extend a novel unconstrained multiobjective optimization algorithm, so-called multiobjective extremal optimization (MOEO), to solve the constrained multiobjective optimization problems (MOPs). Th...In this paper, we extend a novel unconstrained multiobjective optimization algorithm, so-called multiobjective extremal optimization (MOEO), to solve the constrained multiobjective optimization problems (MOPs). The proposed approach is validated by three constrained benchmark problems and successfully applied to handling three multiobjective engineering design problems reported in literature. Simulation results indicate that the proposed approach is highly competitive with three state-of-the-art multiobjective evolutionary algorithms, i.e., NSGA-11, SPEA2 and PAES. Thus MOEO can be considered a good alternative to solve constrained multiobjective optimization problems.展开更多
基金Project (No.60574063) the National Natural Science Foundation of China
文摘In this paper, we extend a novel unconstrained multiobjective optimization algorithm, so-called multiobjective extremal optimization (MOEO), to solve the constrained multiobjective optimization problems (MOPs). The proposed approach is validated by three constrained benchmark problems and successfully applied to handling three multiobjective engineering design problems reported in literature. Simulation results indicate that the proposed approach is highly competitive with three state-of-the-art multiobjective evolutionary algorithms, i.e., NSGA-11, SPEA2 and PAES. Thus MOEO can be considered a good alternative to solve constrained multiobjective optimization problems.