Simple Population Replacement Strategies for a Steady-State Multi-objective Evolutionary Algorithm
暂无分享,去创建一个
[1] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[2] Christine L. Mumford-Valenzuela. A Simple Approach to Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.
[3] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .
[4] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[5] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[6] Marco Laumanns,et al. SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .
[7] Kalyanmoy Deb,et al. A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.
[8] Christine L. Mumford,et al. Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[9] C. L. Valenzuela. A simple evolutionary algorithm for multi-objective optimization (SEAMO) , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[10] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[11] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.
[12] Martin J. Oates,et al. The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.