Access the full text.
Sign up today, get DeepDyve free for 14 days.
Himanshu Jain, K. Deb (2014)
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive ApproachIEEE Transactions on Evolutionary Computation, 18
L. While, L. Bradstreet, L. Barone, P. Hingston (2005)
Heuristics for optimizing the calculation of hypervolume for multi-objective optimization problems2005 IEEE Congress on Evolutionary Computation, 3
D. Groggel (1972)
Practical Nonparametric StatisticsTechnometrics, 42
S. Yeung, K. Man (2011)
Multiobjective OptimizationIEEE Microwave Magazine, 12
J. Bader (2010)
Hypervolume-based search for multiobjective optimization: Theory and methods
N. Beume, G. Rudolph (2009)
S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure ProblemEvolutionary Computation, 17
E. Zitzler, M. Laumanns, L. Thiele (2001)
SPEA2: Improving the strength pareto evolutionary algorithm, 103
H. Freire, Paulo Oliveira, E. Pires (2017)
From single to many-objective PID controller design using particle swarm optimizationInternational Journal of Control, Automation and Systems, 15
S. Tanwar, D. Khatod (2017)
Techno-economic and environmental approach for optimal placement and sizing of renewable DGs in distribution systemEnergy, 127
C. Coello, G. Lamont, D. Veldhuizen (2006)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Vivek Patel, V. Savsani, A. Mudgal (2017)
Many-objective thermodynamic optimization of Stirling heat engineEnergy, 125
N. Beume, B. Naujoks, M. Emmerich (2007)
SMS-EMOA: Multiobjective selection based on dominated hypervolumeEur. J. Oper. Res., 181
N. Srinivas, K. Deb (1994)
Muiltiobjective Optimization Using Nondominated Sorting in Genetic AlgorithmsEvolutionary Computation, 2
J. Bader, E. Zitzler (2011)
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective OptimizationEvolutionary Computation, 19
D. Fogel (1997)
Evolutionary algorithms in theory and practiceComplex., 2
K. Deb, S. Jain (2002)
Running performance metrics for evolutionary multi-objective optimizations
M.P. Hansen, A. Jaszkiewicz (1998)
Evaluating the quality of approximations to the non-dominated set, technical report
E. Zitzler, D. Brockhoff, L. Thiele (2007)
The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration
Qingfu Zhang, Hui Li (2007)
MOEA/D: A Multiobjective Evolutionary Algorithm Based on DecompositionIEEE Transactions on Evolutionary Computation, 11
S. Huband, Edith Cowan, P. Hingston (2006)
A review of multiobjective test problems and a scalable test problem toolkitIEEE Transactions on Evolutionary Computation, 10
E. Zitzler, L. Thiele, M. Laumanns, C. Fonseca, V. Fonseca (2003)
Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Trans. Evol. Comput., 7
D. Brockhoff, Tobias Wagner, H. Trautmann (2015)
2 Indicator-Based Multiobjective SearchEvolutionary Computation, 23
K. Deb, S. Agrawal, Amrit Pratap, T. Meyarivan (2002)
A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Trans. Evol. Comput., 6
Joshua Knowles, L. Thiele, E. Zitzler (2006)
A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers
K. Deb, S. Jain (2002)
Running performance metrics for evolutionary multiobjective optimization, technical report
H. Ishibuchi, Noritaka Tsukamoto, Y. Nojima (2008)
Evolutionary many-objective optimization: A short review2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
E. Zitzler, S. Künzli (2004)
Indicator-Based Selection in Multiobjective Search
H. Trautmann, Tobias Wagner, D. Biermann, C. Weihs (2013)
Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability IndexJournal of Multi-criteria Decision Analysis, 20
Xiufen Zou, Yu Chen, Minzhong Liu, Lishan Kang (2008)
A New Evolutionary Algorithm for Solving Many-Objective Optimization ProblemsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 38
Luis Martí, Eduardo Segredo, Nayat Pi, E. Hart (2017)
Impact of selection methods on the diversity of many-objective Pareto set approximations
C. Fonseca, L. Paquete, Manuel López-Ibáñez (2006)
An Improved Dimension-Sweep Algorithm for the Hypervolume Indicator2006 IEEE International Conference on Evolutionary Computation
Ling Yang, Yuyang Guan, Weiguo Sheng (2017)
A novel dynamic crowding distance based diversity maintenance strategy for MOEAs2017 International Conference on Machine Learning and Cybernetics (ICMLC), 1
Yiping Liu, D. Gong, Jing Sun, Yaochu Jin (2017)
A Many-Objective Evolutionary Algorithm Using A One-by-One Selection StrategyIEEE Transactions on Cybernetics, 47
E. Zitzler, L. Thiele, J. Bader (2010)
On Set-Based Multiobjective OptimizationIEEE Transactions on Evolutionary Computation, 14
M. Li, Shengxiang Yang, Xiaohui Liu (2014)
Diversity Comparison of Pareto Front Approximations in Many-Objective OptimizationIEEE Transactions on Cybernetics, 44
M. Hansen, A. Jaszkiewicz (1998)
Evaluating the quality of approximations to the non-dominated set
L. While, P. Hingston (2006)
A faster algorithm for calculating hypervolumeIEEE Transactions on Evolutionary Computation, 10
G. Meza, Xavier Ferragud, Javier Sáez, Juan Durá (2017)
Multiobjective Optimization Design Procedure for an Aircraft’s Flight Control System
J. Branke, K. Deb, K. Miettinen, R. Słowiński (2008)
Multiobjective Optimization, 5252
J. Bader, E. Zitzler (2008)
HypE: an algorithm for fast hypervolume-based many-objective optimization, TIK report 286
Hiroyuki Sato, H. Aguirre, Kiyoshi Tanaka (2011)
Improved S-CDAs using crossover controlling the number of crossed genes for many-objective optimization
M. Fleischer (2003)
The Measure of Pareto Optima
E. Zitzler, K. Deb, L. Thiele (1999)
Comparison of Multiobjective Evolutionary Algorithms on Test Functions of Different Difficulty
Shengxiang Yang, M. Li, Xiaohui Liu, Jinhua Zheng (2013)
A Grid-Based Evolutionary Algorithm for Many-Objective OptimizationIEEE Transactions on Evolutionary Computation, 17
W. Kruskal, W. Wallis (1952)
Use of Ranks in One-Criterion Variance AnalysisJournal of the American Statistical Association, 47
Shouyong Jiang, Shengxiang Yang (2016)
Convergence Versus Diversity in Multiobjective Optimization
Joshua Knowles (2002)
Local-search and hybrid evolutionary algorithms for Pareto optimization
K. Bringmann, T. Friedrich (2008)
Approximating the volume of unions and intersections of high-dimensional geometric objectsComput. Geom., 43
T. Obremski (1981)
Practical Nonparametric Statistics (2nd ed.)Technometrics, 23
S. Huband, L. Barone, L. While, P. Hingston (2005)
A Scalable Multi-objective Test Problem Toolkit
E. Zitzler, M. Laumanns, L. Thiele, C. Fonseca, V. Fonseca (2002)
Why Quality Assessment Of Multiobjective Optimizers Is Difficult
One of the main components of multi-objective, and therefore, many-objective evolutionary algorithms, is the selection mechanism. It is responsible for performing two main tasks simultaneously. First, it has to promote convergence by selecting solutions which are as close as possible to the Pareto optimal set. And second, it has to promote diversity in the solution set provided. In the current work, an exhaustive study that involves the comparison of several selection mechanisms with different features is performed. Particularly, Pareto-based and indicator-based selection schemes, which belong to well-known multi-objective optimisers, are considered. The paper aims to discuss these issues.Design/methodology/approachEach of those mechanisms is incorporated into a common multi-objective evolutionary algorithm framework. The main goal of the study is to measure the diversity preserved by each of those selection methods when addressing many-objective optimisation problems. The Walking Fish Group test suite, a set of optimisation problems with a scalable number of objective functions, is taken into account to perform the experimental evaluation.FindingsThe computational results highlight that the the reference-point-based selection scheme of the Non-dominated Sorting Genetic Algorithm III and a modified version of the Non-dominated Sorting Genetic Algorithm II, where the crowding distance is replaced by the Euclidean distance, are able to provide the best performance, not only in terms of diversity preservation, but also in terms of convergence.Originality/valueThe performance provided by the use of the Euclidean distance as part of the selection scheme indicates this is a promising line of research and, to the best of the knowledge, it has not been investigated yet.
Data Technologies and Applications – Emerald Publishing
Published: Oct 4, 2018
Keywords: Convergence; Diversity preservation; Many-objective optimisation; Multi-objective evolutionary algorithm; Selection mechanism; Walking Fish Group (WFG) test suite
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.