Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Evolutionary Computation
Multi-objective test problems, linkages, and evolutionary methodologies
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Evolutionary Computation
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Properties of an adaptive archiving algorithm for storing nondominated vectors
IEEE Transactions on Evolutionary Computation
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
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.