ACM Home Page
Please provide us with feedback. Feedback
A robust evolutionary framework for multi-objective optimization
Full text PdfPdf (690 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
SESSION: Evolutionary multiobjective optimization papers table of contents
Pages 633-640  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Author
Kalyanmoy Deb  Indian Institute of Technology Kanpur, Kanpur, India
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 118,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389223
What is a DOI?

ABSTRACT

Evolutionary multi-objective optimization (EMO) methodologies, suggested in the beginning of Nineties, focussed on the task of finding a set of well-converged and well-distributed set of solutions using evolutionary optimization principles. Of the EMO methodologies, the elitist non-dominated sorting genetic algorithm or NSGA-II, suggested in 2000, is now probably the most popularly used EMO procedure. NSGA-II follows three independent principles -- domination principle, diversity preservation principle and elite preserving principle -- which make NSGA-II a flexible and robust EMO procedure in the sense of solving various multi-objective optimization problems using a common framework. In this paper, we describe NSGA-II through a functional decomposition following the implementation of these three principles and demonstrate how various multi-objective optimization tasks can be achieved by simply modifying one of the three principles. We argue that such a functionally decomposed and modular implementation of NSGA-II is probably the reason for it's popularity and robustness in solving various types of multi-objective optimization problems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Branke and K. Deb. Integrating user preferences into evolutionary multi-objective optimization. In Y. Jin, editor, Knowledge Incorporation in Evolutionary Computation, pages 461--477. Hiedelberg, Germany: Springer, 2004.
 
2
J. Branke, K. Deb, H. Dierolf, and M. Osswald. Finding knees in multi-objective optimization. In Parallel Problem Solving from Nature (PPSN-VIII), pages 722--731. Heidelberg, Germany: Springer, 2004.
 
3
J. Branke, T. Kauβler, and H. Schmeck. Guidance in evolutionary multi-objective optimization. Advances in Engineering Software, 32:499--507, 2001.
 
4
 
5
 
6
K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182--197, 2002.
7
 
8
 
9
K. Deb and A. Kumar. Light beam search based multi-objective optimization using evolutionary algorithms. In Proc. of the Congress on Evolutionary Computation (CEC-07), pages 2125--2132, 2007.
 
10
 
11
K. Deb and D. Saxena. Searching for pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. In Proceedings of the World Congress on Computational Intelligence (WCCI--2006), pages 3352--3360, 2006.
 
12
K. Deb, J. Sundar, N. Uday, and S. Chaudhuri. Reference point based multi-objective optimization using evolutionary algorithms. International Journal of Computational Intelligence Research (IJCIR), 2(6):273--286, 2006.
 
13
K. Deb and S. Tiwari. Omni-optimizer: A generic evolutionary algorithm for global optimization. European Journal of Operations Research (EJOR), 185(3):1062--1087, 2008.
 
14
M. Farina and P. Amato. A fuzzy definition of "optimality" for many-criteria decision-making and optimization problems. submitted to IEEE Trans. on Sys. Man and Cybern., 34(3):315--326, 2004.
 
15
A. M. Geoffrion. Proper efficiency and theory of vector maximization. Journal of Mathematical Analysis and Applications, 22(3):618--630, 1968.
 
16
 
17
A. Jaszkiewicz and R. Slowinski. The light beam search approach -- An overview of methodology and applications. European Journal of Operation Research, 113:300--314, 1999.
 
18
 
19
S. Kukkonen and K. Deb. Improved pruning of non-dominated solutions based on crowding distance for bi-objective optimization problems. In Proc. of the Congress on Evolutionary Computation (CEC--06), pages 1179 -- 1186, 2006.
 
20
 
21
K. Miettinen. Nonlinear Multiobjective Optimization. Kluwer, Boston, 1999.
 
22