暂无分享,去创建一个
[1] Kalyanmoy Deb,et al. An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.
[2] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[3] Hisao Ishibuchi,et al. Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front , 2018, IEEE Transactions on Evolutionary Computation.
[4] R. Lyndon While,et al. A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.
[5] Qingfu Zhang,et al. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.
[6] Hisao Ishibuchi,et al. What is a good direction vector set for the R2-based hypervolume contribution approximation , 2020, GECCO.
[7] Gerhard Nahler,et al. Pearson Correlation Coefficient , 2020, Definitions.
[8] Anne Auger,et al. Theoretically Investigating Optimal µ-Distributions for the Hypervolume Indicator: First Results for Three Objectives , 2010, PPSN.
[9] M. Hansen,et al. Evaluating the quality of approximations to the non-dominated set , 1998 .
[10] Hisao Ishibuchi,et al. A Survey on the Hypervolume Indicator in Evolutionary Multiobjective Optimization , 2021, IEEE Transactions on Evolutionary Computation.
[11] Hisao Ishibuchi,et al. Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes , 2017, IEEE Transactions on Evolutionary Computation.
[12] Tobias Friedrich,et al. Approximating the least hypervolume contributor: NP-hard in general, but fast in practice , 2008, Theor. Comput. Sci..
[13] Nicola Beume,et al. SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..
[14] Marco Laumanns,et al. Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.
[15] Kalyanmoy Deb,et al. Faster Hypervolume-Based Search Using Monte Carlo Sampling , 2008, MCDM.
[16] Kalyanmoy Deb,et al. Generating Uniformly Distributed Points on a Unit Simplex for Evolutionary Many-Objective Optimization , 2019, EMO.
[17] Lucas Bradstreet,et al. Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.
[18] John E. Dennis,et al. Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..
[19] Jie Zhang,et al. A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm , 2015, IEEE Transactions on Cybernetics.
[20] Hisao Ishibuchi,et al. Greedy approximated hypervolume subset selection for many-objective optimization , 2021, GECCO.
[21] Marco Laumanns,et al. Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..
[22] Nicola Beume,et al. An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.
[23] Gary B. Lamont,et al. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .
[24] Jingda Deng,et al. Approximating Hypervolume and Hypervolume Contributions Using Polar Coordinate , 2019, IEEE Transactions on Evolutionary Computation.
[25] H. Ishibuchi,et al. A New Hypervolume-Based Evolutionary Algorithm for Many-Objective Optimization , 2019, IEEE Transactions on Evolutionary Computation.
[26] Carlos M. Fonseca,et al. Greedy Hypervolume Subset Selection in Low Dimensions , 2016, Evolutionary Computation.
[27] Carlos A. Coello Coello,et al. A Study of the Parallelization of a Coevolutionary Multi-objective Evolutionary Algorithm , 2004, MICAI.
[28] Hisao Ishibuchi,et al. R2-Based Hypervolume Contribution Approximation , 2018, IEEE Transactions on Evolutionary Computation.
[29] Eckart Zitzler,et al. HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.
[30] Qguhm -DVNLHZLF,et al. On the performance of multiple objective genetic local search on the 0 / 1 knapsack problem . A comparative experiment , 2000 .
[31] Lucas Bradstreet,et al. A Fast Way of Calculating Exact Hypervolumes , 2012, IEEE Transactions on Evolutionary Computation.