The r-Dominance: A New Dominance Relation for Interactive Evolutionary Multicriteria Decision Making

被引:229
作者
Ben Said, Lamjed [1 ]
Bechikh, Slim [1 ]
Ghedira, Khaled [1 ]
机构
[1] Univ Tunis, Intelligent Informat Engn Lab LI3, High Inst Management Tunis, Tunis 2000, Tunisia
关键词
Decision maker's preferences; evolutionary algorithms; interactive multiobjective optimization; Pareto dominance; reference point method; MULTIOBJECTIVE OPTIMIZATION; NSGA-II; ALGORITHM; PREFERENCES;
D O I
10.1109/TEVC.2010.2041060
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary multiobjective optimization (EMO) methodologies have gained popularity in finding a representative set of Pareto optimal solutions in the past decade and beyond. Several techniques have been proposed in the specialized literature to ensure good convergence and diversity of the obtained solutions. However, in real world applications, the decision maker is not interested in the overall Pareto optimal front since the final decision is a unique solution. Recently, there has been an increased emphasis in addressing the decision-making task in searching for the most preferred alternatives. In this paper, we introduce a new variant of the Pareto dominance relation, called r-dominance, which has the ability to create a strict partial order among Pareto-equivalent solutions. This fact makes such a relation able to guide the search toward the interesting parts of the Pareto optimal region based on the decision maker's preferences expressed as a set of aspiration levels. After integrating the new dominance relation in the NSGA-II methodology, the efficacy and the usefulness of the modified procedure are assessed through two to ten-objective test problems a priori and interactively. Moreover, the proposed approach provides competitive and better results when compared to other recently proposed preferencebased EMO approaches.
引用
收藏
页码:801 / 818
页数:18
相关论文
共 48 条
[1]  
Adra SF, 2007, LECT NOTES COMPUT SC, V4403, P908
[2]  
Allmendinger R, 2008, LECT NOTES COMPUT SC, V5361, P200
[3]  
[Anonymous], 2007, P INT C EV MULT OPT
[4]  
[Anonymous], 2001, SPEA2 IMPROVING STRE
[5]  
[Anonymous], 2006, INT J COMPUT INTELL, DOI DOI 10.5019/J.IJCIR.2006.67
[6]  
ARROW KJ, 1951, SOCIAL CHOICE INDIVI, P56
[7]   PHC-NSGA-II: A Novel Multi-objective Memetic Algorithm for Continuous Optimization [J].
Bechikh, Slim ;
Belgasmi, Nabil ;
Ben Said, Lamjed ;
Ghedira, Khaled .
20TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, VOL 1, PROCEEDINGS, 2008, :180-189
[8]  
Belgasmi N., 2008, OPER RES, V8, P167, DOI [DOI 10.1007/S12351-008-0015-5, 10.1007/s12351-008-0015-5]
[9]  
Bleuler S, 2003, LECT NOTES COMPUT SC, V2632, P494
[10]   Guidance in evolutionary multi-objective optimization [J].
Branke, J ;
Kaussler, T ;
Schmeck, H .
ADVANCES IN ENGINEERING SOFTWARE, 2001, 32 (06) :499-507