Many-objective differential evolution optimization based on reference points: NSDE-R
- 104 Downloads
Design methodologies of today require the solution of several many-objective optimization problems. The last two decades have seen a surge in several algorithms capable of solving multi-objective optimization problems. It was only in the past 5 years that new algorithms capable of coping with a large number of objectives have been introduced. This work presents a new differential evolution algorithm (NSDE-R) capable of efficiently solving many-objective optimization problems. The algorithms make use of reference points evenly distributed through the objective function space to preserve diversity and aid in multi-criteria-decision-making. The proposed NSDE-R was applied to test problems from the DTLZ and WFG suite, having three to 15 objectives. Two mutation donor operators were investigated for their ability to converge to the analytical Pareto front while maintaining diversity. The ability of NSDE-R to converge to a user-specified region of the Pareto front is also investigated. The proposed NSDE-R algorithm has shown to have a higher rate of convergence and better convergence to the analytical Pareto front.
KeywordsEvolutionary computation Differential evolution Many-objective optimization Non-dominated sorting NSDE-R Reference points
The first author gratefully acknowledges the financial support from Florida International University in the form of an FIU Presidential Fellowship and FIU Dissertation Year Fellowship. The authors are grateful for the research funding provided by the grant NSF CBET-1642253 monitored by Dr. Jose Lage, U.S. Army for the equipment grant W911NF-16-1-0494, and NASA grant NNX17AJ96A via TAMU.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- Chikumbo O, Goodman E, Deb K (2012) Approximating a multi- dimensional Pareto front for a land use management problem: a modified MOEA with an epigenetic silencing metaphor. Proc CEC:1–8Google Scholar
- Das S, Abraham A, Konar A, Liu Y, Sun A, Loh H et al (2008) Particle swarm optimization and differential evolution algorithms: technical analysis, applications and hybridization perspectives. In: Advances of Computational Intelligence in Industrial Systems, vol 116. Springer, Berlin / Heidelberg, pp 1–38Google Scholar
- Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inform 26:30–45Google Scholar
- Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. In: Abraham A, Jain L, Goldberg R (eds) Evolutionary Multiobjective Optimization, series on advanced information and knowledge processing. Springer, London, pp 105–145CrossRefGoogle Scholar
- Denysiuk R, Costa L, Santo IE (2013) Many-objective optimization using differential evolution with variable-wise mutation restriction. In: Proceedings of the GECCO’13, pp 591–598Google Scholar
- Konar A, Chakraborty UK, Das S Two improved differential evolution schemes for faster global search. In: Beyer H-G (ed) Proceedings of the 2005 Conference on Genetic and Evolutionary Computaton (GECCO '05). ACM, New York, pp 991–998Google Scholar
- X. Liao, Q. Li, Q, Zhang and X. Yang, “Multiobjective optimization for crash safety design of vehicle using stepwise regression model,” Struct Multidiscip Optim, vol. 35, No. 6, pp. 561–569, 2008Google Scholar
- Storn R, Price K (1997) Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim:341–359Google Scholar
- Wyss GD, Jorgensen KH (1998) “A user’s guide to LHS- Sandia’s latin hypercube sampling software,” Sandia National Labs, Rept. SAND98–0210, Albuquerque, NMGoogle Scholar
- Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. In: Proc. 8th Int Conf Parallel Problem Solving from Nature, pp 832–842Google Scholar