A decomposition-based evolutionary algorithm with adaptive weight adjustment for many-objective problems
- 42 Downloads
For many-objective optimization problems (MaOPs), how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition-based evolutionary algorithm with adaptive weight adjustment is designed to obtain this goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and an adaptive weight adjustment is used to solve some MaOPs with complex Pareto optimal front (PF) (i.e., PF with a sharp peak of low tail or discontinuous PF). A selection strategy is used to help solutions to converge to the Pareto optimal solutions. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on some benchmark functions, the proposed algorithm is able to find more accurate Pareto front with better diversity.
KeywordsEvolutionary algorithm Many-objective optimization Adaptive weight adjustment
This work was supported by National Natural Science Foundations of China (Nos. 61502290, 61401263, 61672334 and 61673251), China Postdoctoral Science Foundation (No. 2015M582606), Fundamental Research Funds for the Central Universities (No. GK201603094 and No. GK201603002) and Natural Science Basic Research Plan in Shaanxi Province of China (Nos. 2016JQ6045 and 2015JQ6228).
Compliance with ethical standards
Conflict of interest
The authors have declared that no conflict of interest exists.
- Asafuddoula M, Singh HK, Ray T (2017) An enhanced decomposition-based evolutionary algorithm with adaptive reference vectors. IEEE Trans Cybern 48(8):2321–2334Google Scholar
- Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. In: Congress on evolutionary computation (CEC 2002), pp 825–830Google Scholar
- Friedrich T, Horoba C, Neumann F (2009) Multiplicative approximations and the hypervolume indicator. In: Proceedings of the 2009 genetic and evolutionary computation conference, pp 571–578Google Scholar
- Hughes EJ (2005) Evolutionary many-objective optimisation: many once or one many. In: IEEE congress on evolutionary computation (CEC’05), Edinburgh, UK, vol 1, pp 222–227Google Scholar
- Robert S, Torrie J, Dickey D (1997) Principles and procedures of statistics: a biometrical approach. McGraw-Hill, New YorkGoogle Scholar
- Sato H, Aguirre HE, Tanaka K (2007) Controlling dominance area of solutions and its impact on the performance of mOEAs. In: Obayashi S, Poloni C, Hiroyasu T, Murata T (eds) EMO 2007. LNCS, vol 4403. Springer, Heidelberg, pp 5–20Google Scholar
- Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Air Force Institute of Technology, Wright Patterson AFBGoogle Scholar
- Wagner T, Beume N, Naujoks B (2007) Pareto-, aggregation-, and indicator-based methods in many-objective optimization. Lecture notes in computer science 4403: evolutionary multi-criterion optimization—EMO 2007. Springer, Berlin, pp 742–756Google Scholar