An Interactive Evolutionary Multiobjective Optimization Method Based on Progressively Approximated Value Functions

被引:149
作者
Deb, Kalyanmoy [1 ,2 ]
Sinha, Ankur [2 ]
Korhonen, Pekka J. [2 ]
Wallenius, Jyrki [2 ]
机构
[1] Indian Inst Technol Kanpur, Dept Mech Engn, Kanpur 208016, Uttar Pradesh, India
[2] Aalto Univ, Dept Business Technol, Sch Econ, FIN-00101 Helsinki, Finland
基金
芬兰科学院;
关键词
Evolutionary multiobjective optimization (EMO) algorithms; interactive multiobjective optimization algorithm; multiple criteria decision-making; preference-based multiobjective optimization; sequential quadratic programming (SQP); REFERENCE DIRECTION; ALGORITHM; SET;
D O I
10.1109/TEVC.2010.2064323
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper suggests a preference-based methodology, which is embedded in an evolutionary multiobjective optimization algorithm to lead a decision maker (DM) to the most preferred solution of her or his choice. The progress toward the most preferred solution is made by accepting preference based information progressively from the DM after every few generations of an evolutionary multiobjective optimization algorithm. This preference information is used to model a strictly monotone value function, which is used for the subsequent iterations of the evolutionary multiobjective optimization (EMO) algorithm. In addition to the development of the value function which satisfies DM's preference information, the proposed progressively interactive EMO-approach utilizes the constructed value function in directing EMO algorithm's search to more preferred solutions. This is accomplished using a preference-based domination principle and utilizing a preference-based termination criterion. Results on two-to five-objective optimization problems using the progressively interactive NSGA-II approach show the simplicity of the proposed approach and its future promise. A parametric study involving the algorithm's parameters reveals interesting insights of parameter interactions and indicates useful parameter values. A number of extensions to this paper are also suggested.
引用
收藏
页码:723 / 739
页数:17
相关论文
共 35 条
[1]  
[Anonymous], 2002, Evolutionary algorithms for solving multi-objective problems
[2]  
[Anonymous], 2006, INT J COMPUT INTELL, DOI DOI 10.5019/J.IJCIR.2006.67
[3]   Guidance in evolutionary multi-objective optimization [J].
Branke, J ;
Kaussler, T ;
Schmeck, H .
ADVANCES IN ENGINEERING SOFTWARE, 2001, 32 (06) :499-507
[4]  
Branke J., 2004, KNOWLEDGE INCORPORAT, P461
[5]  
Branke J, 2009, LECT NOTES COMPUT SC, V5467, P554, DOI 10.1007/978-3-642-01020-0_43
[6]  
Byrd RH, 2006, NONCONVEX OPTIM, V83, P35
[7]  
Corne D. W., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P839
[8]  
Deb K, 2004, ADV INFO KNOW PROC, P105
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]  
Deb K., 1995, Complex Systems, V9, P115