Consensus Modeling with Asymmetric Cost Based on Data-Driven Robust Optimization

被引:85
作者
Qu, Shaojian [1 ,2 ]
Han, Yefan [2 ]
Wu, Zhong [2 ]
Raza, Hassan [2 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Nanjing 210044, Peoples R China
[2] Univ Shanghai Sci & Technol, Shanghai 200093, Peoples R China
关键词
Group decision making; Minimum cost consensus; Robust optimization; Data-driven optimization; Asymmetric cost; GROUP DECISION-MAKING; REACHING PROCESS; MINIMUM-COST; FEEDBACK MECHANISM; ADJUSTMENT; CONSISTENCY; NETWORK; DESIGN; RULES;
D O I
10.1007/s10726-020-09707-w
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The robust optimization method has progressively become a research hot spot as a valuable means for dealing with parameter uncertainty in optimization problems. Based on the asymmetric cost consensus model, this paper considers the uncertainties of the experts' unit adjustment costs under the background of group decision making. At the same time, four uncertain level parameters are introduced. For three types of minimum cost consensus models with direction restrictions, including MCCM-DC,epsilon-MCCM-DC and threshold-based (TB)-MCCM-DC, the robust cost consensus models corresponding to four types of uncertainty sets (Box set, Ellipsoid set, Polyhedron set and Interval-Polyhedron set) are established. Sensitivity analysis is carried out under different parameter conditions to determine the robustness of the solutions obtained from robust optimization models. The robust optimization models are then compared to the minimum cost models for consensus. The example results show that the Interval-Polyhedron set's robust models have the smallest total costs and strongest robustness. Decision makers can choose the combination of uncertainty sets and uncertain levels according to their risk preferences to minimize the total cost. Finally, in order to reduce the conservatism of the classical robust optimization method, the pricing information of the new product MACUBE 550 is used to build a data-driven robust optimization model. Ellipsoid uncertainty set is proved to better trade-off the average performance and robust performance through different measurement indicators. Therefore, the uncertainty set can be selected according to the needs of the group.
引用
收藏
页码:1395 / 1432
页数:38
相关论文
共 50 条
[1]   Multi-criteria group consensus under linear cost opinion elasticity [J].
Ben-Arieh, D. ;
Easton, T. .
DECISION SUPPORT SYSTEMS, 2007, 43 (03) :713-721
[2]   Minimum Cost Consensus With Quadratic Cost Functions [J].
Ben-Arieh, David ;
Easton, Todd ;
Evans, Brandon .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2009, 39 (01) :210-217
[3]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[4]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[5]   Robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Nemirovski, A .
OPERATIONS RESEARCH LETTERS, 1999, 25 (01) :1-13
[6]   Data-driven robust optimization [J].
Bertsimas, Dimitris ;
Gupta, Vishal ;
Kallus, Nathan .
MATHEMATICAL PROGRAMMING, 2018, 167 (02) :235-292
[7]   Simple Contracts to Assure Supply Under Noncontractible Capacity and Asymmetric Cost Information [J].
Bolandifar, Ehsan ;
Feng, Tianjun ;
Zhang, Fuqiang .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2018, 20 (02) :217-231
[8]   Algorithms and uncertainty sets for data-driven robust shortest path problems [J].
Chassein, Andre ;
Dokka, Trivikram ;
Goerigk, Marc .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (02) :671-686
[9]   Modeling the minimum cost consensus problem in an asymmetric costs context [J].
Cheng, Dong ;
Zhou, Zhili ;
Cheng, Faxin ;
Zhou, Yanfang ;
Xie, Yujing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (03) :1122-1137
[10]   Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios [J].
Conde, Eduardo .
COMPUTERS & OPERATIONS RESEARCH, 2019, 103 :97-108