Abstract
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.
Similar content being viewed by others
References
Bader J, Zitzler E (2011a) HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76
Bader J, Zitzler E (2011b) HyPE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76
Bosman P, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174–188
Chankong V, Haimes YY (1983) Multiobjective decision making theory and methodology. North-Holland, New York
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–8
Coello Coello CA, Lamont GB (2004) Applications of multi-objective evolutionary algorithms. World Scientific, Singapore
Das S, Dennis JE (1998) Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8:631–657
Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31
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–38
Deb K, Agrawal RB (1994) Simulated binary crossover for continuous search space. Complex Syst 9:1–34
Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inform 26:30–45
Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
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–145
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–598
Fan H, Liu J, Lampinen J (2010) Some improvement to the mutation donor of differential evolution. Eng Comput 27:225–242
Figueiredo EMN, Ludermir TB, Bastos-Filho CJA (2016) Many objective particle swarm optimization. Inf Sci 374:115–134
He X, Dai C, Chen Z (2014) Many-objective optimization using adaptive differential evolution with a new ranking method. Math Probl Eng 2014:1–8
Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10(5):477–506
Inclan EJ, Dulikravich GS (2017) Demonstration of effective global optimization techniques via comparative analysis on a large analytical problem set. Struct Multidiscp Optim 55(1):179–204
Jiang S, Yang S (2017) A strength Pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization. IEEE Trans Evol Comput 21(3):329–346
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–998
Li K, Deb K, Zhang Q, Kwong S (2015) An evolutionary many- objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694–716
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, 2008
Pedersen ME (2012) “Good parameters for differential evolution,” Magnus Erik Hvass Pedersen. Retrieved 2 2012, from Hvass Labs: http://www.hvass- labs.org/people/magnus/publications.php. Accessed 26 March 2018
Robic T, Filipic B (2005) DEMO: differential evolution for multi- objective optimization. In: Proc. 3rd Int. Conf. Evol. Multi-Criterion Optimization, LNCS 3410, pp 520–533
Storn R, Price K (1997) Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim:341–359
While RL, Bradstreet L, Barone L (2012) A fast way of calculating exact hypervolumes. IEEE Trans Evol Comput 16(1):86–95
Wyss GD, Jorgensen KH (1998) “A user’s guide to LHS- Sandia’s latin hypercube sampling software,” Sandia National Labs, Rept. SAND98–0210, Albuquerque, NM
Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. In: Proc. 8th Int Conf Parallel Problem Solving from Nature, pp 832–842
Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans- Actions Evol Comput 3(4):257–271
Funding
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.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Responsible Editor: Mehmet Polat Saka
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Reddy, S.R., Dulikravich, G.S. Many-objective differential evolution optimization based on reference points: NSDE-R. Struct Multidisc Optim 60, 1455–1473 (2019). https://doi.org/10.1007/s00158-019-02272-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00158-019-02272-0