INTERACTIVE ROBUST CONE CONTRACTION METHOD FOR MULTIPLE OBJECTIVE OPTIMIZATION PROBLEMS

被引:13
作者
Kadzinski, Milosz [1 ]
Slowinski, Roman [1 ,2 ]
机构
[1] Poznan Univ Tech, Inst Comp Sci, PL-60965 Poznan, Poland
[2] Polish Acad Sci, Syst Res Inst, PL-01447 Warsaw, Poland
关键词
Multiple objective optimization; interactive procedure; cone contraction; pairwise comparisons; robust ordinal regression; RANKING; SET;
D O I
10.1142/S0219622012400056
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce a new interactive procedure for multiple objective optimization problems. The identification of the most preferred solution is achieved by means of a systematic dialogue with the decision maker (DM) during which (s) he specifies pairwise comparisons of nondominated solutions from a current sample. We represent this preference information by a compatible form of the achievement scalarizing function, i.e., we are searching for weights of objectives which ensure that the reference solutions are compared by the function in the same way as by the DM. Directions of the isoquants of all compatible achievement scalarizing functions create a cone in the evaluation space, with the origin in a reference point. In successive iterations, each new pairwise comparison of solutions contracts the cone which is zooming on a subregion of nondominated points of greatest interest for the DM. The procedure ends when at least one satisfactory solution is selected or when the DM comes to conclusion that there is no such solution for the current problem setting.
引用
收藏
页码:327 / 357
页数:31
相关论文
共 39 条
[1]  
[Anonymous], MULTICRITERIA DECISI
[2]  
[Anonymous], 1986, MULTIPLE CRITERION O
[3]   AN INTELLIGENT DECISION SUPPORT BASED ON A SUBTRACTIVE CLUSTERING AND FUZZY INFERENCE SYSTEM FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM IN SERIOUS GAME [J].
Buditjahjanto, I. G. P. Asto ;
Miyauchi, Hajime .
INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING, 2011, 10 (05) :793-810
[4]   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
[5]   AN OVERVIEW OF TECHNIQUES FOR SOLVING MULTIOBJECTIVE MATHEMATICAL PROGRAMS [J].
EVANS, GW .
MANAGEMENT SCIENCE, 1984, 30 (11) :1268-1282
[6]  
Figueira JR, 2008, LECT NOTES COMPUT SC, V5252, P97, DOI 10.1007/978-3-540-88908-3_4
[7]   Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method [J].
Figueira, Jose Rui ;
Greco, Salvatore ;
Slowinski, Roman .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 195 (02) :460-486
[8]   The interactive analysis of the multicriteria shortest path problem by the reference point method [J].
Granat, J ;
Guerriero, F .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (01) :103-118
[9]   Interactive specification and analysis of aspiration-based preferences [J].
Granat, J ;
Makowski, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 122 (02) :469-485
[10]   Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions [J].
Greco, Salvatore ;
Mousseau, Vincent ;
Slowiniski, Roman .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (02) :416-435