Multi-objective Evolutionary Programming without Non-domination Sorting is up to Twenty Times Faster


Abstract

In this paper, Multi-objective evolutionary programming (MOEP) using fuzzy rank-sum with diversified selection is introduced. The performances of this algorithm as well as MOEP with non-domination sorting on the set of benchmark functions provided for CEC2009 Special Session and competition on Multi-objective Optimization are reported. With this rank-sum sorting and diversified selection, the speed of the algorithm has increased significantly, in particular by about twenty times on five objective problems when compared with the implementation using the non-domination sorting. Beside this, the proposed approach has performed either comparable or better than the MOEP with non-domination sorting.