A multi-objective genetic algorithm based on quick sort

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3060, Issue , 2014, Pages 175-186

  Zheng, Jinhua ^a,c   Ling, Charles ^b   Shi, Zhongzhi ^c   Xue, Juan ^a   Li, Xuyong ^a  

^a XIANGTAN UNIVERSITY   (China)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; PARETO PRINCIPLE;

BENCH-MARK PROBLEMS; EVOLUTIONARY POPULATION; MULTI OBJECTIVE; MULTI-OBJECTIVE GENETIC ALGORITHM; OPTIMAL PROBLEMS; PARETO OPTIMA; QUICK SORTS; TIME COMPLEXITY;

ALGORITHMS;

EID: 7444265461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24840-8_13     Document Type: Conference Paper

References (15)

1. Kalyanmoy Deb. Evolutionary Algorithms for Multi-Criterion Optimization in Engineering Design, In Kaisa Miettinen, Marko M. Mäkelä, Pekka Neittaanmäki, and Jacques Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, chapter 8, pages 135-161. John Wiley & Sons, Ltd, Chichester, UK, 1999.
2. Deb K., Agrawal S., Pratap A., & Meyarivan T. (2000). A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. KanGAL Report No. 200001.
3. Deb, K and Jain, S. (May, 2002). Running performance metrics for evolutionary multi-objective optimization. Kangal Report No. 2002004.
4. Kalyanmoy Deb, Amrit Pratap, Sameer Agrawal and T. Meyrivan. A Fast and Elitist Multi-objective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2): 182-197, April 2002.
5. Deb, K, Mohan, M. and Mishra, S. (February, 2003). A Fast Multi-objective Evolutionary Algorithm for Finding Well-Spread Pareto-Optimal Solutions. KanGAL Report No. 2003002.
6. Carlos M. Fonseca and Peter J. Fleming. Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization, In Stephanie Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 416-423, San Mateo, California, 1993. University of Illinois at Urbana-Champaign, Morgan Kauffman Publishers.
7. D. E. Goldberg. Genetic algorithms for search, optimization, and machine learning. Reading, MA: Addison-Wesley, 1989.
8. Goldberg, D. E. and Deb, K. (1991). A comparison of selection schemes used in genetic algorithms, Foundations of Genetic Algorithms, 69-93.
9. Jeffrey Horn and Nicholas Nafpliotis. Multiobjective Optimization using the Niched Pareto Genetic Algorithm, Technical Report IlliGAl Report 93005, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA, 1993.
10. Horn J., Nafpliotis N., & Goldberg D. E. (1994). A Niched Pareto genetic Algorithm for Multiobjective Optimization. Proceeding of the first IEEE Conference on Evolutionary Computation, 82-87.
11. J. D. Schaffer. Some experiments in machine learning using vector evaluated genetic algorithms. PhD thesis, Vanderbilt University, 1984.
12. V. Khare, X. Yao, and Deb, K. (October, 2002). Performance Scaling of Multi-objective Evolutionary Algorithms. Kangal Report No. 2002009.
13. N. Srinivas and Kalyanmoy Deb. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms, Evolutionary Computation, 2(3): 221-248, Fall 1994.
14. Zitzler, E. and L. Thiele (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation.
15. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. EUROGEN 2001 - Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, September 2001, to appear.