Open Access
2014 A New Multiobjective Evolutionary Algorithm Based on Decomposition of the Objective Space for Multiobjective Optimization
Cai Dai, Yuping Wang
J. Appl. Math. 2014: 1-9 (2014). DOI: 10.1155/2014/906147

Abstract

In order to well maintain the diversity of obtained solutions, a new multiobjective evolutionary algorithm based on decomposition of the objective space for multiobjective optimization problems (MOPs) is designed. In order to achieve the goal, the objective space of a MOP is decomposed into a set of subobjective spaces by a set of direction vectors. In the evolutionary process, each subobjective space has a solution, even if it is not a Pareto optimal solution. In such a way, the diversity of obtained solutions can be maintained, which is critical for solving some MOPs. In addition, if a solution is dominated by other solutions, the solution can generate more new solutions than those solutions, which makes the solution of each subobjective space converge to the optimal solutions as far as possible. Experimental studies have been conducted to compare this proposed algorithm with classic MOEA/D and NSGAII. Simulation results on six multiobjective benchmark functions show that the proposed algorithm is able to obtain better diversity and more evenly distributed Pareto front than the other two algorithms.

Citation

Download Citation

Cai Dai. Yuping Wang. "A New Multiobjective Evolutionary Algorithm Based on Decomposition of the Objective Space for Multiobjective Optimization." J. Appl. Math. 2014 1 - 9, 2014. https://doi.org/10.1155/2014/906147

Information

Published: 2014
First available in Project Euclid: 26 March 2014

zbMATH: 07010792
MathSciNet: MR3166794
Digital Object Identifier: 10.1155/2014/906147

Rights: Copyright © 2014 Hindawi

Vol.2014 • 2014
Back to Top