Methods · Ranking
RAPS (Ranking of Alternatives based on Preference Strength)
RAPS compares two alternatives directly, measures the size of the gap between them, and ranks every alternative by this "how much better" strength against all its rivals.
Base method's data type: Classical
What Is the Method?
RAPS is a ranking method for arranging alternatives into a single order once you already hold a decision table filled with numbers. Its output is a preference-strength score between 0 and 1 for every alternative, summarising how strongly it comes out ahead in pairwise comparisons against every other alternative. RAPS does not produce weights; it takes them from outside. The method entered the literature through Dezert and Tchamova's 2022 paper, where they proposed it as a ranking tool for comparing the effectiveness of uncertainty measures in evidence theory.
The Philosophy Behind It
RAPS's underlying idea is simple: an alternative's goodness is measured not in isolation but by how far ahead it pulls of its rivals. The method compares every pair of alternatives directly and sums, criterion by criterion, the size of the gap in one direction only, counting only positive differences. This total gap between two alternatives is then normalised reciprocally: alternative A's superiority over B and B's superiority over A always sum to 1. Every pairwise comparison thus answers "which of the two leads, and by how much" directly, as a percentage. An alternative's overall score is finally the average of these pairwise superiorities it accumulates against all its rivals.
This structure makes RAPS compensatory. A weakness on one criterion is offset by strength on another within the weighted-difference calculation. Its difference from TOPSIS is that it rests not on a fixed ideal and anti-ideal point but directly on pairwise differences between alternatives; so if the gap is small, the RAPS score stays close to 0.5, showing plainly that neither alternative holds a clear advantage over the other.
How It Works
The method proceeds through three steps.
First, scale equalisation. Criteria are expressed in different units. RAPS places every column between 0 and 1 relative to its own minimum and maximum, so that different scales, such as speed, score and cost, become comparable within the same table. For "lower is better" criteria such as cost, the direction is set so that a small value approaches 1 and a large value approaches 0.
Second, pairwise preference strength. RAPS compares every pair of alternatives. On every criterion, the first alternative's superiority over the second is the weighted sum of the gap only on criteria where the first is better; where the second is better, that criterion's contribution counts as zero. The total superiority between a pair therefore comes only from the criteria on which genuine superiority exists.
Third, the overall score. An alternative's superiority over one rival is divided by the total superiority between that pair (its own superiority plus its rival's). The average of this ratio across all rivals gives the alternative's overall RAPS score. RAPS ranks alternatives by this score from highest to lowest.
The formulas behind each step and the intermediate tables are given on the DecisionMind method page; this card carries no formulas.
How to Read the Output
The RAPS score tells you an alternative's average superiority over its rivals within this particular alternative set, and nothing more. A score of 0.65 does not mean "65 per cent good"; it means the alternative comes out superior to its rivals on average. A score of 0.5 does not mean "average" but "evenly matched with its rivals"; the closer two alternatives' scores are to 0.5, the smaller the gap between them. It cannot be compared with a score computed on a different alternative set, because the score arises from the pairwise comparisons within this particular set.
Thus instead of writing:
"RAPS found the best alternative"
the report should read:
"With these weights and this alternative set, the alternative strongest against its rivals is this one; how close the scores are to one another shows how decisive the ranking is"
Data Type and Inputs
RAPS works with crisp data: one number per cell. DecisionMind currently holds no other data-type extension of this method; if your data is fuzzy, interval-based, or contradictory across expert judgement, the appropriate method is suggested on the relevant data-type card.
You need alternatives in rows, criteria in columns, one number per cell with no empty cells, direction information for every criterion (higher or lower is better), and criterion weights summing to 1. RAPS does not produce weights, it asks for them. A minimum of two alternatives and two criteria is required; the sweet spot is between three and twelve criteria. There is no upper limit on the number of alternatives, but the number of pairwise comparisons grows quickly as it increases.
When to Use It, When Not To
RAPS is suitable when your criteria can be measured numerically and you find the size of the gap between alternatives, not merely its direction, meaningful. Its typical territory includes supplier assessment and alternative selection; its pairwise-comparison logic shows directly how pronounced the gap between two alternatives is.
It should not be used where only the criteria's ordering is reliable and numerical differences are riddled with measurement error. On such data, RAPS's sensitive difference calculation can be misleading; a method that looks only at sign, which is better and which is worse, such as REGIME, is safer. If criteria are strongly dependent on one another, that must be addressed first.
Numerical table, the size of the gap is meaningful, the goal is ranking → RAPS
Only criterion order is reliable, numerical differences are suspect → REGIME
No compromise allowed on one criterion, sub-threshold alternatives must be screened out → screening first, then ranking
Weights are needed rather than a ranking → AHP, BWM, SWARA (subjective) · Entropy, CRITIC (objective)
Strengths
RAPS's greatest strength is that it grounds the ranking not in a single reference point, such as an ideal alternative, but directly in pairwise differences between alternatives. This reduces the risk of an extreme value in the alternative set distorting an ideal point. The score's range of 0 to 1 and its reciprocal-complementary property (a pair's two scores always sum to 1) make the result easy to read intuitively. The computational burden is small and the same logic holds as the number of criteria grows.
Weaknesses
Its limitations stem from the pairwise-comparison structure. First, the number of comparisons grows quadratically with the number of alternatives; with many alternatives, both the computational burden and interpretation become harder. Second, it carries the assumption of full compensation: a serious weakness on one criterion can be papered over by others. Third, RAPS, like many pairwise-comparison-based methods, requires the scores to be recalculated whenever the alternative set changes; adding a new alternative rebuilds every pairwise comparison and can change the ranking (Wang and Luo, 2009). Fourth, an independent study of rank reversal specific to RAPS is still limited in the literature; general MCDM findings should be taken as a cautious guide on this point.
Common Mistakes
The most common mistake is marking criterion direction wrongly. If a "lower is better" criterion such as cost is marked "higher is better," pairwise superiorities are computed in reverse and the ranking is wrong from the start. A second mistake is assigning equal weights without justification; equal weight is itself a choice and must be defended in the report. A third is presenting two alternatives with scores near 0.5 as though one held a decisive advantage; a score near 0.5 means the gap is small, and the report must say so. A fourth is adding an alternative once the analysis is finished and being surprised the ranking shifts.
The governing principle is this:
A RAPS score summarises an alternative's pairwise superiority against this particular set of rivals only; if an alternative is removed from or added to the set, the scores must be recalculated.
Cases
Each case opens with a decision table, describes in words what the method does to it, and shows how to read the result. The first case is DecisionMind's own validation example; the remaining cases are illustrative constructions.
1. Logistics: Choosing a contract among three haulage firms (illustrative example)
A manufacturing company must choose one of three haulage firms. Three criteria apply: a delivery-speed score, a service-quality score, and unit haulage cost. Speed and quality are "higher is better"; cost is "lower is better." The company has set the weights so speed carries the most (0.40), quality comes next (0.35), and cost carries the least (0.25).
| Firm | Speed score | Quality score | Cost (unit) |
|---|---|---|---|
| F1 | 3 | 5 | 4 |
| F2 | 5 | 3 | 2 |
| F3 | 4 | 4 | 3 |
| Direction | higher is better | higher is better | lower is better |
| Weight | 0.40 | 0.35 | 0.25 |
The method first places every column between 0 and 1. It then compares every pair of firms: F1's superiority over F2 comes only from the criteria on which F1 is better, quality here, while F2's superiority over F1 comes from speed and cost. Finally, every firm's average superiority against all its rivals is computed.
| Firm | RAPS score | Rank |
|---|---|---|
| F2 | 0.650 | 1 |
| F3 | 0.500 | 2 |
| F1 | 0.350 | 3 |
The result reads as follows. F2 is best on speed and cheapest; although weakest on quality, it comes out ahead because the combined weight of speed and cost (0.65) exceeds quality's weight (0.35). F3 sits exactly in the middle, a balanced firm on every criterion, with a score of exactly 0.5; this means F3 is neither clearly ahead of nor clearly behind its rivals. F1 finishes last despite being best on quality, because it is weakest on both speed and cost.
The company hesitates here: had the speed weight been pulled from 0.40 to 0.25 and the quality weight raised from 0.35 to 0.50, F1 could have come out ahead. The report should therefore state that the ranking is sensitive to the balance between the speed and quality weights.
In the report: "With the given weights, F2 is the strongest firm against its rivals (0.650); F3 sits exactly in the middle (0.500), and F1 can move ahead if the speed weight is lowered and the quality weight raised."
Source: This example is DecisionMind's validation case for the RAPS engine; the figures were generated from the method's own step definitions, not from the source paper, and the engine produces the same result.
2. Livestock farming: A farm's choice of feed supplier
A dairy farm must choose one of three feed suppliers. The criteria are protein content, delivery-regularity score, and price per kilogram. Protein and regularity are "higher is better"; price is "lower is better." The farm owner has given the greatest weight to protein content.
The method compares the three suppliers pairwise and computes each one's average superiority over its rivals. Suppose the result places the most expensive supplier first: its protein content is clearly the highest, and because this is the heaviest criterion, its price disadvantage is offset. The second supplier delivers most regularly; the third is middling on every criterion.
The farm owner hesitates here: if cash flow is tight, the most expensive supplier can strain the budget. RAPS has offset price against the other criteria, but it does not consider a budget ceiling on its own; if one exists, it should be applied first, and the remaining suppliers compared using RAPS.
In the report: "The budget ceiling was applied as a separate screening criterion; the remaining suppliers were ranked by a protein-weighted RAPS score."
3. Librarianship: A public library's choice of automation system
A public library must choose one of three automation software packages. The criteria are a user-interface score, technical-support response time, and annual licence fee. The interface score is "higher is better"; response time and licence fee are "lower is better." The weights were set together with library staff.
The method compares the three software packages pairwise. The result places the software with the lowest licence fee first; its interface score is middling, but its price advantage outweighs small shortfalls on the other two criteria. The second software package has the best interface but is the most expensive.
Staff hesitate here: if interface quality directly affects user satisfaction, the price weight could be lowered and the interface weight raised, and this change could reverse the order. The decision depends on which criterion is more critical for the institution, and this preference must be stated plainly in the report.
In the report: "The ranking reflects the weight given to the licence fee; if this weight is lowered and the interface weight raised, the second software package moves ahead."
4. What Not to Do
Had cost been marked "higher is better" in the same haulage table, F2's low cost would have counted against it, and the most expensive firm would have come out ahead; the ranking would become meaningless. A second error is reading F3's score of 0.500 as "an average firm" rather than "as good against its rivals as it is behind them"; 0.500 is a neutral result, not a low score. A third error is the company adding a fourth firm to the table once the analysis is finished; every pairwise comparison must be rebuilt and the ranking updated accordingly.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/raps
Dezert, J., & Tchamova, A. (2022). On the effectiveness of measures of uncertainty of basic belief assignments. Information & Security: An International Journal, 52, 9–36. DOI: 10.11610/isij.5201
Ahn, B. S. (2003). Extending Malakooti's model for ranking multicriteria alternatives with preference strength and partial information. IEEE Transactions on Systems, Man, and Cybernetics — Part A: Systems and Humans, 33(3), 281–287. DOI: 10.1109/tsmca.2003.817049
Wang, Y.-M., & Luo, Y. (2009). On rank reversal in decision analysis. Mathematical and Computer Modelling, 49(5–6), 1221–1229. DOI: 10.1016/j.mcm.2008.06.019