Abstract

The Pareto set (PS) of real multi-objective optimization problems (MOPs) are often unknown and complex, so, it is significant for multi-objective evolutionary algorithms (MOEAs) to solve complex PS MOPs (CPS_MOPs namely). In this paper, we combined Latin hypercube sampling (LHS) with MOEA, proposed a LHS based MOEA (LHS-MOEA). We suggested two kinds of LHS-MOEA, in which LHS local search and evolutionary operator are combined to handle CPS_MOPs. Through some experiments, the results demonstrate that LHS-MOEA performs much better than the traditional prevalent MOEA — NSGA-II in solving CPS_MOPs.KeywordsMulti-objective Evolutionary AlgorithmLatin Hypercube SamplingComplex Pareto SetLocal SearchEvolutionary Operator

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call