This page is published in English.
Ranking
BF-WASPAS - Bipolar extension of WASPAS
Bipolar outranking/ranking - Bipolar Fuzzy Set (BFS: positive membership μ⁺ ∈ [0,1], negative μ⁻ ∈ [-1,0])
Overview
bf-waspas extends WASPAS to handle Bipolar uncertainty. All arithmetic operations (normalisation, weighting, distance computation) are performed using Bipolar Fuzzy Set (BFS: positive membership μ⁺ ∈ [0,1], negative μ⁻ ∈ [-1,0]) algebra. The final scores are defuzzified via score (μ⁺ + μ⁻)/2 before ranking.
- Output
- utility, higher is better
- Data
- Bipolar Fuzzy, uncertainty tuples complete
- Weights
- Needs a weight source
- Size
- 2+ alternatives, 3-10 criteria works best
- Used for
- Bipolar Fuzzy MCDM, MAGDM under epistemic uncertainty, expert-driven evaluation with linguistic terms
How it works
- 1
Construct the bipolar fuzzy decision matrix. Each cell B_{ij} = (μ⁺_{ij}, ν⁻_{ij}) is a BFN with μ⁺ ∈ [0,1] and ν⁻ ∈ [-1,0].
Wei et al. 2018b - BFN definition; Zavadskas et al. 2012 - WASPAS structure
- 2
Normalize for criterion type. Benefit criteria unchanged; cost criteria complemented: (1 − μ⁺, |ν⁻| − 1).
Jana & Pal 2021, p.5 Eq.(7) - BF cost normalization
- 3
Weighted Sum Model (WSM) component using BFWA operator. BFWA yields a BFN for each alternative across all criteria.
Wei et al. 2018b, Eq.(4) BFWA; analogue of Zavadskas 2012 Eq.(2)
- 4
Weighted Product Model (WPM) component using BFWG operator. BFWG uses BFN geometric aggregation.
Wei et al. 2018b, Eq.(5) BFWG; analogue of Zavadskas 2012 Eq.(3)
- 5
Combine WSM and WPM components via BFN arithmetic. Scale each by λ and (1−λ), then add using BFN ⊕. Convert final BFN to crisp score Δ(Q_i)=(1+μ⁺+ν⁻)/2. Rank descending.
Wei et al. 2018b - BFN scalar mult Eq.(9), BFN addition Eq.(7), score Eq.(2); Zavadskas 2012 - WASPAS Eq.(5) structure
Fits when / Look elsewhere when
Fits when
- •Preserves bipolar_fuzzy uncertainty through the pipeline rather than premature crispification at elicitation
- •Native group-decision support (multi-DM aggregation built into the pipeline)
Look elsewhere when
- •Crisp data sufficient - use base WASPAS directly (avoid unnecessary uncertainty layer)
- •Aggregation operator (PFWA/PFOWA/etc.) not specified - output ambiguous
Assumptions to verify
- Decision matrix entries are valid Bipolar Fuzzy numbers/tuples
- Underlying crisp method's compensation assumption holds in uncertain space
- All decision-maker(s) and experts use the same linguistic/uncertainty scale
Limitations
- •Rank reversal known on alternative-set changes (ref: inherited from crisp base; cf. Belton-Gear 1983, Wang-Luo 2009)
Edge cases and pitfalls
Value-space violation: ensure all entries satisfy BFS: μ⁺ ∈ [0,1], μ⁻ ∈ [-1,0] before computation.
Defuzzification method affects ranking: score (μ⁺ + μ⁻)/2 is the canonical choice but alternatives exist.
Bipolar Fuzzy Set (BFS) ≠ 2-polar Fuzzy Set. BFS encodes a single attribute as a counter-property pair ⟨μ⁺ ∈ [0,1], μ⁻ ∈ [-1,0]⟩ (positive evidence vs negative evidence). A 2-polar Fuzzy Set encodes TWO INDEPENDENT attributes as a pair (μ₁, μ₂) ∈ [0,1]² - both non-negative, no counter-property semantics. Despite the superficial 'two component' similarity, the value spaces, arithmetic, and aggregation are distinct. For genuine independent-attribute m-polar problems with m=2, use the MPF-* method family (see MPF-ELECTRE-I.json) - not this Bipolar manifest. Reference: Chen et al. 2014 (m-polar foundations) explicitly contrast their construction with Zhang's 1994 bipolar fuzzy sets.
Works with
Commonly takes its weights from
How to cite
. UNCONFIRMED - no peer-reviewed BF-WASPAS-specific paper found via systematic literature search. PENDING.
System ID, as it appears in reports and the API
BF-WASPAS