Deductive sort and climbing sort: New methods for non-dominated sorting

Evolutionary Computation

Volumn 20, Issue 1, 2012, Pages 1-26

  McClymont, Kent ^a   Keedwell, Ed ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

Evolution strategies; Genetic algorithms; Non dominated sorting; Pareto front; Pareto optimal

Indexed keywords

EVOLUTION STRATEGIES; FUTURE GENERATIONS; LARGE POPULATION; NON-DOMINATED SORTING; NSGA-II; OPTIMISATIONS; PARETO FRONT; PARETO-OPTIMAL; RESEARCH FIELDS;

GENETIC ALGORITHMS; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; CLASSIFICATION; COMPUTER PROGRAM; COMPUTER SIMULATION; EVOLUTION; LOGIC; THEORETICAL MODEL;

ALGORITHMS; BIOLOGICAL EVOLUTION; CLASSIFICATION; COMPUTER SIMULATION; LOGIC; MODELS, THEORETICAL; SOFTWARE;

EID: 84857588189     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00041     Document Type: Article

References (25)

1. Coello Coello, C. A. (1999). A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowledge and Information Systems, 1:269-308.
2. Coello Coello, C. A., Lamont, G. B., and Van Veldhuizen, D. A. (2007). Evolutionary algorithms for solving multi-objective problems, 2nd ed. New York: Springer.
3. Corne, D. W., Knowles, J. D., and Oates, M. J. (2000). The Pareto envelope-based selection algorithm for multiobjective optimization. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H. P. Schwefel (Eds.), Parallel problem solving from nature. Lecture notes in computer science, Vol. 1917 (pp. 839-848). Berlin: Springer.
4. Deb, K. (2000). An efficient constraint handlingmethod for genetic algorithms. ComputerMethods in Applied Mechanics and Engineering, 186(2-4):311-338.
5. Deb, K. (2001). Multi-objective optimization using evolutionary algorithms. New York:Wiley.
6. Deb, K., Agrawal, S., Pratab, A., and Meyarivan, T. (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H. P. Schwefel (Eds.), Parallel problem solving from nature. Lecture notes in computer science, Vol. 1917 (pp. 849-858). Berlin: Springer.
7. Deb, K., Mohan, M., and Mishra, S. (2003). A fast multi-objective evolutionary algorithm for finding well-spread pareto-optimal solutions. Technical Report 2003002, Indian Institute of Technology, Kanpur.
8. Deb, K., and Tiwari, S. (2005). Omni-optimizer: A procedure for single and multi-objective optimization. In C. A. Coello Coello, A. Hernández Aguirre, and E. Zitzler (Eds.), Evolutionary multi-criterion optimization. Lecture notes in computer science, Vol. 3410 (pp. 47-61). Berlin: Springer.
9. Everson, R. M., Fieldsend, J. E., and Singh, S. (2002). Full elite sets for multi-objective optimisation. In Proceedings of the Fifth International Conference on Adaptive Computing in Design and Manufacture (ACDM 2002), Vol. 5, pp. 343-354.
10. Fonseca, C. M., and Fleming, P. J. (1993). Genetic algorithms for multiobjective optimization: formulation, discussion and generalization. In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 416-423.
11. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley.
12. Horn, J., Nafpliotis, N., and Goldberg, D. E. (1994). A niched pareto genetic algorithm for multiobjective optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Vol. 1, pp. 82-87.
13. Jensen, M. T. (2003). Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. IEEE Transactions on Evolutionary Computation, 7(5):503-515.
14. Knowles, J. D. (2006). ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Transactions on Evolutionary Computation, 10(1):50-66.
15. Knowles, J. D., and Corne, D. W. (1999). The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimisation. In 1999 Congress on Evolutionary Computation, pp. 98-105.
16. Kukkonen, S., and Lampinen, J. (2005). GDE3: The third evolution step of generalized differential evolution. Technical Report 2005013, Indian Institute of Technology, Kanpur.
17. Kung, H. T., Luccio, F., and Preparata, F. P. (1975). On finding the maxima of a set of vectors. Journal of the ACM, 22:469-476.
18. Laumanns, M., Thiele, L., Deb, K., and Zitzler, E. (2002). Combining convergence and diversity in evolutionary multi-objective optimization. Evolutionary Computation, 10(3):263-282.
19. Schaffer, J. D. (1984). Multiple objective optimization with vector evaluated genetic algorithms. PhD thesis, Vanderbilt University.
20. Schaffer, J. D., and Grefenstette, J. J. (1985). Multiobjective learning via genetic algorithms. In Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), pp. 593-595.
21. Srinivas, N., and Deb, K. (1994). Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation, 2(3):221-248.
22. Yukish, M. A. (2004). Algorithms to identify Pareto points in multi-dimensional data sets. PhD thesis, College of Engineering, Pennsylvania State University, University Park.
23. Zitzler, E., Deb, K., and Thiele, L. (2000). Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8:173-195.
24. Zitzler, E., Laumanns, M., and Thiele, L. (2002). SPEA2: Improving the strength Pareto evolutionary algorithm. In K. Giannakoglou, D. Tsahalis, J. Periaux, P. Papailou, and T. Fogarty (Eds.), EUROGEN 2001. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, pp. 95-100.
25. Zitzler, E., and Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271.