VIKOR Algorithm – Comprehensive Guide

The VIKOR Method

Multi-Criteria Optimization and Compromise Solution

1. Introduction

The VIKOR method was developed to solve multi-criteria decision-making (MCDM) problems with conflicting criteria. The name is an acronym for Višekriterijumska Optimizacija I Kompromisno Rešenje.

The fundamental logic of VIKOR is to find a compromise ranking. It focuses on how close an alternative is to the “Ideal” solution. It uses two main concepts:

  • Maximum Group Utility: Pleasing the majority.
  • Minimum Individual Regret: Reducing the dissatisfaction of the “opponent.”

2. Mathematical Method

Step 1: Normalization

Determine the best \( f_i^* \) and worst \( f_i^- \) values for each criterion \( i \):

\[ f_i^* = \max_j f_{ij}, \quad f_i^- = \min_j f_{ij} \quad \text{(For Benefit Criteria)} \] \[ f_i^* = \min_j f_{ij}, \quad f_i^- = \max_j f_{ij} \quad \text{(For Cost Criteria)} \]

Step 2: Calculate \( S \) and \( R \)

For each alternative \( j \), compute the weighted normalized distance:

\[ S_j = \sum_{i=1}^{n} w_i \frac{(f_i^* – f_{ij})}{(f_i^* – f_i^-)} \] \[ R_j = \max_i \left[ w_i \frac{(f_i^* – f_{ij})}{(f_i^* – f_i^-)} \right] \]

Where \( w_i \) is the weight of the criterion.

Step 3: Calculate VIKOR Value \( Q \)

The final index is computed as:

\[ Q_j = v \frac{(S_j – S^*)}{(S^- – S^*)} + (1 – v) \frac{(R_j – R^*)}{(R^- – R^*)} \]

Where:

  • \( S^* = \min_j S_j, \quad S^- = \max_j S_j \)
  • \( R^* = \min_j R_j, \quad R^- = \max_j R_j \)
  • \( v \) is the weight for the strategy of “the majority of criteria” (usually \( 0.5 \)).

3. Numerical Solution

Consider 3 alternatives (A, B, C) evaluated against two criteria: Cost (w=0.6) and Quality (w=0.4).

AlternativeCost (Lower is better)Quality (Higher is better)
A$50080
B$80095
C$60070

Resulting Calculations

After applying the formulas, we obtain the following results:

Alt.\( S_j \) (Utility)\( R_j \) (Regret)\( Q_j \) (Index)Rank
A0.4000.4000.3332
B0.6000.6001.0003
C0.2000.2000.0001

Conclusion: Alternative C is the best compromise solution because it has the lowest \( Q \) value, representing the minimum distance from the ideal.

Built for Educational Purposes • VIKOR Mathematical Guide
Math Tools

Designed by: Dr. M.U. Mirza

Mathematical Researcher & Educator

Machine Learning Fuzzy Sets Computational Math Graph Theory
I am a researcher and mathematician dedicated to the study and application of advanced mathematical models. I offer research guidance and personalized video lectures for students and professionals seeking deep insights into mathematics and computational sciences.
📢 Academic Update: Currently seeking University Faculty positions or Post-Doc research opportunities worldwide.
Get Math Tutoring & Guidance
Scroll to Top