Keywords

1 Introduction

There are many complex problems which require handling a relatively significant number of opposing criteria to evaluate decision alternatives. Classical multi-criteria decision problem consists of three elements: a set of criteria, a set of the alternatives and criteria weights. For that kind of problems, Multi-Criteria Decision-Analysis (MCDA) methods help support decision-maker in the decision process. Applying the MCDA methods to the decision problem allows determining the most reliable solution for this particular decision problem [8].

The complete dataset about alternatives should be collected to use the MCDA method to solve a particular decision problem. However, in many real-life cases, we faced with uncertain or incomplete data. This problem could appear in different cases, for example, when we collect data from various sources, or when some values in the data just not provided [22, 26]. There are several methods, which decision-makers could apply to handle uncertain data, e.g., interval numbers [21], fuzzy numbers [5] and their generalizations [6, 23]. Besides, if a single criterion attribute is missing for a particular alternative, we have to consider all possible values from the domain [24].

The other problem to cope with in the decision-making process is a rank reversal paradox [1, 25]. It is a phenomenon of reversing alternative’s order in ranking when the set of alternatives is changed, e.g., alternative \(A_1\) which was better than \(A_2\) in the initial ranking could be worse than \(A_2\) in the ranking calculated after adding a new alternative. The most MCDA methods, such as Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS), Preference Ranking Organization Method for Enrichment Evaluation (PROMETHEE), VlseKriterijumska OptimizacijaI Kompromisno Resenje (VIKOR) are susceptible to this paradox [3, 7, 11]. Classical MCDA methods are modified in order to eliminate rank reversal paradox in them. However, there are also new methods created which were designed to eliminate rank reversal paradox in them, e.g., Ranking of Alternatives through Functional mapping of criterion sub-intervals into a Single Interval (RAFSI) [27], Characteristic Object METhod (COMET) [14] and Stable Preference Ordering Towards Ideal Solution method (SPOTIS) [4].

SPOTIS is a new MCDA method which aims to eliminate rank reversal paradox by design [4]. It is a simple method that uses reference objects to evaluate final preferences, similarly to COMET and TOPSIS methods. Unlike classic MCDA methods, such as TOPSIS, VIKOR and PROMETHEE, SPOTIS method requires criteria bounds to be defined. Using criteria bounds as reference objects allows distributing alternatives linearly between ideal positive and negative solutions. Thus SPOTIS method stays completely rank reversal free [4].

In this paper, we propose extending the SPOTIS method, which allows applying this method in the decision problems with incomplete or uncertain data using interval values. The proposed approach is based on using monotonic criteria, i.e., each criterion is profit or cost type. Moreover, we compare the proposed approach with two other MCDA methods that also use the reference objects’ concept, i.e., COMET and TOPSIS. In order to compare these three methods, we present two numerical study cases. The final preferences are determined based on interval number comparison according to priority degree. Finally, the rankings are compared using ranking similarity coefficients and literature reference results.

The rest of the paper is organized as follows: In Sect. 2, basic preliminary concepts on selected MCDA methods are presented. Section 3 introduces the proposed approach. In Sect. 4, we present and discuss two study cases that show the efficiency of the proposed approach. In Sect. 5, we present the summary and conclusions.

2 Preliminaries

2.1 TOPSIS

The Technique of Order Preference Similarity (TOPSIS) method measures the distance of alternatives from the reference elements, respectively, positive and negative ideal solution (PIS and NIS). This method was widely presented in [2, 12]. The TOPSIS method is a simple MCDA technique used in many practical problems. Thanks to its simplicity of use, it is widely used in solving multi-criteria problems. Below we present its algorithm [2]. We assume, that we have decision matrix with m alternatives and n criteria is represented as \(X = (x_{ij})_{m \times n}\).

Step 1. Calculate the normalized decision matrix. The normalized values \(r_{ij}\) calculated according to Eq. (1) for profit criteria and (2) for cost criteria. We use this normalization method because [13, 20] shows that it performs better than the classical vector normalization. However, we can also use any other normalization method.

$$\begin{aligned} r_{ij} = \frac{x_{ij} - min_j(x_{ij})}{max_j(x_{ij}) - min_j(x_{ij})} \end{aligned}$$
(1)
$$\begin{aligned} r_{ij} = \frac{max_j(x_{ij}) - x_{ij}}{max_j(x_{ij}) - min_j(x_{ij})} \end{aligned}$$
(2)

Step 2. Calculate the weighted normalized decision matrix \(v_{ij}\) according to Eq. (3).

$$\begin{aligned} v_{ij} = w_{i} \cdot r_{ij} \end{aligned}$$
(3)

Step 3. Calculate Positive Ideal Solution (PIS) and Negative Ideal Solution (NIS) vectors. PIS is defined as maximum values for each criteria (4) and NIS as minimum values (5). We do not need to split criteria into profit and cost here, because in step 1 we use normalization which turns cost criteria into profit criteria.

$$\begin{aligned} v^{+}_{j} = \{v^{+}_{1}, v^{+}_{2}, \cdots , v^{+}_{n}\} = \{ max_j(v_{ij})\} \end{aligned}$$
(4)
$$\begin{aligned} v^{-}_{j} = \{v^{-}_{1}, v^{-}_{2}, \cdots , v^{-}_{n}\} = \{ min_j(v_{ij})\} \end{aligned}$$
(5)

Step 4. Calculate distance from PIS and NIS for each alternative. As shows Eqs. (6) and (7).

$$\begin{aligned} D^{+}_{i} = \sqrt{ \sum ^{n}_{j=1} (v_{ij} - v^{+}_{j})^2 } \end{aligned}$$
(6)
$$\begin{aligned} D^{-}_{i} = \sqrt{ \sum ^{n}_{j=1} (v_{ij} - v^{-}_{j})^2 } \end{aligned}$$
(7)

Step 5. Calculate each alternative’s score according to Eq. (8). This value is always between 0 and 1, and the alternatives which got values closer to 1 are better.

$$\begin{aligned} C_i = \frac{D_{i}^{-}}{D_{i}^{-} + D_{i}^{+}} \end{aligned}$$
(8)

2.2 The COMET Method

The Characteristic Objects METhod (COMET) is based on fuzzy logic and triangular fuzzy sets. The COMET method’s accuracy was verified in previous works [15,16,17]. The formal notation of the COMET must be recalled based on [14]. Figure 1 presents the flowchart of the COMET method as summarizing.

Fig. 1.
figure 1

The procedure of the COMET method

Step 0. Initiate the process – it is a preparatory stage, which aims to identify the problem to be further analysed clearly. In the beginning, it is necessary to define the purpose of the research and determine the specificity of the MCDA problem. We should then select an expert or a group of experts whose task will be to select decision alternatives and criteria for their evaluation. After selecting a group of alternatives, a set of criteria that should be taken into account in the further analysis should also be selected.

Step 1. Definition of the space of the problem – the dimensionality of the problem is determined by the expert, which selecting r criteria, \(C_{1}, C_{2}, \ldots , C_{r}\). For each criterion \(C_{i}\), e.g., \(\{\tilde{C}_{i1}, \tilde{C}_{i2}, \ldots , \tilde{C}_{ic_{i}}\}\) (9) a set of fuzzy numbers is carefully selected:

$$\begin{aligned} \begin{gathered} C_{1}=\left\{ \tilde{C}_{11}, \tilde{C}_{12}, \ldots , \tilde{C}_{1 c_{1}}\right\} \\ C_{2}=\left\{ \tilde{C}_{21}, \tilde{C}_{22}, \ldots , \tilde{C}_{2 c_{2}}\right\} \\ \cdots \\ C_{r}=\left\{ \tilde{C}_{r 1}, \tilde{C}_{r 2}, \ldots , \tilde{C}_{r c_{r}}\right\} \end{gathered} \end{aligned}$$
(9)

where \(c_{1}, c_{2}, \ldots , c_{r}\) are the cardinality for all criteria.

Step 2. Generation of the characteristic objects – the characteristic objects (CO) are obtained with the usage of the Cartesian product of the fuzzy numbers’ cores of all the criteria (10):

$$\begin{aligned} CO = \langle C\left( C_{1}\right) \times C\left( C_{2}\right) \times \cdots \times C\left( C_{r}\right) \rangle \end{aligned}$$
(10)

As a result, an ordered set of all CO is obtained (11):

$$\begin{aligned} \begin{gathered} CO_{1} = \langle C(\tilde{C}_{11}), C(\tilde{C}_{21}),\ldots ,C(\tilde{C}_{r1}) \rangle \\ CO_{2} = \langle C(\tilde{C}_{11}), C(\tilde{C}_{21}),\ldots ,C(\tilde{C}_{r1}) \rangle \\ \cdots \\ CO_{t} = \langle C(\tilde{C}_{1c_{1}}), C(\tilde{C}_{2c_{2}}),\ldots ,C(\tilde{C}_{rc_{r}}) \rangle \end{gathered} \end{aligned}$$
(11)

where t is the count of COs and is equal to (12):

$$\begin{aligned} t=\prod _{i=1}^{r} c_{i} \end{aligned}$$
(12)

Step 3. Evaluation of the characteristic objects – the Matrix of Expert Judgment (MEJ) is determined by the expert, which comparing the COs pairwise. The MEJ matrix is presented as follows (13):

$$\begin{aligned} M E J=\left( \begin{array}{cccc} \alpha _{11} &{} \alpha _{12} &{} \cdots &{} \alpha _{1 t} \\ \alpha _{21} &{} \alpha _{22} &{} \cdots &{} \alpha _{2 t} \\ \cdots &{} \cdots &{} \cdots &{} \cdots \\ \alpha _{t 1} &{} \alpha _{t 2} &{} \cdots &{} \alpha _{t t} \end{array}\right) \end{aligned}$$
(13)

where \(\alpha _{ij}\) is the result of comparing \(CO_{i}\) and \(CO_{j}\) by the expert. The function \(f_{exp}\) express the individual judgement function of the expert. It is a representation of the knowledge of the selected expert, whose preferences can be presented as (14):

$$\begin{aligned} \alpha _{i j}=\left\{ \begin{array}{l} 0.0, f_{\exp }\left( C O_{i}\right) <f_{\exp }\left( C O_{j}\right) \\ 0.5, f_{\exp }\left( C O_{i}\right) =f_{\exp }\left( C O_{j}\right) \\ 1.0, f_{\exp }\left( C O_{i}\right) >f_{e x p}\left( C O_{j}\right) \end{array}\right. \end{aligned}$$
(14)

The number of query is equal \(p = \frac{t(t-1)}{2}\) because for each element \(\alpha _{ij}\) we can observe that \(\alpha _{ji}=1-\alpha _{ij}\). After the MEJ matrix is constructed, a vertical vector of the Summed Judgments (SJ) is obtained by using moudus ponens tautology as follows (15):

$$\begin{aligned} S J_{i}=\sum _{j=1}^{t} \alpha _{i j}\end{aligned}$$
(15)

Finally, the values of preference are estimated for each characteristic object, and a vertical vector P is obtained. The \(i-th\) row includes the estimated value of preference for \(CO_{i}\).

Step 4. The rule base—each characteristic object and its value of preference is converted to a fuzzy rule as (16):

$$\begin{aligned} IF ~~ C\left( \tilde{C}_{1 i}\right) ~~AND~~ C\left( \tilde{C}_{2 i}\right) ~~AND~~ \ldots ~~THEN~~ P_{i} \end{aligned}$$
(16)

In this way, a complete fuzzy rule base is obtained, which will then be used to infer alternatives’ evaluation.

Step 5. Inference and the final ranking – each alternative is represented as a set of values, e.g., \(A_{i} = \{\alpha _{i1},\alpha _{i2},\alpha _{ri}\}\). This set is addressed to the criteria \(C_{1}, C_{2}, \ldots , C_{r}\). Mamdani’s fuzzy inference technique is used to calculate the preference of the \(i - th\) decision variant. The constant rule base guarantees that the determined results are unequivocal, and it makes the COMET completely rank reversal free.

2.3 SPOTIS

Stable Preference Ordering Towards Ideal Solution (SPOTIS) is a new method for multi-criteria decision support [4]. The authors of this method aim to create a new method free of the Rank Reversal problem (the phenomenon of reversing the ranking when changing the number of alternatives in the input data). This method uses the concept of reference objects. Unlike other MCDA methods such as TOPSIS and VIKOR, which creates reference objects based on decision matrix, SPOTIS requires defining the data boundaries. Using data borders to define Ideal Positive and Ideal Negative Solution allows for a linear distribution of alternatives between IPR and INR and avoids ranking reversals.

To apply this method, data boundaries should be defined. For each criterion \(C_j\) the maximum \(S_{j}^{max}\) and minimum \(S_{j}^{min}\) bounds should be selected. Ideal Positive Solution \(S_{j}^{*}\) is defined as \(S_{j}^{*} = S_{j}^{max}\) for profit criterion and as \(S_{j}^{*} = S_{j}^{min}\) for cost criterion. Decision matrix is defined as \(X = (x_{ij})_{m \times n}\), where \(x_{ij}\) is attribute value of the i-th alternative for j-th criterion.

Step 1. Calculation of the normalized distances to Ideal Positive Solution (17).

$$\begin{aligned} d_{ij}(A_{i}, S_{j}^{*}) = \frac{|S_{ij} - S_{j}^{*}|}{|S_{j}^{max} - S_{j}^{min}|} \end{aligned}$$
(17)

Step 2. Calculation of weighted normalized distances \(d(A_i, S^*) \in [0, 1]\), according to (18).

$$\begin{aligned} d(A_i, S^*) = \sum _{j=1}^{N} w_j d_{ij}(A_i, S_{j}^{*}) \end{aligned}$$
(18)

Final ranking should be determined based on \(d(A_i, S^*)\) values. Better alternatives have smaller values of \(d(A_i, S^*)\).

This method has an alternative algorithm which is described in [4]. We describe and use this version because it is easier to understand, and both versions give identical results.

3 The Proposed Approach

An interval number is a set of real numbers with the property that any number that lies between two numbers included in the set is also included in the set. The interval of numbers between \(a^L\) and \(b^R\), including \(a^L\) and \(b^R\), is denoted [\(a^L\), \(b^R\)]. The two numbers \(a^L\) and \(b^R\) are called the endpoints of the interval. Interval numbers are used when an attribute has an indefinite or uncertain value. This entails analysing all the values from a given interval. Only one of the interval’s values is the unknown real value.

The SPOTIS method is designed to solve problems with crisp numbers. The values of the decision attributes will be converted to interval numbers, which will be noted as (19):

$$\begin{aligned} a_j=[\alpha ^{L}_j, \alpha ^{R}_j] \end{aligned}$$
(19)

where j means number of criterion. Each real number can be written as a degenerate interval numbers, i.e., \(\alpha ^{L}_j = \alpha ^{R}_j\). Let suppose there is no attribute value for an individual alternative in a given set of alternatives. In that case, the smallest and the biggest value in the criterion should be taken respectively. Each alternative will be written as an interval data set (20).

$$\begin{aligned} A = \{ [\alpha ^{L}_1, \alpha ^{R}_1],[\alpha ^{L}_2, \alpha ^{R}_2],...,[\alpha ^{L}_n, \alpha ^{R}_n]\} \end{aligned}$$
(20)

Note here that when evaluating an alternative with at least one attribute given in terms of an interval number that is not degenerate, the assessment result will always be returned as an interval number in the proposed approach. Also, for monotonic decision criteria, the lowest and the highest evaluation value will always be on the interval boundaries. Therefore, to calculate the resulting evaluation interval, it suffices to determine the set of alternatives \(A'\), which will arise as the Cartesian product of all interval boundaries of the form (21):

$$\begin{aligned} A' = \{ \{\alpha ^{L}_1, \alpha ^{R}_1\}\times \{\alpha ^{L}_2, \alpha ^{R}_2\} \times ... \times \{\alpha ^{L}_n, \alpha ^{R}_n\}\} \end{aligned}$$
(21)

The set of alternatives \(A'\) contains exactly \(2^n\) crisp alternatives which must be calculated by using SPOTIS algorithm. The final ranking’s left boundary is the lowest preference value determined from the set \(A'\), and the right boundary is the highest value.

4 Study Cases

In order to demonstrate the proposed approach, we have chosen two MCDA problems with interval data from recent studies, which are presenting in the Subsect. 4.1 and 4.2. Both topics deal with the assessment of electric vehicles, which is motivated by phasing out diesel and petrol engines in Europe. Many of these vehicles’ parameters are of an interval nature, demonstrating the superiority of the proposed approach.

4.1 Assessment of Electric Bikes

The first problem is the choice of the best electric bicycles for city transport. There is currently an increasing tendency to look for more sustainable transport solutions, especially in highly congested urban areas. It seems that electric bicycles can be a good option, as they allow more benefits than combustion cars. Because of missing data in the manufacturer’s specifications, we should apply interval MCDA methods to handle incompleteness in the data.

The alternatives used for this study case are adopted from [18]. Criteria used for the analysis are presented in the Table 1, where we can also find characteristic values, which are needed to be defined to use COMET and SPOTIS methods. Characteristic values are also needed to create intervals instead of missed data.

Table 1. The selected criteria \(C_1\)\(C_8\) and their characteristic values [18].

Table 2 presents chosen alternatives from the original study. Alternatives \(A_{1}\)\(A_{8}\) contains several interval attribute values and alternatives \(A_{9}\)\(A_{13}\) contains only real values. This selection of alternatives shows how the proposed approach works when only part of the alternatives have interval data.

The structured COMET approach was used in the original paper to solve the considered MCDA problem. In this study, we also use COMET, but with the monolithic approach [22]. This is because we assume that the structure of the problem is unknown to the decision-maker. We have used stochastic optimization methods to obtain preference values for CO from preference values from the alternatives [10].

Table 3 presents raw preference values calculated for each alternative by using three MCDA methods. For SPOTIS method, smaller values means better alternative, for other methods bigger values means better alternative. However, preference data alone is not sufficient for determining the rankings, as these intervals overlap to some extent, which poses a problem in unambiguously assessing the final ranking.

Table 2. The performance table of the alternatives \(A_1\)\(A_{13}.\)
Table 3. Considered alternatives and their results \(A_1\)\(A_{13}\).

We apply the approach described in [9] to obtain ranking values from interval data. Rankings from Table 3 are calculated in two steps: build comparison matrix for interval values using \(P(a \ge b)\) and then rank sums for each row of this matrix. This ensures obtained the most likely ranking.

The rankings obtained by the methods used are quite different. Alternative \(A_{13}\) has the first position in the reference ranking and the ranking obtained with interval SPOTIS and TOPSIS method. The COMET method placed this alternative in the third position in the ranking. Alternative \(A_{10}\) has first position in monolithic COMET ranking, but has lower values in other rankings. Alternative \(A_{8}\) has the second position in the reference ranking, where only COMET return the same position. It should be noted that both SPOTIS and TOPSIS have different ranked this alternative, but in the case of TOPSIS, the position is more distant. In order to comprehensively assess the similarity of the obtained rankings, \(r_w\) and WS values will be determined [19].

Table 4 presents \(r_w\) ranking correlation coefficient values. These values point out that ranking obtained monolithic COMET method is strongly correlated with reference ranking. Other two rankings, obtained with interval SPOTIS and interval TOPSIS methods have a high correlation between themselves, but the quite good correlation with reference ranking.

Table 4. Comparison of rankings using \(r_w\) coefficient.

Table 5 shows WS ranking similarity coefficient values. According to calculated values, ranking obtained with interval SPOTIS method is strongly correlated with the reference ranking. Ranking obtained using monolithic COMET approach also has a quite strong correlation with reference ranking. The last ranking obtained with interval TOPSIS method also has a good correlation with the reference.

Table 5. Comparison of rankings using WS coefficient.

4.2 Assessment of Electric Vans

An ecological footprint in the urban environment is made by urban freight transport. This problem has become the key challenge for all groups involved in freight transport in urban areas. Therefore electric vans should be considered as an alternative for combustion vehicles. The second study case is on assessing electric vans and the data with reference ranking for this investigation is taken from [26]. In the original study, the authors use PROMETHEE II and Fuzzy TOPSIS methods to rank electric vans for city logistic. In this work, we would use chosen alternatives from the original paper in order to demonstrate how efficient the proposed methods are.

Table 6 presents criteria description and characteristic values calculated from complete decision matrix. Characteristic values are necessary to determine when using COMET and SPOTIS methods. Criteria \(C_6\), \(C_7\) and \(C_9\) are cost type criteria and should be minimized. Other criteria are profit type.

Table 6. The selected criteria \(C_1\)\(C_9\) and their characteristic values.

Table 7 presents alternatives chosen from original work with criteria attributes values. Alternatives \(A_5\), \(A_6\) and \(A_9\) have only real number attributes, and the other alternatives have missed data which are substituted with intervals based on characteristic values from Table 6.

Table 7. Considered alternatives and their results \(A_1\)\(A_{10}\).

In the Table 8 calculated preference values are presented. Reference ranking is a ranking obtained with Fuzzy TOPSIS from the original work [26]. Next columns show preferences obtained with the proposed interval SPOTIS method, monolithic COMET, and interval TOPSIS method.

For obtained the rankings we use the same methodology as for Sect. 4.1, and rankings from Table 8 are calculated in two steps: build comparison matrix for interval values using \(P(a \ge b)\) and then rank sums for each row of this matrix. In this problem, obtained rankings are quite similar, according to the Table 8. Alternative \(A_{5}\) has the first position in all four rankings. Alternative \(A_{6}\) has the third position in the reference ranking and the second position in other rankings. Rank positions for alternative \(A_{2}\) are also similar: second position in the reference ranking and third position in other rankings.

Table 9 contains \(r_w\) ranking correlation coefficient values. Despite very similar first positions in rankings, correlations between reference ranking and other rankings are quite low. Other rankings have quite strong correlations between themselves.

Table 8. Vans preferences and rankings
Table 9. Comparison of rankings using \(r_w\) coefficient for vans.

Finally, Table 10 shows WS ranking similarity coefficient values calculated for obtained rankings. This values point that correlation is quite strong, because first positions in the ranking is more important when WS similarity coefficient is calculated. As we can see, the results obtained show that the interval SPOTIS method provides solutions comparable to other methods, while being very simple to apply.

Table 10. Comparison of rankings using WS coefficient for vans.

5 Conclusions

In this paper, we present a way to extend SPOTIS method to work with interval numbers which allow handling uncertainty and incompleteness in decision problems. We also compare the proposed approach with two other interval methods, COMET and TOPSIS to show how it performs in real-life decision problems.

The main contribution is providing an extension of the SPOTIS method, which is performed comparably with other interval methods. The main advantage of the SPOTIS method is its simplicity. The SPOTIS method consists of two simple steps, and the only additional requirement is defining criteria bounds. The study cases confirm it performs as good as COMET and TOPSIS methods, but it is much simpler to use than COMET and is also rank-reversal free, unlike TOPSIS. In order to compare the performance of these methods, the priority degree approach was used to build rankings. Then, the rankings were compared using rank correlation coefficients.

The future works may include

  • developing the more complex approach which would be possible to apply to any criteria types without limitations,

  • research of possibility using other number generalizations instead of interval numbers,

  • comparing the proposed approach with other MCDA methods.