Abstract
Multiple criteria sorting problem aims to assign objects evaluated on multiple criteria to ordered classes. In inverse multiple criteria sorting problem, the class assignments of objects are known and the decision maker can manipulate the scores of objects on criteria by implementing actions. Selected actions enable the improvement of objects’ final classification. As the decision maker chooses to implement more actions, better classifications may be obtained. The contribution of this paper is under two-folds. First, we decompose inverse multiple criteria sorting problem into two phases, where phase one is a pre-process that computes the minimum cost required for each feasible object-class pair considering the underlying sorting model. Phase two interacts with the decision maker to analyze the classification and budget related trade-offs, through an assignment model generated with the outputs of phase one. The second contribution is using a modified version of a regret-based approach available in the literature. This modification includes a tighter formulation of the regret model, and an interactive solution approach using a mixed integer program for computing the minimax regret value rather than a branch-and-bound approach. We present an example instance to illustrate the developed ideas and conduct computational tests on randomly generated instances. The simultaneous use of the decomposition approach, tighter formulation and the interactive algorithm reduces the computation time significantly.
Similar content being viewed by others
References
Alves M, Clímaco J (2007) A review of interactive methods for multiobjective integer and mixed-integer programming. Eur. J. Oper. Res. 180(1):99–115
Bell D (1982) Regret in decision making under uncertainty. Oper. Res. 30:961–981
Benabbou N, Perny P (2018) Interactive resolution of multiobjective combinatorial optimization problems by incremental elicitation of criteria weights. EURO J. Decis. Process. 6:283–319
Benabbou N, Leroy C, Lust T, Perny P (2019) Combining local search and elicitation for multi-objective combinatorial optimization. In: 6th international conference proceedings algorithmic decision theory, pp 1–16
Boutilier C (2013) Ch 14. Computational decision support regret-based models for optimization and preference elicitation. In: TR Zentall, PH Crowley, (eds) Comparative Decision Making, Oxford University Press: Oxford
Boutilier C, Patrascu R, Poupart P, Schuurmans D (2006) Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170:686–713
Bouyssou D, Marchant T (2007) An axiomatic approach to noncompensatory sorting methods in MCDM, I: the case of two categories. Eur. J. Oper. Res. 178:217–245
Bouyssou D, Marchant T (2007) An axiomatic approach to noncompensatory sorting methods in MCDM, II: more than two categories. Eur. J. Oper. Res. 178:246–276
Braziunas D, Boutilier C (2007) Minimax regret based elicitation of generalized additive utilities. In: UAI’07: Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence p 25-32
Braziunas D, Boutilier C (2010) Assessing regret-based preference elicitation with the utpref recommendation system. In: proceedings of the eleventh ACM conference on electronic commerce (EC’10) pp 219–228
Greco S, Mousseau V, Słowiński R (2010) Multiple criteria sorting with a set of additive value functions. Eur. J. Oper. Res. 207:1455–1470
Greco S, Kadziński M, Mousseau V, Słowiński R (2012) Robust ordinal regression for multiple criteria group decision: UTAGMS-GROUP and UTADISGMS-GROUP. Decis. Support Syst. 52:549–561
Kadzinski M, Ciomek K, Rychly P, Slowinski R (2016) Post factum analysis for robust multiple criteria ranking and sorting. J. Global Opt. 65:531–562
Leroy A, Mousseau V, Pirlot M (2011) Learning the parameters of a multiple criteria sorting method. Algorithm. Decis. Theory Lect. Notes Comput. Sci. 6992:219–233
Loomes G, Sugden R (1982) Regret theory: an alternative theory of rational choice under uncertainty. Econ. J. 92:805–824
Mousseau V, Özpeynirci Ö, Özpeynirci S (2018) Inverse multiple criteria sorting problem. Ann. Oper. Res. 267(1–2):379–412
Özmen B (2017) An interactive method for inverse multiple criteria sorting problem. MSc Thesis, Izmir University of Economics
Özpeynirci Ö, Özpeynirci S, Mousseau V (2020) An interactive approach for inverse multiple criteria sorting problem. J Multi-Criteria Decis Anal. https://doi.org/10.1002/mcda.1719
Özpeynirci S, Özpeynirci Ö, Mousseau V (2018) An interactive algorithm for multiple criteria constrained sorting problem. Ann. Oper. Res. 267(1–2):447–466
Wang T (2015) Decision making and modelling uncertainty for the multicriteria analysis of complex energy systems. PhD thesis, CentraleSupélec
Wang T, Pedroni N, Zio E, Mousseau V (2020) Identification of protective actions to reduce the vulnerability of safety-critical systems to malevolent intentional acts: an optimization-based decision-making approach. Risk Anal. 40(3):565–587
Wolters W, Mareschal B (1995) Novel types of sensitivity analysis for additive MCDM methods. Eur. J. Oper. Res. 81:281–290
Yu W (1992) Aide multicritére á la décision dans le cadre de la problématique du tri: méthodes et applications. PhD thesis, LAMSADE, Université Paris Dauphine
Zopounidis C, Doumpos M (2002) Multicriteria classification and sorting methods: a literature review. Eur. J. Oper. Res. 138:229–246
Acknowledgements
Özgür Özpeynirci and Selin Özpeynirci were visiting researchers at MICS, CentraleSupélec during this study. These authors acknowledge the support of the Scientific and Technological Research Council of Turkey (TÜBİTAK-2219 programme), İzmir University of Economics and CentraleSupélec.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There is no potential conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Özpeynirci, Ö., Özpeynirci, S. & Mousseau, V. A decomposition based minimax regret approach for inverse multiple criteria sorting problem. 4OR-Q J Oper Res 21, 125–149 (2023). https://doi.org/10.1007/s10288-022-00505-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-022-00505-5