Papers
Topics
Authors
Recent
Search
2000 character limit reached

FlowSort-H: Multi-Criteria Sorting with Choquet Integral

Updated 17 March 2026
  • FlowSort-H is a multi-criteria sorting methodology that extends the original FlowSort by using the Choquet integral to aggregate preference degrees on heterogeneous scales.
  • It transforms diverse criteria into a common scale using PROMETHEE-type preference functions to avoid the need for prior normalization.
  • The method applies a 2-additive capacity model to explicitly capture criterion interactions, enabling robust assignment of alternatives to ordered categories.

FlowSort-H is a methodology for multi-criteria sorting that extends the FlowSort method to accommodate interacting criteria evaluated on heterogeneous scales. Utilizing the Choquet integral as an aggregation operator within the outranking framework, FlowSort-H addresses two significant limitations of classical approaches: (i) the necessity of a common scale for all criteria, and (ii) the inability to explicitly model synergy or redundancy (interactions) between criteria. By constructing a common, commensurate scale via PROMETHEE-type preference functions and applying a 2-additive Choquet integral for aggregation, FlowSort-H enables robust assignment of alternatives to ordered categories in complex decision-aiding scenarios (Pelissari et al., 2019).

1. Theoretical Foundation: Choquet Integral on Heterogeneous Scales

FlowSort-H employs a capacity (fuzzy measure) μ:2G[0,1]\mu: 2^G \to [0,1] defined on the set of criteria G={1,,n}G = \{1, \dots, n\}, satisfying μ()=0\mu(\emptyset) = 0, μ(G)=1\mu(G) = 1 and monotonicity constraints. The Möbius representation m:2GRm: 2^G \to \mathbb{R} expresses μ(S)\mu(S) as the sum of the Möbius measures m(T)m(T) over TST \subseteq S, with a 2-additive restriction (m(T)=0m(T)=0 if T>2|T|>2):

μ(S)=jSm({j})+{j,s}Sm({j,s}).\mu(S) = \sum_{j\in S} m(\{j\}) + \sum_{\{j,s\}\subseteq S} m(\{j,s\}).

Instead of applying the Choquet integral to direct criterion scores gj()g_j(\cdot) (often on incompatible scales), FlowSort-H computes all aggregations on the basis of preference degrees Pj(x,y)[0,1]P_j(x,y)\in[0,1], constructed for each pair of entities x,yx, y (alternative or profile). This ensures commensurability required for valid Choquet integration.

2. Construction of Commensurate Scales: Preference Functions

FlowSort-H systematically transforms heterogeneous criteria into a common unit interval by employing PROMETHEE-type preference functions:

Pj(x,y)=P[gj(x)gj(y)][0,1]P_j(x, y) = P\left[ g_j(x) - g_j(y) \right] \in [0,1]

DMs choose suitable preference function families (e.g., Type I: Pj(x,y)=1P_j(x, y)=1 iff gj(x)>gj(y)g_j(x)>g_j(y), else $0$), tailored to each criterion. The mapping

ϕj:  gj(x)Pj(x,y)\phi_j:\;g_j(x)\mapsto P_j(x,y)

is used to construct all subsequent aggregations. This approach circumvents the need to normalize gjg_j a priori and directly models intensity-of-preference in a scale-agnostic manner.

3. Choquet-Based Outranking Degree

The core of FlowSort-H is the replacement of the classical weighted-sum outranking degree with a Choquet-based measure that incorporates both importance (via Shapley indices) and interaction (via pairwise interaction indices):

CIπ(x,y)=jGm({j})Pj(x,y)+{j,s}Gm({j,s})min{Pj(x,y),Ps(x,y)}CI_{\pi}(x, y) = \sum_{j \in G} m(\{j\}) P_j(x, y) + \sum_{\{j, s\} \subseteq G} m(\{j, s\}) \min\{P_j(x, y), P_s(x, y)\}

Alternatively, using Shapley values IjI_j and interaction indices IjsI_{js}:

CIπ(x,y)=Ijs>0min{Pj,Ps}Ijs+Ijs<0max{Pj,Ps}Ijs+j=1nPj(x,y)(Ij12sjIjs)CI_{\pi}(x,y) = \sum_{I_{js}>0} \min\{P_j, P_s\} I_{js} + \sum_{I_{js}<0} \max\{P_j, P_s\} |I_{js}| + \sum_{j=1}^n P_j(x, y) \left(I_j - \tfrac12 \sum_{s\neq j}|I_{js}|\right)

where Ij=m({j})+12sjm({j,s})I_j = m(\{j\}) + \frac12 \sum_{s \ne j} m(\{j, s\}), Ijs=m({j,s})I_{js} = m(\{j, s\}). For Ijs=0I_{js}=0, the expression reduces to classic additive aggregation.

4. FlowSort-H Algorithmic Process

Given a set of alternatives A={a1,...,am}A = \{a_1, ..., a_m\}, ordered categories K1KkK_1 \succ \cdots \succ K_k operationalized via profiles R={r1,...,rk+1}R = \{r_1, ..., r_{k+1}\}, the FlowSort-H assignment process proceeds as:

  1. For each aia_i, set Ri:=R{ai}R_i := R \cup \{ a_i \}.
  2. For all pairs x,yRix, y \in R_i, and for each criterion jj, compute Pj(x,y)P_j(x, y) using the selected preference function.
  3. Compute CIπ(x,y)CI_\pi(x, y) for all x,yRix, y \in R_i per the Choquet-based outranking degree.
  4. For all xRix \in R_i, calculate the positive and negative flows:

ϕRi+(x)=1Ri1yxCIπ(x,y),ϕRi(x)=1Ri1yxCIπ(y,x)\phi^+_{R_i}(x) = \frac{1}{|R_i| - 1} \sum_{y \neq x} CI_\pi(x, y), \quad \phi^-_{R_i}(x) = \frac{1}{|R_i| - 1} \sum_{y \neq x} CI_\pi(y, x)

Net flow: ϕRi(x)=ϕRi+(x)ϕRi(x)\phi_{R_i}(x) = \phi^+_{R_i}(x) - \phi^-_{R_i}(x).

  1. Assign aia_i to category KhK_h using a chosen rule (positive, negative, or net-flow) by comparing ϕRi+(ai)\phi^+_{R_i}(a_i) (resp. ϕRi(ai)\phi^-_{R_i}(a_i), ϕRi(ai)\phi_{R_i}(a_i)) to profiles' flows.

Capacity parameters (m({j}),m({j,s}))(m(\{j\}), m(\{j, s\})) or equivalently (Ij,Ijs)(I_j, I_{js}) are elicited from DM judgments or via indirect approaches such as Robust Ordinal Regression or SMAA.

5. Modeling and Interpreting Criterion Interactions

In FlowSort-H, the 2-additive Möbius coefficients m({j,s})=Ijsm(\{j, s\})=I_{js} represent the pairwise interactions:

  • Ijs>0I_{js}>0 (synergic): the criteria are superadditive, boosting the min{Pj,Ps}\min\{P_j, P_s\} term.
  • Ijs<0I_{js}<0 (redundant): the criteria are subadditive, so the max{Pj,Ps}\max\{P_j, P_s\} term is emphasized.
  • The Shapley value IjI_j ensures jIj=1\sum_j I_j=1 (normalization).

Monotonicity is guaranteed under the constraint:

Ij12sjIjs0,j.I_j - \frac12 \sum_{s \ne j} |I_{js}| \geq 0, \quad \forall j.

This structure enables modeling the influence of both individual criteria and their mutual interactions within the assignment process.

6. Numerical Example

Consider three alternatives and two criteria with heterogeneous measurement units, assigned to two categories via three profiles:

$\begin{array}{c|cc} & g_1(\cdot) \text{ (km/h)} & g_2(\cdot) \text{ (km/l)} \ \hline a_1 & 210 & 10 \ a_2 & 202 & 12 \ a_3 & 200 & 12 \ \hline r_1 & 215 & 12.5 \ r_2 & 195 & 11.0 \ r_3 & 180 & 10.0 \end{array}$

With Type I preference functions (Pj(x,y)=1P_j(x, y) = 1 iff gj(x)>gj(y)g_j(x) > g_j(y), $0$ otherwise) and 2-additive capacity parameters I1=0.5I_1=0.5, I2=0.5I_2=0.5, I12=0.2I_{12}=0.2 (indicating synergy), the Möbius components are m({1})=0.4m(\{1\})=0.4, m({2})=0.4m(\{2\})=0.4, m({1,2})=0.2m(\{1,2\})=0.2.

For a1a_1 vs r2r_2:

P1(a1,r2)=1,P2(a1,r2)=0 CIπ(a1,r2)=0.4×1+0.4×0+0.2×min{1,0}=0.4P_1(a_1, r_2) = 1,\quad P_2(a_1, r_2) = 0\ CI_\pi(a_1, r_2) = 0.4 \times 1 + 0.4 \times 0 + 0.2 \times \min\{1,0\} = 0.4

Positive flows are computed analogously; if ϕ+(a1)=0.7\phi^+(a_1) = 0.7, ϕ+(r1)=1\phi^+(r_1) = 1, ϕ+(r2)=0.5\phi^+(r_2)=0.5, the positive-flow rule yields a1K1a_1\in K_1 since $0.7$ lies between $1$ and $0.5$.

7. Implementation and Practical Considerations

FlowSort-H provides a detailed operational procedure suitable for direct implementation, enabling researchers to build preference-function transformations, apply the Choquet aggregation directly on pairwise preference degrees, and execute the full sorting workflow without preliminary normalization of heterogeneous scales. Capacities can be assessed either through direct DM interaction or inferred by indirect means. The approach is conceptually simple to implement and designed to facilitate the inclusion of criterion interactions in multi-criteria sorting, supporting robust and interpretable classification in the presence of conflicting, non-commensurate data (Pelissari et al., 2019).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to FlowSort-H.