Multiobjective evolutionary algorithm based on mixture Gaussian models

被引：0
作者：
Zhou, Ai-Min [1 ]
Zhang, Qing-Fu [2 ]
Zhang, Gui-Xu [1 ]
机构：
[1] Department of Computer Science and Technology, East China Normal University
[2] School of Computer Science and Electronic Engineering, University of Essex
来源：
Ruan Jian Xue Bao/Journal of Software | 2014年 / 25卷 / 05期
关键词：
Evolutionary algorithm; Mixture Gaussian probability model; MOEA/D; Multiobjective optimization;
D O I：
10.13328/j.cnki.jos.004514
中图分类号：
学科分类号：
摘要：
Recombination operators used in most current multiobjective evolutionary algorithms (MOEAs) were originally designed for single objective optimization. This paper demonstrates that some widely used recombination operators may not work well for multiobjective optimization problems (MOPs), and proposes a multiobjective evolutionary algorithm based on decomposition and mixture Gaussian models (MOEA/D-MG). In the algorithm, a reproduction operator based on mixture Gaussian models is used to model the population distribution and sample new trails solutions, and a greedy replacement scheme is then applied to update the population by the new trial solutions. MOEA/D-MG is applied to a variety of test instances with complicated Pareto fronts. The extensive experimental results indicate that MOEA/D-MG is promising for dealing with these continuous MOPs. © Copyright 2014, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：913 / 928
页数：15
相关论文
共 44 条
  • [1] Miettinen K., Nonlinear Multiobjective Optimization, (1999)
  • [2] Schaffer J.D., Multiple objective optimization with vector valuated genetic algorithms, Proc. of the 1st Int'l Conf. on Genetic Algorithms, pp. 93-100, (1985)
  • [3] Deb K., Multi-Objective Optimization Using Evolutionary Algorithms, (2001)
  • [4] Coello Coello C.A., An updated survey of GA-based multiobjective optimization techniques, ACM Computing Surveys, 32, 2, pp. 109-143, (2000)
  • [5] Zhou A., Qu B.Y., Li H., Zhao S.Z., Suganthan P.N., Zhang Q., Multiobjective evolutionary algorithms: A survey of the state of the art, Swarm and Evolutionary Computation, 1, 1, pp. 32-49, (2011)
  • [6] Deb K., Pratap A., Agarwal S., Meyarivan T., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. on Evolutionary Computation, 6, 2, pp. 182-197, (2002)
  • [7] Zitzler E., Laumanns M., Thiele L., SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization, Proc. of the Evolutionary Methods for Design, Optimisation and Control, pp. 95-100, (2002)
  • [8] Knowles J.D., Corne D.W., Approximating the nondominated front using the Pareto archived evolution strategy, Evolutionary Computation, 8, 2, pp. 149-172
  • [9] Zitzler E., Kunzli S., Indicator-Based selection in multiobjective search, Proc. of the Parallel Problem Solving from Nature (PPSN VIII), pp. 832-842, (2004)
  • [10] Bader J., Zitzler E., HypE: An algorithm for fast hypervolume-based many-objective optimization, Evolutionary Computation, 19, 1, pp. 45-76, (2011)
12345