Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Information Sciences: an International Journal
A fast and elitist multiobjective genetic algorithm: NSGA-II
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 |
Multiobjective optimization problem (MOP) is an important and challenging topic in the fields of industrial design and scientific research. Multi-objective evolutionary algorithm (MOEA) has proved to be one of the most efficient algorithms solving the multiobjective optimization. In this paper, we propose an entropy-based multi-objective evolutionary algorithm with an enhanced elite mechanism (E-MOEA), which improves the convergence and diversity of solution set in MOPs effectively. In this algorithm, an enhanced elite mechanism is applied to guide the direction of the evolution of the population. Specifically, it accelerates the population to approach the true Pareto front at the early stage of the evolution process. A strategy based on entropy is used to maintain the diversity of population when the population is near to the Pareto front. The proposed algorithm is executed on widely used test problems, and the simulated results show that the algorithm has better or comparative performances in convergence and diversity of solutions compared with two state-of-the-art evolutionary algorithms: NSGA-II, SPEA2 and the MOSADE.