When making complex decisions—such as choosing a blockchain platform, allocating pandemic vaccines, or evaluating regional water security—we rarely have a single metric to optimize. Instead, we face a web of conflicting criteria: cost versus quality, speed versus sustainability, or utility versus equity.
To solve this without relying on purely subjective intuition, we can use a geometric approach known as TOPSIS (Technique for Order Preference by Similarity to Ideal Solution). The core intuition is simple: instead of collapsing multiple dimensions into a single score immediately, we map every available option as a point in a multi-dimensional space and rank them based on their proximity to two theoretical benchmarks: a Positive Ideal Solution ($A^+$) and a Negative Ideal Solution ($A^-$).
The Geometry of Compromise
Imagine evaluating a set of alternatives across several criteria. If we plot these alternatives in a coordinate system where each axis represents a distinct criterion, we can identify two extreme points:
- The Positive Ideal Solution ($A^+$): A hypothetical "North Star" that takes the absolute best value achieved by any alternative for every single criterion.
- The Negative Ideal Solution ($A^-$): A hypothetical "South Star" that takes the worst possible value across all dimensions.
Criterion 2 (Benefit)
^
| [A+] Positive Ideal (Best of both worlds)
| *
| /
| / * Alternative A (Close to A+, far from A-)
| /
| / * Alternative B (Close to A-, far from A+)
| /
|* [A-] Negative Ideal (Worst of both worlds)
+--------------------------------------------> Criterion 1 (Benefit)
The optimal real-world alternative is the one that is geometrically closest to the Positive Ideal and furthest from the Negative Ideal. By evaluating options relative to these boundaries, the framework simplifies multi-dimensional technical and economic data into a single, communicable score.
The Mechanics of Proximity
To calculate these rankings precisely, the framework follows a structured mathematical pipeline:
1. Normalization
Because different criteria use entirely different units (e.g., cost in dollars versus efficiency in percentages), they cannot be combined directly. Normalization maps all criteria onto a shared, dimensionless scale, typically between 0 and 1.
2. Weighting
Not all criteria are created equal. The normalized values are multiplied by weights to reflect their relative importance.
3. Identifying the Ideals
The coordinates for $A^+$ and $A^-$ are determined from the weighted matrix. For a "benefit" criterion (where higher is better), $A^+$ takes the maximum value and $A^-$ takes the minimum. For a "cost" criterion (where lower is better), this relationship is inverted.
4. Distance Calculation
The geometric distance from each alternative to both $A^+$ and $A^-$ is calculated using a distance metric, typically the Euclidean distance:
$$D_i^+ = \sqrt{\sum_{j=1}^{n} (v_{ij} - v_j^+)^2}$$
$$D_i^- = \sqrt{\sum_{j=1}^{n} (v_{ij} - v_j^-)^2}$$
5. Closeness Coefficient
Finally, a relative closeness coefficient ($C_i$) is computed to rank the alternatives:
$$C_i = \frac{D_i^-}{D_i^+ + D_i^-}$$
An alternative with a $C_i$ close to 1 is near the ideal best and far from the ideal worst. As Siping Qin demonstrates in an evaluation of logistics performance, this coefficient provides a stable ranking across volatile periods by accounting for both objective data and expert insight simultaneously (The Performance Evaluation of China Railway Corporation Modern Logistics Based on Combination Weighting Method and TOPSIS Method).
Why Dual Distances Matter
Why not simply measure the distance to the positive ideal? Relying solely on the best-case scenario can lead to sub-optimal choices when data distributions are skewed. An alternative might be close to the ideal best overall, but dangerously close to the worst-case scenario on a single, critical metric. By maximizing the distance to $A^-$ while minimizing the distance to $A^+$, the algorithm enforces a balanced "compromise" solution.
This dual-distance mechanism is highly effective at balancing competing societal and operational goals:
- Public Health and Equity: Fengli Xu et al. utilized this approach to optimize COVID-19 vaccine distribution, successfully balancing public health utility (saving lives) with social equity (protecting disadvantaged communities) without relying on a single-factor prioritization (Strategic COVID-19 vaccine distribution can simultaneously elevate social utility and equity).
- Algorithmic Fairness: In machine learning, Jakob Schöffer et al. framed fair classification as a ranking problem. By measuring an individual's distance to a hypothetical "perfect" candidate, their method ensures meritocratic fairness and remains robust even when training data is contaminated by historical human prejudice (A Ranking Approach to Fair Classification).
Taming Human Uncertainty with Fuzzy Logic
In real-world applications, data is rarely crisp. Expert opinions are often vague, and environmental or technical metrics can be highly uncertain. To handle this, researchers frequently merge proximity ranking with fuzzy set theory.
Instead of using exact numbers, criteria values are expressed as intervals or fuzzy numbers that capture human hesitation. For example, Andrew John et al. combined a fuzzy analytic hierarchy process with ideal-solution ranking to evaluate seaport resilience strategies, effectively handling imprecise data for prioritization (Application of a collaborative modelling and strategic fuzzy decision support system for selecting appropriate resilience strategies for seaport operations).
More advanced variations incorporate neutrosophic logic, which tracks not just truth and falsity, but also the "indeterminacy" inherent in complex data. A. H. Alamoodi et al. applied a neutrosophic fuzzy environment to benchmark smart e-tourism applications, mapping multi-dimensional feature sets into a three-dimensional space to handle conflicting qualitative user reviews (Based on neutrosophic fuzzy environment: a new development of FWZIC and FDOSM for benchmarking smart e-tourism applications).
Eliminating Subjectivity via Objective Weighting
A common vulnerability in multi-criteria ranking is the reliance on subjective expert weights. If an analyst arbitrarily decides which criterion matters most, the geometric space distorts.
To mitigate this, modern frameworks pair proximity ranking with data-driven weighting methods like the Entropy Weighting Method (EWM) or CRITIC (Criteria Importance Through Intercriteria Correlation). These methods calculate weights based on the intrinsic variance and correlation of the data itself:
- Environmental Assessment: Zhenlin Dai et al. integrated EWM with proximity ranking to evaluate light pollution across diverse urban and rural landscapes, ensuring that the final rankings were driven by statistical variance rather than subjective bias (Research on light pollution level based on comprehensive evaluation —— A case study of Beijing).
- Asset Valuation: In financial data asset valuation, Wei Zhang et al. used value entropy to replace expert scoring entirely, allowing for an objective, multi-dimensional ranking of non-customized data assets based on their mathematical distance from a theoretical ideal (Non-customized data asset evaluation based on knowledge graph and value entropy).
By transforming abstract optimization problems into a concrete geometric search for the "closest compromise," ideal-solution proximity ranking provides a mathematically rigorous, stable, and intuitive framework for solving the world's most complex trade-offs.
Key Foundational Work
A Course Recommender System Using Multiple Criteria Decision Making Method (2007) — contributed 3 concept elements to this direction.