To improve the efficiency of building a non-dominated set in multi-objective evolution algorithm
an approach called Pseudo binary tree's rule is proposed to construct the Pareto optimal solutions. The multi-objective solutions are divided into three types: dominated
non-dominated and irrelevant
based on their natures and comparison results
and then the sorting pseudo binary tree is generated according to the comparison results. An individual in the evolution group is selected in every round of comparison. Then the selected individual is compared with the individuals in the non-dominated set
and those that are dominated are eliminated. If the selected one survives
it replaces the first eliminated individual in the non-dominated set. Repeat the process successively until there is no individual left in
the evolution group
and a sorting pseudo binary tree is generated. It is proved in theory that the non-dominated set obtained by the proposed method is the biggest non-dominated set in the objective evolution group
and the worst time complexity is O(rN
2
/2). Experimental results show that when the number of objects is comparatively large(r≥5)
the efficiency of building the non-dominated set using the pseudo binarytree's rule is obviously higher than that using Deb's algorithm
Jensen's algorithm or arena's principle.
关键词
Keywords
references
SAWARAGI Y, NAKAYAMA H, TANINO T. Theory of multiobjective optimization[M]. New York, USA: Academic Press, 1985.
PARETO V. Cours D' economie politique: I, II [M]. Lausanne,Switzerland: F. Rouge,1896.
CEOLLO C A, VAN VELDHUIZEN D A, LAMOUNT G B. Evolutionary algorithms for solving multi-objective problems [M]. Dordrecht, Netherlands: Kluwer Academic Publishers, 2002.
ATASHKARI K, NARIMAN-ZADEH N, PILECHI A, et al. Thermodynamic Pareto optimization of turbojet engines using multi-objective genetic algorithm [J]. International Journal of Thermal Sciences, 2005,44(11):1061-1071.
YEN G, LU H. Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation [J]. IEEE Trans on Evolutionary Computation, 2003,7(3):253-274.
DEB K, PRATAP A, AGRAWAL S, et al. A fast and elitist multi-objective genetic algorithm: NSGA-II[J]. IEEE Trans on Evolutionary Computation, 2002,6(2):182-197.
DEB K, AGRAWAL S, PRATAB A, et al. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization NSGA-II, KanGAL Report, 200001[R]. Kanpur,India: Indian Institute of Technology, 2000.
JENSEN M T. Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms[J]. IEEE Trans on Evolutionary Computation, 2003,7(5):503-515.
ZHENG Jinhua, JIANG Hao, KUANG Da, et al. An approach of constructing multi-objective pareto optimal solutions using arena's principle[J]. Journal of Software, 2007,18(6):1287-1297.