Generalizing the improved run-time complexity algorithm for non-dominated sorting

GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference

Volumn , Issue , 2013, Pages 615-622

  Fortin, Félix Antoine ^a   Grenier, Simon ^a   Parizeau, Marc ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

Non dominated sort; Time complexity

Indexed keywords

COMPLEXITY ALGORITHMS; DISCRETE COMBINATORIAL PROBLEMS; FLOATING POINT NUMBERS; NON-DOMINATED SORTING; NON-DOMINATED SORTS; ORDERS OF MAGNITUDE; PROBLEM SIZE; TIME COMPLEXITY;

EVOLUTIONARY ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 84883095611     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463372.2463454     Document Type: Conference Paper

References (16)

1. H. Abbass, R. Sarker, and C. Newton. PDE: A pareto-frontier differential evolution approach for multi-objective optimization problems. In Proceedings of the 2001 Congress on Evolutionary Computation, volume 2, pages 971-978, 2001.
2. J. L. Bentley. Multidimensional divide-and-conquer. Commun. ACM, 23(4):214-229, Apr. 1980.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Third Edition. MIT Electrical Engineering and Computer Science Series. The MIT Press, 3rd edition, 2009.
4. D. Corne, J. Knowles, and M. Oates. The pareto envelope-based selection algorithm for multiobjective optimization. In Parallel Problem Solving from Nature PPSN VI, pages 839-848. Springer, 2000.
5. M. Davoodi, F. Panahi, A. Mohades, and S. N. Hashemi. Multi-objective path planning in discrete space. Applied Soft Computing, 13(1):709-720, 2013.
6. K. Deb. Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, 2001.
7. K. Deb and H. Jain. Handling many-objective problems using an improved NSGA-II procedure. In Evolutionary Computation (CEC), 2012 IEEE Congress on, pages 1-8, june 2012.
8. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182-197, Apr. 2002.
9. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable multi-objective optimization test problems. In Congress on Evolutionary Computation (CEC 2002), pages 825-830. IEEE Press, 2002.
10. H. Fang, Q. Wang, Y.-C. Tu, and M. F. Horstemeyer. An efficient non-dominated sorting method for evolutionary algorithms. Evolutionary Computation, 16(3):355-384, 2008.
11. F.-A. Fortin, F.-M. De Rainville, M.-A. Gardner, M. Parizeau, and C. Gagné. DEAP: Evolutionary algorithms made easy. Journal of Machine Learning Research, 2171-2175(13), Jul. 2012.
12. M. Jensen. Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. IEEE Transactions on Evolutionary Computation, 7(5):503-515, Oct. 2003.
13. J. Knowles and D. Corne. Approximating the nondominated front using the pareto archived evolution strategy. Evolutionary computation, 8(2):149-172, 2000.
14. L. Monier. Combinatorial solutions of multidimensional divide-and-conquer recurrences. Journal of Algorithms, 1(1):60-74, 1980.
15. A. Zhou, B.-Y. Qu, H. Li, S.-Z. Zhao, P. N. Suganthan, and Q. Zhang. Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Computation, 1(1):32-49, 2011.
16. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the strength Pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001.