Department of Computer Science
T-MOEA/D: MOEA/D with objective transform in multi-objective problems
To approximate the Pareto optimal solutions of a multi-objective optimization problem, Zhang and Li  have recently developed a novel multi-objective evolutionary algorithm based on decomposition (MOEA/D). It can work well if the curve shape of the Pareto-optimal front is friendly. Otherwise, it might fail. In this paper, we propose an improved MOEA/D algorithm (denoted as TMOEA/D), which utilizes a monotonic increasing function to transform each individual objective function into the one so that the curve shape of the non-dominant solutions of the transformed multi-objective problem is close to the hyper-plane whose intercept of coordinate axes is equal to one in the original objective function space. Consequently, we can approximate the Pareto optimal solutions that are uniformly distributed over the Pareto front using the advanced decomposition technique of MOEA/D. Numerical results show that the proposed algorithm has a good performance. © 2010 IEEE.
Evolutionary algorithm, Multi-objective optimization, Pareto front, Uniformly distribution
Source Publication Title
Proceedings: 2010 International Conference of Information Science and Management Engineering
Link to Publisher's Edition
Liu, H., Gu, F., & Cheung, Y. (2010). T-MOEA/D: MOEA/D with objective transform in multi-objective problems. Proceedings: 2010 International Conference of Information Science and Management Engineering, 282-285. https://doi.org/10.1109/ISME.2010.274