Towards a Quick Computation of Well-Spread Pareto-Optimal Solutions
暂无分享,去创建一个
[1] Kalyanmoy Deb,et al. MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS , 1994 .
[2] Kalyanmoy Deb,et al. Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.
[3] M. Hansen,et al. Evaluating the quality of approximations to the non-dominated set , 1998 .
[4] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[5] David W. Corne,et al. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.
[6] Kalyanmoy Deb,et al. Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.
[7] Marco Laumanns,et al. Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.
[8] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[9] A. Farhang-Mehr,et al. Diversity assessment of Pareto optimal solution sets: an entropy approach , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[10] Marco Laumanns,et al. Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).