An algorithm for ordinal sorting based on ELECTRE with categories defined by examples (Q960115): Difference between revisions

The paper proposes an algorithm for sorting a set of alternatives into ordered categories according to multiple criteria. The method is based on the idea of progressive assisted sorting and uses ELECTRE methodology. The authors first review the valued outranking relations used in ELECTRE and then describe their algorithm. The algorithm defines categories by exemplary alternatives rather than explicit limits and it employs the principle that ``if and alternative \(a_i\) outranks \(a_j\) then the category of \(a_i\) must be at least as good as the category of \(a_j\).'' The authors then extend the idea to an aggregation/disaggregation procedure, where some parameter values (the criterion weights and cutting levels for the categories) are inferred. This leads to LP formulations for determining the parameters. Finally, illustrative examples using two data sets are given.