Next Article in Journal
Optimization of Curtain Wall Production Line Balance Based on Improved Genetic Algorithm
Next Article in Special Issue
An Exploration of Prediction Performance Based on Projection Pursuit Regression in Conjunction with Data Envelopment Analysis: A Comparison with Artificial Neural Networks and Support Vector Regression
Previous Article in Journal
A Family of Truncated Positive Distributions
Previous Article in Special Issue
Fuzzy Weighted Pareto–Nash Equilibria of Multi-Objective Bi-Matrix Games with Fuzzy Payoffs and Their Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Hybrid EC-Promethee Method with Multiple Iterations of Random Weight Ranges: Applied to the Choice of Policing Strategies

by
Marcio Pereira Basilio
1,2,*,
Valdecy Pereira
2,* and
Fatih Yigit
3,*
1
Controladoria-Geral do Estado do Rio de Janeiro (CGE), Avenida Erasmo Braga, 118, Centro, Rio de Janeiro 20020-000, Brazil
2
Department of Production Engineering, Fluminense Federal University (UFF), Niteroi 24210-240, Brazil
3
Department of Industrial Engineering, Altinbas University, 34218 Istanbul, Turkey
*
Authors to whom correspondence should be addressed.
Mathematics 2023, 11(21), 4432; https://doi.org/10.3390/math11214432
Submission received: 8 September 2023 / Revised: 20 October 2023 / Accepted: 23 October 2023 / Published: 26 October 2023

Abstract

:
The decision-making process is part of everyday life for people and organizations. When modeling the solutions to problems, just as important as the choice of criteria and alternatives is the definition of the weights of the criteria. This study will present a new hybrid method for weighting criteria. The technique combines the ENTROPY and CRITIC methods with the PROMETHE method to create EC-PROMETHEE. The innovation consists of using a weight range per criterion. The construction of a weight range per criterion preserves the characteristics of each technique. Each weight range includes lower and upper limits, which combine to generate random numbers, producing “t” sets of weights per criterion, allowing “t” final rankings to be obtained. The alternatives receive a value corresponding to their position with each ranking generated. At the end of the process, they are ranked in descending order, thus obtaining the final ranking. The method was applied to the decision support problem of choosing policing strategies to reduce crime. The model used a decision matrix with twenty criteria and fourteen alternatives evaluated in seven different scenarios. The results obtained after 10,000 iterations proved consistent, allowing the decision maker to see how each alternative behaved according to the weights used. The practical implication observed concerning traditional models, where a single final ranking is generated for a single set of weights, is the reversal of positions after “t” iterations compared to a single iteration. The method allows managers to make decisions with reduced uncertainty, improving the quality of their decisions. In future research, we propose creating a web tool to make this method easier to use, and propose other tools are produced in Python and R.

1. Introduction

Making decisions is an action that permeates human life. Some decisions are simple, like choosing which tie to wear. Others are complex and impact the lives of people, organizations, economies, and countries, like selecting a policing strategy to reduce the crime rate. Deciding implies making choices that are not always easy to make. The decision maker is not immune to macro-environment variables and can be influenced by organizational and personal objectives. Over the last four decades, researchers have developed and applied decision support methods that allow large volumes of information to be systematized, presenting the decision maker with the alternatives that, when compared pair-by-pair and criterion-by-criterion under the influence of weights, are best classified.
Basilio et al. [1] affirm that MCDA methods solve decision-making problems in various areas, including information and communication technology, business intelligence, environmental risk analysis, water resources management, remote sensing, flood risk management, health technology assessment, climate change, energy, international law, human resources policy, financial management, supplier selection, e-commerce and mobile commerce, agriculture and horticulture, chemical and biochemical engineering, software evaluation, flood risk management, health, transportation research, nanotechnology research, climate change, energy, human resources, financial management, performance and benchmarking, supplier selection, chemical and biochemical engineering, education and social policy, and public safety.
In their research, Basilio et al. [1] report that AHP, TOPSIS, VIKOR, PROMETHEE, and ANP are the methods most frequently used by authors in their respective studies. An essential issue in the decision-making process that profoundly impacts the evaluation of alternatives is the weights to be assigned to the criteria. Experts classify weighting methods as objective, subjective, and hybrid [2]. The AHP [1,3] is the method most researchers use when integrating methods for measuring weights with methods for ordering alternatives. This is followed by DEMATEL [4], SWARA [5,6,7], ANP [4], ENTROPY [8], CRITIC [9], BWM [10], CILOS [11], IDOCRIW [11], FUCOM [12,13], LBWA [14], SAPEVO-M [15], and MEREC [16,17]. From the taxonomy described by Ayan [2], we can infer that hybrid weight measurement methods are used to find a resulting position between the techniques used. However, generating a weight for each criterion reduces a certain degree of uncertainty, which, when inserted into the ordering method, will produce a ranking of the alternatives.
This study aims to combine objective and subjective methods, not to produce a single weight per criterion. Instead, this study aims to build a weight range for each criterion, preserving the characteristics of each technique. Each weight range comprises lower and upper limits, which can be combined to generate random numbers, producing “t” sets of weights per criterion, and making it possible to obtain “t” final rankings. The alternatives are given a value corresponding to their position in each ranking generated. At the end of the process, they will be ranked in descending order, thus obtaining the final definitive ranking. In this way, managers can analyze the behavior of each alternative throughout the process, and the final ranking will be more consistent due to the incorporation of the variations observed due to the influence of the weight of the criteria on the alternatives. In this study, we chose the ENTROPY-CRITIC methods and the weights generated by the decision makers to deal with the problem of selecting a policing strategy to reduce crime rates.
The CRITIC method aims to define weights by using the contract intensity and the conflicting character of the evaluation criteria. The CRITIC method is proposed by Diakoulaki et al. [18]. CRITIC is one of the most frequently used objective methods for criterion weight determination [9]. Since its first introduction, research has focused mainly on two topics. The first area aims to improve the CRITIC model, and the improvements focus on the normalization procedure. The studies focus on using vague information by employing fuzzy logic and alternative similarity and distance measures. By utilizing different approaches, new studies are performed. Normalization procedures are performed using various methods; to name a few, employing fuzzy logic [19], logarithmic normalization [20], and alternative rankings [21] are used. Another point for improvement is the weighting technique. The model is limited to deficiency in capturing the correlation between criteria [22]. A recent study employed a new D-CRITIC approach to overcome this limitation [9]. The proposed research aims to integrate different strategies to overcome such constraints using a hybrid system.
Another approach used for weight determination is the entropy approach. Entropy is based on a different discipline. The technique has its origins in the field of Thermodynamics [23]. The entropy approach was proposed first by Clausius [24]. Shannon and Weaver [25] proposed the entropy concept. The method employs a measure of uncertainty in information formulated regarding probability theory. The entropy method evaluates the relative contrast intensities of the criteria [23]. The approach does not consider the decision makers but the value of each alternative per criterion.
Since its introduction, the entropy model has been applied in different areas. To name a few, cryptocurrency evaluation [26], supplier selection [23], study of poverty alleviation [27], and industrial arc robot selection [28]. Other studies have focused on improving the entropy method. Szmidt and Kacprzyk [29] proposed an entropy measure for intuitionistic fuzzy sets (IFS) that was extended. The difference between normalized Euclidean distance and normalized Hamming distance is investigated. A new entropy method was proposed by Liu and Ren [30], which considered both the uncertainty and hesitancy degree. Thakur et al. [31] proposed a new approach using the COPRAS Model under IFS. As the literature shows, entropy is used in calculating weights [32].
The second stage of the proposed model uses the PROMETHEE approach to classify the alternatives. This model was proposed by Brans et al. [33]. A few years later, several versions of the PROMETHEE methods were developed such as PROMETHEE III, PROMETHEE IV, PROMETHEE V [34], PROMETHEE VI [35], PROMETHEE GDSS [36], and the GAIA interactive visual module for graphical representation [37]. These versions were developed to help with more complicated decision-making situations [38]. Like other methods, applications in new areas are carried out simultaneously, including cryptocurrency portfolio allocation [39], a barrier assessment framework for carbon sink project implementation [40], and an application of hybrid composites [41].
The motivation for developing the proposed model is based on the need to reduce uncertainty in the decision-making process without dehumanizing the process. The proposed method combines objective and subjective methods to strengthen the results presented to the decision maker. The methods chosen are widely disseminated among the scientific community and are easy to understand and implement. The concept used allows for expansion and integration with other methods. By using hybrid approaches, the results are supposed to be more efficient and balance the subjectivity of the decision makers. EC-PROMETHEE does not use combined weights between the three methods. However, it will operate with a range of weights based on the upper and lower limits of the values obtained in the three methods. The final ranking will not be accepted by applying a single set of weights, but with “m” iterations using a set of random weights produced within the respective weight ranges, criterion by criterion.
In this article, we will revisit the research developed by Basilio et al. [42,43,44,45], which dealt with identifying and choosing policing strategies customized to local criminal demands. The research was conducted in Rio de Janeiro, Brazil, and analyzed the criminal demand from 2016 to 2019. The authors used the PROMETHEE method, Electre IV, and Electre I to identify the most appropriate policing strategies for the observed criminal demands. At the time, the researchers used equal weights for each criterion. In the present research, we seek to answer the question: how can using objective weighting methods influence the ranking of policing strategies in the case studied? In response, the authors developed the EC-PROMETHEE method, which combines objective and subjective methods of weighting criteria, implementing a range of weights for criteria, and defining the final ranking from a certain number of iterations.
This article is divided into five parts. The first part is described above, where we contextualize concepts about the multi-criteria methods used and the importance of decision-making in the decision-making process, and present the problem that will be studied. Then, in the second section, we will describe the methods and algorithms we will use to solve the problem. In the third section, we describe the results found. In the fourth section, we present the discussions about the nuances of the new method concerning the traditional models. Finally, in the fifth section, we will conclude the research report and indicate possibilities for future research.

2. Materials and Methods

This section presents the concepts for formulating the hybrid EC-PROMETHEE method. Figure 1 illustrates the description of the proposed method by subdividing it into eight steps.
Step 1—Identification of criteria
In the first stage, we identified twenty criteria. The specified criteria are taken from the studies of Basilio and Pereira [42,43,44,45,46,47,48]. The criteria show the most recurrent types of crime, misdemeanors, and urban disorder. The Public Security Institute (ISP) performs statistical analysis and monitoring. Table 1 shows the list of crime types used in the proposed modeling.
Step 2—Identification of alternatives
Table 2 shows fourteen policing strategies taken from the study carried out by Basilio et al. [42,43,44,45,46]. The data presented in Table 2 originates from the literature review produced by Basilio et al. [48].
Step 3—Construction of the decision matrix
In this step, we will use the data from the research reported by Basilio et al. [42,43,44,45,46,47], which were obtained by applying 430 questionnaires to decision makers distributed at the strategic, tactical, and operational levels of the Military Police of the State of Rio de Janeiro. The reported research covered thirty-nine operational units in the State of Rio de Janeiro/Brazil territory. The questionnaire obtained the decision makers’ perception of the effectiveness of policing strategies (Table 2) in impacting criminal demands (Table 1). The researchers used a five-point Likert scale to systematize the collection of respondents’ perceptions. The scale was established as follows: (5) contribute an extreme amount; (4) contribute very much; (3) contribute moderately; (2) contribute little; (1) contribute very little. The data were subjected to descriptive statistical treatment, and the statistical measure of the central tendency “mode” was used to identify the predominant perception of the respondents regarding the set of evaluations performed [42].
In the current research, in addition to the “mode”, we will use other measures, such as the average, median, consensus_mode, consensus_average, consensus_median, and the Likert scale, to increase the information power of each alternative and verify how they influence the final ordering of policing strategies. Table 3, Table 4, Table 5, Table 6, Table 7, Table 8 and Table 9 show the data used in the decision matrices used in the proposed model.
Step 4—Calculation of the weights of the criteria
Weight denotes the importance of each criterion in the decision-making process. Changes in criteria weight may lead to different results. Thus, selecting a suitable method for assigning accurate weights to different criteria is crucial [3]. Subjective, Objective, and Integrated weighting methods are some of the different methods used for assigning weights [50]. In subjective weighting methods, experts’ opinions are used. The main disadvantages are that it is time-consuming and may offer conflicting opinions, according to Mahajan et al. [51]. The analytic Hierarchy Process (AHP) is a widely used method for subjective weighting. It uses pairwise comparison questions to elicit a matrix of relative preference judgments between each pair of alternatives with respect to each criterion, and a matrix of relative importance of each criterion. The judgements are derived from nominal group discussions or the Delphi technique, which may result in bias [51]. With the increase in the number of criteria, pairwise comparisons increase, resulting in hefty computation. Due to these limitations, the current study proposes the use of objective weighting methods. Weights are derived using mathematical computation without the intercession of a decision maker when objective weighting methods are employed. Entropy method, Criteria Importance Through Intercriteria Correlation (CRITIC method), and FANMA method are among the most commonly used methods for objective weighting methods [13,50,51]. In this article, we have considered the Entropy and CRITIC methods to assess the criteria weights.
Step 4.1 The ENTROPY method
The criteria weights are based on the predefined decision matrix that includes the information regarding the set of alternatives. Entropy in information theory is a model for the uncertainty volume served by a discrete probability distribution [51,52]. Salwa et al. [53] used the entropy method to calculate criterion weight to select optimal starch as the matrix in green composites for single-use food packaging applications [53]. The Entropy of the normalized decision matrix (NDM) criterion is given in Equation (1):
E j = i = 1 m P i j l n P i j l n m ; j = 1,2 , , n   a n d   i = 1,2 , , m
where P i j is NDM, which is given by Equation (2):
P i j = x i j i = 1 m x i j ; j = 1,2 , , n   a n d   i = 1,2 , , m
where x i j corresponds to the criteria value for each alternative in DM. The criteria weight, W j E can be calculated using Equation (3):
W j E = 1 E j j = 1 n 1 E j ; j = 1,2 , , n
where 1 E j denotes the degree of diversity of the information in the jth criterion outcome.
Step 4.2 The CRITIC method
In this section, the researchers briefly describe the CRITIC method. The CRITIC method proposed by [52] aims to determine the criteria weights. The main stages of this technique are described below:
Step 4.2.1. A decision matrix, Z, with m rows as the number of alternatives and n column as the number of criteria, is defined by Equation (4):
Z = r i j m x n ; i = 1 , , m ; j = 1 , , n
where r i j is the correlation of the ith alternative and of the jth criterion.
Step 4.2.2. Each criterion can be considered beneficial or non-beneficial [54,55,56]. A criterion takes value in some bounded range. Sharkasi and Rezakhah [22] assert that for a beneficial, j F + , the criterion is normalized by dividing its distance from the minimum value by the length of the range. In contrast, a non-beneficial one, j F , is normalized by dividing its distance from the maximum value by the length of the range. The elements of the decision matrix are normalized as given in Equations (5) and (6) for the positive or beneficial criteria and the negative or non-beneficial ones.
x i j + = r i j r j r j + r j ; i = 1 , , m ; j = 1 , , n   i f   j F +
x i j = r j + r i j r j + r j ; i = 1 , , m ; j = 1 , , n   i f   j F
where r j + = m a x r 1 j , r 2 j , , r m j and r j = m i n r 1 j , r 2 j , , r m j , and x i j which is either x j + or x j represents the normalized value of the i j element of the decision matrix.
Step 4.2.3. The Pearson correlation coefficient between two criteria, j and k, is computed as Equation (7)
ρ j k = i = 1 m x i j x j _ x i k x k _ i = 1 m x i j x j _ 2 i = 1 m x i k x k _ 2
where x j _ and x k _ represent the mean of jth and kth criteria Equation (8):
x k _ = 1 n i = 1 m x i k ; k = 1 , , n .
The Pearson correlation coefficient captures linear correlations.
Step 4.2.4. The standard deviation of each criterion is estimated by Equation (9):
σ j = 1 n 1 i = 1 m x i j x j _ 2 ;     j = 1 , , n
Step 4.2.5. The index of the jth criteria, Ej, is evaluated by Equation (10)
E j = σ j k = 1 n 1 ρ j k ; j = 1 , , n .
Step 4.2.6. The weights of the criteria are determined by Equation (11)
W j C = E j j = 1 n E j ; j = 1 , , n .
Finally, the ranking of the weights of the criteria is obtained. The ranking identifies the importance given to each criterion.
Step 5—Definition of the lower and upper limits of the weights per criterion
After generating the weights of each criterion using the Entropy and CRITIC methods, which constitute the objective methods, the model opens the door to input weights from subjective methods, which can be obtained by a single decision maker or a group of decision makers, with or without the use of subjective methods [2] such as AHP; SAPEVO-M; FUCOM; and MEREC among others.
In this step, we define the lower-limit vector. L l j where criterion j will store the smallest weight value obtained from the set of values formed by { W j E , W j C , W j D M } , as shown in Equation (12)
L l j = M i n { W j E , W j C , W j D M }
Next, we will define the upper limit vector. U l j , which for each criterion j will store the highest weight value obtained from the set of values formed by { W j E , W j C , W j D M } , as shown in Equation (13)
U l j = M a x { W j E , W j C , W j D M }
Step 6—Random generation of “t” sets of weights by criteria
The Randomised Weight Matrix RWm of dimension t × n will be generated in this phase where t is the total number of rows, corresponding to the total number of iterations inserted in the model by the decision maker, and where n is the total number of columns of the matrix. The RWm matrix is obtained by generating different random numbers limited for each criterion by the limits L l j and U l j , as shown in Equation (14):
R W m i j = U l j L l j * R n d + L l j )
Next, the matrix R W m i j is normalized by Equation (15):
R W m i j n = x i j j = 1 n x i j
Step 7—Generation of “t” ranking with the PROMETHEE method
The literature identifies seven types of methods that integrate the PROMETHEE family [33,57], as recorded in recent research: PROMETHEE I [58]; PROMETHEE II [59,60]; PROMETHEE III; PROMETHEE IV; PROMETHEE V [61]; PROMETHEE VI [62]; and PROMETHEE GAIA [63].
The PROMETHEE II method consists of constructing an outranking relation of values. As Fontana and Cavalcante [64] state, the main advantage of PROMETHEE II is that it is a relatively simple ranking method in design and application compared to other multi-criteria analysis methods. It is well suited to issues where a finite number of alternatives should be ranked considering criteria. This method stands out since it seeks to involve concepts and parameters with some physical or economic interpretation, easily understood by the decision maker.
In their research, 217 papers are analyzed by Behzadian et al. [65] identifying studies that applied the PROMETHEE method. The following areas are given as fields of study: Environment Management, Manufacturing and Assembly, Hydrology and Water Management, Chemistry Logistics and Transportation, Business and Financial Management, Energy Management, and Social and Public Security.
The method is implemented in five steps. In the first step, there is a function showing the decision makers’ preference concerning share “a” compared with share “b”. The second step compares the suggested alternatives to the pairs for the preference function. The PROMETHEE proposes the six following types (shapes) of preference functions, as shown in Table 10:
As a third step, the results of this comparison are presented in an evaluation matrix as the estimated values of each criterion for each alternative. The classification is performed in two final steps: a partial ranking in the fourth step and then a total ranking of alternatives in the fifth step, as follows:
Step 7.1. Determination of deviations based on pairwise comparations
d j a , b = g j a g j b
where d j a , b denotes the difference between the evaluations of a and b on each criterion.
Step 7.2. Application of the preference function
P j a , b = F j d j a , b       j = 1 , , k
where P j a , b denotes the preference of alternative a with regard to alternative b on each criterion as a function of d j a , b .
Step 7.3. Calculation of an overall or global preference index
a , b ϵ A ,     π a , b = j = 1 k P j a , b w j
where π a , b of a over b is defined as the weighted sum P j a , b of for each criterion and w j is the weight associated with the jth criterion.
Step 7.4. Calculation of outranking flows/The PROMETHEE II partial ranking
φ + a = x A π a , b
And
φ a = x A π b , a
where φ + a and φ a denotes the positive outranking and negative outranking flow for each alternative, respectively.
Step 7.5. Calculation of net outranking flow/The PROMETHEE II complete ranking
φ a = φ + a φ a
where φ a denotes the net outranking flow for each alternative.
Step 8—Definition of final ranking
In this step, we present the second novelty of this new method. In step 6, we present the matrix. The matrix R W m i j n contains t sets of weights per criterion. The innovative point of this method is to generate t sets of rankings as different sets of weights are used, varying within the range of weights for each criterion, as dealt with in Step 5. In this sense, φ(a) is transformed into an ordinal value. The φ(a) is sorted in descending order, assigning 1st place to the alternative (a) that has the highest φ(a), and so on until the last alternative m. The final ranking matrix FRm is of dimension t x m, where m is the number of columns composed of each alternative (a). Where “t“ is the number of rows representing the ranking generated by the PROMETHEE method for each iteration, a i j is the ordinal value of the ranking that alternative “j” obtained in iteration “i”, as shown in Equation (22):
F R m i j = a i j , i = 1 , 2 , , t   a n d   j = 1 , 2 , , m
Then, the value of each rank-ordering a i j will be replaced by a score, as follows: 1st = m, 2nd = (m – 1), …, nth = –m − –m − 1). Thus, the final ranking vector FRv of dimension j is obtained. The final position of each alternative will be obtained by summing the scores of the t iterations of each alternative, as shown in Equation (23):
F R v j = i = 1 t F R m i j ,   j = 1 , 2 , , m
The final ranking will be obtained in descending order among the total scores of each alternative j of the vector F R v j .

3. Results

In this section, we report the results found by applying the EC-PROMETHEE model to the problem of policing strategies and compare them with the results obtained in previous research [42]. In addition to the comparison, we address another latent issue: constructing the decision matrix. In this case, in addition to the statistical measure “Mode”, we used the mean, median, consensus concept, and the Likert scale, as shown in Table 3, Table 4, Table 5, Table 6, Table 7, Table 8 and Table 9.
Initially, we emulated the model with the parameters common to those used in Basilio et al. [42] to maintain the comparison conditions, as described in Table 11.
Following the model illustrated in Figure 1, we obtained the criteria and alternatives described in Table 1 and Table 2, corresponding to steps 1–2. In step 3, we used Table 3, Table 4, Table 5, Table 6, Table 7, Table 8 and Table 9 as decision matrices to evaluate and compare different biases. In the fourth step, we introduced the values of the decision matrices from Table 3, Table 4, Table 5, Table 6, Table 7, Table 8 and Table 9 and the parameters in Table 11, and employed Algorithm (Appendix A), which executed Equations (1)–(11) and obtained the weights of the Entropy and CRITIC method, which are the input variables for steps 5 and 6 of the model, as recorded in Table 12.
In step 5, after obtaining the weights using the Entropy and CRITIC methods and with the external input of the weights of the decision makers (Table 11), we applied Equations (12) and (13) and the definition of the lower and upper limits of the weights per criterion, as shown in Table 13.
In step 6, with the data input from step 5, Equations (14) and (15) were applied to generate t iterations of weights for each criterion. In the proposed solution to the problem, we used t = 10,000 iterations. In this sense, a matrix of weights was generated with a total of 10,000, which will be applied using the PROMETHEE method to generate the final ranking. Figure 2, Figure 3, Figure 4 and Figure 5 show the set of weights and how they vary between the scenarios used in this study.
In step 7, we introduced the criteria, alternatives, decision matrix, weight matrices, and parameters into the PROMETHEE method. We ran Equations (16)–(21) in t = 10,000 iterations and obtained the t ranking for each scenario proposed in this study. We then applied Equations (22) and (23) and the rules prescribed in step 8 and obtained the final ranking for each scenario, as shown in Table 14. We then calculated the standard deviations of the t iterations of each criterion in all the proposed scenarios, as shown in Figure 6. Finally, we calculated the Spearman correlation between the final rankings for each scenario, as shown in Table 15.
Regardless of its complexity, the decision-making process involves identifying criteria and alternatives and obtaining the weights for each criterion. The definition of criteria weights is a critical stage in decision-making, as they can influence the final result. The literature presents readers with three methods for defining criteria weights: objective, subjective, and hybrid. Around this discussion is a current of thought that proposes reducing the discretionary power of the decision maker, assigning this task to mathematical methods, such as the CRITIC, ENTROPY, and SWARA methods. On the other hand, some experts claim that the subjectivity of the decision maker’s discretion is fundamental, as it comes with the added layer of experience, culture, information, maturity, and underlying knowledge of the business that mathematical methods cannot measure, such as AHP SAPEVO. However, a third stream of researchers has combined the concepts of objective and subjective methods to form a third stream: the hybrids. These use mathematical methods associated with the weights assigned by the decision makers or group of decision makers. EC-PROMETHEE is a flexible method, as it can take on the role of an objective method and use only the combination of the ENTROPY (E) and CRITIC (C) methods to obtain the range of weights. However, it can also add weights generated by subjective methods or even weights assigned directly by the decision makers to be classified as a hybrid method. We believe that EC-PROMETHEE is inaugurating a fourth class of methods, which we call flexible.

Sensitivity Analysis of EC-PROMETHEE

In this section, the sensitivity analysis of the model proposed in the research was based on the methodology applied by Basilio et al. [42]. The sensitivity analysis was carried out using the script described in Appendix A. In each scenario, an alternative was removed, and the behavior of the others was verified. Then, the dropped alternative was reintroduced into the model, another alternative was dropped, and the process restarted until the last alternative was tested. After that, the results were analyzed and checked for order reversal and the model’s sensitivity to changes. Seven scenarios were created from the data in Table 3, Table 4, Table 5, Table 6, Table 7, Table 8 and Table 9. The process was carried out sequentially from alternative “a1” to “a14”. The expected result was that when an alternative is removed, the subsequent alternatives in the ranking improve one position, and the previous alternatives do not change their positions. Table 16 and Figure 7 illustrate the sensitivity analysis considering the seven scenarios used to emulate EC-PROMETHEE. The authors decided to conduct this analysis based on the percentage changes expected throughout the process. The percentage was defined as follows: Considering the “n” position in the ranking of the alternative obtained in each scenario, we inferred that the number of changes predicted would be equal to (n − 1) throughout the process in each scenario. The percentage is obtained by dividing (n − 1) by the total number of alternatives in the model minus the subtracted alternative. Table 16 shows the values found. The values highlighted in yellow represent that the alternatives do not align with the expected values. We can infer that the total changes correspond to twenty-seven percent of the process. In particular, we can say that the changes observed do not invalidate the final rankings of each scenario, as the main positions have remained the same in the case of the first and second positions (a6 and a7). Nine of the fourteen alternatives only displayed a change from the expected value in the proposed scenarios, which are as follows: “a1”; “a4”; “a6”; “a7”; “a8”; “a11”; “a12”; “a13”; and “a14”. As with the first positions, the last ones were also preserved from the eleventh to the fourteenth, as we can see by looking at the alternatives “a14” > “a1” > “a8” > “a4”. The greatest instability occurred in the middle positions of the ranking. Concerning the proposed decision matrix construction scenarios, we can say that the “Likert-Scale” and “Average” scenarios only saw one change in position. However, the “Consensus_Mode” and “Mode” scenarios had the biggest changes—seven and six positions, respectively.

4. Discussion

In this paper, we revisited the problem of planning policing strategies to reduce crime in a given locality. The relevance of this topic is based on the impact of crime reduction on the social and economic life of cities. Our research used the data shared by Basilio et al. [42], in which they applied the PROMETHEE II method and obtained the following final ranking: a6 > a7 > a12 > a9 > a11 > a5 > a10 > a13 > a2 > a3 > a14 > a1 > a8 > a4. A detail that needs to be noted is that Basilio et al. [42] used the statistical measure “Mode” in constructing their decision matrix. In the current proposal, the researchers used six other measures (Table 4, Table 5, Table 6, Table 7, Table 8 and Table 9) based on the questionnaire data used by Basilio et al. [42]. The initial motivation for using these measures was to check the stability of the final composition of the ranking. The stability can be seen in Table 15, which shows the result of the Spearman correlation between the proposed models, which we will discuss later.
The primary difference between the model applied in Basilio et al. [42] and the model proposed in this paper is that equal weights were applied to each criterion, as indicated in the eighth column of Table 11. Figure 1 illustrates that in the EC-PROMETHEE model, we combined two objective methods to obtain the weights for each criterion, which can be associated with the results of subjective methods or direct data input from the decision makers’ evaluation. In the current case, to maintain parity in the analysis between the two results, we inserted the weights used by Basilio et al. [42], which consisted of equal weights for each criterion, as shown in Table 11. The weights generated provided the random weight generation model with inner and upper limits, which allowed us to obtain the weight ranges. Table 12 shows the weights obtained in the model, and Table 13 shows the lower and upper limits. Table 13 shows that the limits comprise the values corresponding to the methods used. The limits integrate the information in the objective methods and the intrinsic knowledge of each decision maker. This combination is a new development compared to the other models, which combine objective methods only to obtain weights. In the proposed method, working with a range of weights, the model can observe the consistency of the final rankings through t iterations. In Figure 2, Figure 3, Figure 4 and Figure 5, the reader can see how the weights were generated and behaved for each criterion in the boxplot graphs. We can see that because the decision matrices differ, the weights generated behave differently.
Table 14 shows an overview of the final ranking in the seven proposed scenarios. Graphically, we can see how each alternative behaved over the 10,000 iterations with the set of weights. We can see that there were changes in the ranking of the alternatives in at least one of the scenarios. Based on the information recorded in the tenth line of Table 14, which corresponds to the final ranking of the evaluation of policing strategies according to criminal demand in the city of Rio de Janeiro, Brazil [43], the authors considered equal weight for the criteria and the decision matrix was built based on the Mode statistical measure. We then compared it with the result of the ninth row, in which we kept the same decision matrix but applied the random weight range with 10,000 iterations, which was the innovation proposed in the EC-PROMETHEE model, and found that there were changes in position between the fifth and sixth positions and changes in position between the ninth and twelfth positions.
In contrast, the first four positions of the original ranking remained unchanged, as did the last and penultimate positions. This result demonstrates that when the decision maker integrates objective and subjective methods for obtaining criteria weights and starts working with a set of weights obtained randomly within the upper and lower limits established by integrating methods for obtaining weights, combined with a strategy of emulating “t” iterations, the distortions in the ranking can be observed with just one weight and one iteration of the original method. In this way, EC-PROMETHEE generates a more consistent ranking, which makes it easier to choose the best alternatives for solving a problem. A second point we would like to highlight in this research concerns the choice of statistical measure for processing data from questionnaires designed to build a decision matrix. The statistical measure used to represent the perception of a group of experts on a given topic, in this case, the policing strategies that have the greatest impact on reducing a given criminal demand, directly affects the ranking of the alternatives evaluated. This is shown in Table 14. In general, there will be changes in the rankings of all the measures chosen. Analyzing the first four positions in the ranking, we can say that compared with the model presented by Basilio et al. [42], there was no reversal of position using the following scales: Consensus_Median, Likert_Scale, Average, and Mode. In the Consensus_Average measure, we observed a reversal between the third and fourth positions in the ranking. Concerning the median positions in the ranking, all the scales showed changes. Regarding the final section of the ranking, the scales produced with the following statistical measures remained unchanged between the 11th and 14th positions: Consensus_Median, Consensus_Average, Likert_Scale, Median, and Average.
Figure 6 shows a graphical representation of each scenario’s standard deviations from the 10,000 iterations. From this data, we can see that there are primarily changes between positions in the ranking. This information corroborates the proposal of the new EC-PROMETHEE method, which reinforces the consistency of the final ranking, offering decision makers greater certainty in the decision-making process and reducing the uncertainty of the decision-making process. Table 15 shows the Spearman correlation between the final rankings for each scenario. The final ranking of the results of the research reported by Basilio et al. [42] compared to EC-PROMETHEE’s “Mode” scenario shows a Spearman correlation of 0.96044. This is a high correlation, but with a change in ranking. Sperman’s correlation reveals to the decision maker that the choice of statistical method to systematize the information from the questionnaires influences the decision-making process in the final definition of the ranking of alternatives. Among the proposed scenarios, we can say that only the Likert Scale and Average had the same ranking. In the other scenarios, we had high correlations ranging from 0.84–0.98, which reaffirms that the choice of measurement for constructing the decision matrix in the case of obtaining data through questionnaires, combined with the choice of methods for obtaining weights, can influence the final ranking of the alternatives.

5. Conclusions

Over the last four decades, studies and applications of multi-criteria methods to support decision-making in various branches of science and organizations have multiplied. If one word can define the current state-of-the-art in operations research about decision support methods, it would be integration.
Specifically, concerning the central theme of this article, which is the integration of objective and subjective techniques for assigning weights to criteria, we can say that in recent years, we have seen the integration of weighting methods with classical methods. Along these lines, we have also seen the combination of weighting methods to reduce existing uncertainty. In this case, we used the objective methods ENTROPY and CRITIC to obtain their respective weights associated with the subjective weights derived from the decision makers’ evaluation. The difference is that we didn’t reduce the information from these three inputs into a single weight value for each criterion. Instead, we created a weight range for each criterion.
These weight ranges have lower and upper limits which were defined based on the values obtained in each method. The lower limit is the lowest value obtained for the criterion. Likewise, the upper limit is the highest value among the values generated for a specific criterion. With this, we adapted the characteristics of each method to the model. Our intention was always to reduce uncertainty in the decision-making process. With the help of random generation, the proposed method can produce “t” possible iterations defined by the decision maker. The innovation is that we did not have just one final ranking but “t” sets of rankings. With this measure, the manager will be able to observe the behavior of the alternatives as a function of the various sets of weights, respecting the limits defined in the method. Step 8 of the methodology, using Equations (22) and (23), describes and defines the final ranking.
The methodology was tested using real data from the article “Ranking policing strategies as a function of criminal complaints: application of the PROMETHEE II method in the Brazilian context”, published in 2021. In the chosen article, the researchers used equal weight for each criterion, as it makes no sense to assign zero weight, which would invalidate the criterion, so using equal weight does not interfere with the relationship between the criteria. For comparison purposes, we preserved the data and information used in 2021. The classic method used was PROMETHEE. So, we applied EC-PROMETHEE to maintain the same conditions, setting t = 10,000 iterations. In this research, we developed the script presented in Appendix A in Visual Basic for Excel (VBA). Seven scenarios were emulated, and the results were compared, which allowed us to affirm that the production of “t” final rankings with variations in the set of weights for each criterion revealed that there was a reversal of positions in the ranking compared to just a single iteration of the traditional methods with a single set of weights for the criteria. We therefore consider the results produced by EC-PROMETHEE to be consistent, presenting the decision maker with a tool that reduces the uncertainties of the process and presents a robust ranking for decision-making.
The research does not end with this publication, as there are still gaps to be filled with future research, such as analyzing the choice of preference types in the PROMETHEE method, integrating other objective and subjective methods into the model, comparing it with different sorting methods, building a web platform to disseminate the technique, and compiling the algorithm in other languages such as python and R.

Author Contributions

Conceptualization, M.P.B. and V.P.; methodology, M.P.B.; software, M.P.B.; validation, V.P., F.Y. and M.P.B.; formal analysis, M.P.B.; investigation, V.P.; resources, M.P.B.; data curation, F.Y.; writing—original draft preparation, F.Y.; writing—review and editing, F.Y.; visualization, M.P.B.; supervision, V.P.; project administration, M.P.B.; funding acquisition, M.P.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Appendix A describes the EC-PROMETHEE software script in Excel VBA.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
AHPAnalytic Hierarchy Process
ANPAnalytical Network Process
BWMBest-Worst Method
CILOSCriterion Impact Loss
COPRASComplex Proportional Assessment
CRITICCriteria Importance Through Intercriteria Correlation
D-CRITICDistance Correlation-based CRITIC
DEMATELDecision-Making Trial and Evaluation Laboratory
DMDecision-making
EC-PROMETHEEEntropy-Critic-PROMETHEE
ELECTREÉLimination et Choix Traduisant la REalité (French)
FUCOMFull Consistency Method
GAIAGeometrical Analysis for Interactive Aid
IDOCRIWIntegrated Determination of Objective CRIteria Weights
IFSIntuitionistic fuzzy sets
LBWALevel Based Weight Assessment
MCDAMulti-Criteria Decision Analysis
MCDMMulti-Criteria Decision-Making
MERECMethod Based on the Removal Effects of Criteria
PROMETHEEPreference Ranking Organization Method for Enrichment of Evaluation
SAPEVO-MSimple Aggregation of Preferences Expressed by Ordinal Vectors—Multi-Decision Makers
SWARAStep-wise Weight Assessment Ratio Analysis
TOPSISTechnique for Order of Preference by Similarity to Ideal Solution
VIKORVlseKriterijumska Optimizacija I Kompromisno Resenje (Serbian)

Appendix A

Private Sub CommandButton1_Click()
‘Developer: Marcio Pereira Basilio, PhD
          ‘Company: Military Police of the State of Rio de Janeiro
          ‘Product: EC-PROMETHEE Hybrid Method
‘#################################################################################
‘Obtaining the initial parameters
n = Sheets("EC").Cells(2, 2).Value ‘Parameter of the number of criteria
t = Sheets("EC").Cells(3, 2).Value ‘Parameter of the number of alternatives
m = Sheets("EC").Cells(4, 2).Value ‘Parameter of iteration quantity
‘#################################################################################
‘Variable sizing
‘#################################################################################
Dim LI As Double
Dim LS As Double
Dim MD(100, 100) As Variant ‘Decision matrix
Dim MN(100, 100) As Variant ‘Standardisation Matrix
Dim WM(20,000, 20,000) As Double ‘Matrix of random weights obtained between lower and upper limits
Dim VDjT As Double
Dim Cont As Variant ‘Summation X
Dim Cont1 As Double ‘Summation Y
Dim Cont2 As Double ‘Summation X^2
Dim Cont3 As Double ‘Summation Y^2
Dim Cont4 As Double ‘Summation X*Y
Dim Cont5 As Double ‘Summation Ej
Dim Cont6 As Variant ‘Auxiliary summation
ReDim TP(1 To n) As Double ‘Vector type of preference
ReDim VN(1 To t) As Double ‘Auxiliary vector summation
ReDim VE(1 To n) As Double ‘Entropy calculation vector
ReDim VDj(1 To n) As Double ‘Vector of the calculation of the parameter Dj
ReDim VWe(1 To n) As Double ‘Vector of the calculation of the Weight per criterion in the entropy method
ReDim VWc(1 To n) As Double ‘Vector of the calculation of the Weight per criterion in the CRITIC method
ReDim VWdm(1 To n) As Double ‘Weight vector obtained from decision makers
ReDim Best(1 To n) As Variant
ReDim Worst(1 To n) As Variant
ReDim TCrit(1 To n) As Variant ‘Type of criteria “0” Benefit and “1” Cost
ReDim Average(1 To n) As Variant ‘Vector storing the average of each criterion
ReDim SD(1 To n) As Variant ‘Vector storing the Standard deviation
ReDim MC(n, n) As Double ‘Correlation matrix
ReDim Ej(1 To n) As Double ‘Ej of the CRITIC method formula
ReDim MCT(n, n) As Double ‘Auxiliary correlation matrix
ReDim MP(t, t) As Double ‘Promethee preference matrix
ReDim Phi_row(t) As Double ‘Phi+
ReDim Phi_column(t) As Double ‘Phi-
ReDim Phi_total(t) As Variant ‘Phi total auxiliary
ReDim Phi_total_A(t) As Variant ‘Phi total
ReDim Phi_total_ord(m, t) As Variant ‘Phi total ordinal
ReDim VrankG(t) As Variant ‘Total ranking vector based on Likert
ReDim VrankGF(t) As Variant
ReDim VrankA(t) As Variant
‘################################################################################
For k = 1 To n
    TCrit(k) = Sheets(“EC”).Cells(27, 10 + k).Value
Next
‘#################################################################################
‘Obtaining the decision matrix
For k = 1 To n
    For p = 1 To t
       MD(p, k) = Sheets(“EC”).Cells(30 + p, 1 + k).Value
    Next
Next
‘#################################################################################
‘Weight calculation by the Entropy method
‘#################################################################################
‘Step_1 Normalization of the decision matrix
Cont = 0
For k = 1 To n
    For p = 1 To t
       Cont = Cont + MD(p, k)
    Next
    ‘Standardization
    For j = 1 To t
       MN(j, k) = MD(j, k)/Cont
    Next
    Cont = 0
Next
‘Calculation of parameter h
E = 2.718282 ‘Euler parameter
h = 1/(Log(10)/Log(E))
‘Sheets(“EC”).Cells(1, 10).Value = h
‘Step 2 Calculation of entropy (e)
For k = 1 To n
    For p = 1 To t
    VE(k) = VE(k) + (MN(p, k) * (Log(MN(p, k)/Log(E))))
    Next
    VE(k) = VE(k) * (−h)
    VDj(k) = Abs((1 − VE(k)))
    VDjT = VDjT + VDj(k)
Next
‘Step 3 calculation of weight per criterion
For k = 1 To n
    VWe(k) = VDj(k)/VDjT
Next
‘###############################################################
‘Weight calculation by the CRITIC method
‘##############################################################
‘Step 1—Identification of the Highest and Lowest criterion value i
For k = 1 To n
    Best(k) = 0
Next
For k = 1 To n
    For p = 1 To (t)
       If MD(p, k) > Best(k) Then
          Best(k) = MD(p, k)
       End If
    Next
Next
For k = 1 To n
    Worst(k) = 99999
Next
For k = 1 To n
    For p = 1 To (t)
       If MD(p, k) < Worst(k) Then
          Worst(k) = MD(p, k)
       End If
    Next
Next
‘Step 2—Normalization of the Decision Matrix
For k = 1 To n
    For p = 1 To t
       If TCrit(k) = 0 Then
       MN(p, k) = (MD(p, k) − Worst(k) + 0.0001)/(Best(k) − Worst(k) + 0.01)
       Else
           MN(p, k) = (Best(k) − MD(p, k))/(Best(k) − Worst(k))
       End If
    Next
Next
‘Step 3—Calculation of standard deviation
‘Step 3.1—Calculation of the average
For k = 1 To n
        Cont = 0
    For p = 1 To t
        Cont = Cont + MN(p, k)
    Next
        Average(k) = (Cont/t)
Next
‘Step 3.2—Calculation of standard deviation
For k = 1 To n
        Cont = 0
    For p = 1 To t
        Cont = Cont + ((MN(p, k) − Average(k)) ^ (2))
    Next
        SD(k) = Sqr(Cont/t)
Next
‘Step 4—Calculation of correlation between criteria
For k = 1 To n
    For p = 1 To n
        Cont = 0
        Cont1 = 0
        Cont2 = 0
        Cont3 = 0
        Cont4 = 0
        For Z = 1 To t
        Cont = Cont + MN(Z, k)
        Cont1 = Cont1 + MN(Z, p)
        Cont2 = Cont2 + (MN(Z, k) ^ 2)
        Cont3 = Cont3 + (MN(Z, p) ^ 2)
        Cont4 = Cont4 + (MN(Z, k) * MN(Z, p))
        Next
        MC(k, p) = ((t * Cont4) − (Cont * Cont1))/(Sqr((t * Cont2) − (Cont ^ 2)) * Sqr((t * Cont3) − (Cont1 ^ 2)))
    Next
Next
For p = 1 To n
    For k = 1 To n
        MCT(p, k) = (1 − MC(p, k))
    Next
Next
Cont5 = 0
For p = 1 To n
    For k = 1 To n
        Ej(p) = Ej(p) + MCT(p, k)
    Next
    Ej(p) = Ej(p) * SD(p)
    Cont5 = Cont5 + Ej(p)
Next
For k = 1 To n
    VWc(k) = Ej(k)/Cont5
Next
‘#############################################################
‘Obtaining the Decision-Maker weight vector
‘#############################################################
Cont6 = 0
For j = 1 To n
    VWdm(j) = Sheets("EC").Cells(29, 1 + j).Value
    Sheets(“EC”).Cells(18, 2 + j).Value = VWe(j)
    Sheets(“EC”).Cells(19, 2 + j).Value = VWc(j)
    Cont6 = Cont6 + VWdm(j)
Next
For i = 1 To n
    VWdm(i) = VWdm(i)/Cont6
    Sheets(“EC”).Cells(20, 2 + i).Value = VWdm(i)
Next
‘################################################################
‘By generating the matrix of random weights between lower and upper bounds obtained from the outputs of the Entropy and CRITIC methods, this is a solution set to be utilized by the ranking method.
‘################################################################
For k = 1 To n
     If VWe(k) < VWc(k) Then
         If VWe(k) < VWdm(k) Then
           If VWc(k) < VWdm(k) Then
             LI = VWe(k)
             LS = VWdm(k)
           Else
             LI = VWe(k)
             LS = VWc(k)
           End If
         Else
           LI = VWdm(k)
           LS = VWc(k)
         End If
     Else
         If VWdm(k) < VWc(k) Then
           LI = VWdm(k)
           LS = VWe(k)
         Else
           If VWdm(k) < VWe(k) Then
             LI = VWc(k)
             LS = VWe(k)
           Else
             LI = VWc(k)
             LS = VWdm(k)
           End If
        End If
     End If
     Sheets("EC").Cells(21, 2 + k).Value = LI
     Sheets("EC").Cells(22, 2 + k).Value = LS
For p = 1 To m
     Randomize
     WM(p, k) = (((LS − LI) * Rnd) + LI)
Next
Next
‘Normalization of the random weight matrix
For p = 1 To m
     Z = 0
     Cont5 = 0
     For k = 1 To n
         Z = Z + WM(p, k)
     Next
     For k = 1 To n
         WM(p, k) = (WM(p, k)/Z)
         Sheets(“Result”).Cells(4 + p, k).Value = WM(p, k)
         Cont5 = Cont5 + WM(p, k)
     Next
     Sheets(“Result”).Cells(4 + p, n + 1).Value = Cont5
Next
Cont5 = 0
‘##############################################################
‘         Method PROMETHEE II
‘##############################################################
‘Obtaining the types of preferences:
For k = 1 To n
     TP(k) = Sheets("EC").Cells(28, 1 + k).Value
Next
p = 0.5
q = 0.15
s = 0.6
‘Step 1—Determination of deviations based on pairwise comparations
‘Step 2—Application of the preference function
‘Step 3—Calculation of an overall or global preference index
Cont5 = 0
Cont6 = 0
For y = 1 To m ‘Loop da iteração
     For k = 1 To t
         Phi_row(k) = 0
         Phi_column(k) = 0
         Phi_total(k) = 0
         Phi_total_A(k) = 0
     Next
For k = 1 To t
     For j = 1 To t
         For i = 1 To n
             Dj = (MN(k, i) - MN(j, i))
             If TP(i) = 1 Then
                 If Dj > 0 Then
                     Cont6 = Cont6 + (1 * WM(y, i))
                 End If
             End If
‘______________________________________
             If TP(i) = 2 Then
                 If Dj > q Then
                   Cont6 = Cont6 + (1 * WM(y, i))
                 End If
             End If
‘_______________________________________
             If TP(i) = 3 Then
                 If Dj > p Then
                   Cont6 = Cont6 + (1 * WM(y, i))
                 Else
                   If Dj > 0 And Dj ≤ p Then
                     Cont6 = Cont6 + ((Dj/p) * WM(y, i))
                 End If
             End If
           End If
‘_________________________________________
         If TP(i) = 4 Then
             If Dj > p Then
                 Cont6 = Cont6 + (1 * WM(y, i))
             Else
                 If Dj > q And Dj ≤ p Then
                   Cont6 = Cont6 + (0.5 * WM(y, i))
                 End If
             End If
         End If
‘___________________________________________
         If TP(i) = 5 Then
             If Dj > p Then
                 Cont6 = Cont6 + (1 * WM(m, i))
             Else
                 If Dj > q And Dj ≤ p Then
                   Cont6 = Cont6 + (((Dj − q)/(p − q)) * WM(y, i))
                 End If
             End If
         End If
‘_____________________________________________
         If TP(i) = 6 Then
             If Dj > 0 Then
                 Cont5 = ((Dj ^ 2) * (−1))/(2 * (s ^ 2))
                 Cont6 = Cont6 + ((1 − (E ^ (Cont5))) * WM(y, i))
                 Cont5 = 0
             End If
         End If
‘_______________________________________________
         Next
         MP(k, j) = Cont6
         Cont6 = 0
     Next
Next
For k = 1 To t
     For j = 1 To t
         Sheets(“EC”).Cells(3 + k, 17 + j).Value = MP(k, j)
     Next
Next
‘Step 4. Calculation of outranking flows/The PROMETHEE II partial ranking
For k = 1 To t
     For j = 1 To t
         Phi_row(k) = Phi_row(k) + MP(k, j)
         Phi_column(k) = Phi_column(k) + MP(j, k)
     Next
Next
For k = 1 To t
         Sheets(“EC”).Cells(3 + k, 26).Value = Phi_row(k)
         Sheets(“EC”).Cells(12, 17 + k).Value = Phi_column(k)
     Next
‘Step 5. Calculation of net outranking flow/The PROMETHEE II complete ranking
For k = 1 To t
     Phi_total(k) = Phi_row(k) − Phi_column(k)
     Sheets(“EC”).Cells(3 + k, 28).Value = Phi_total(k)
Next
‘Sorting the final ranking
Cont6 = −9999
For k = 1 To t
     Phi_total_A(k) = Phi_total(k)
Next
For k = 1 To t
     For p = k To t
       If Phi_total_A(k) < Phi_total_A(p) Then
         Cont6 = Phi_total_A(k)
         Phi_total_A(k) = Phi_total_A(p)
         Phi_total_A(p) = Cont6
       End If
     Next
     Sheets(“EC”).Cells(3 + k, 30).Value = Phi_total_A(k)
Next
For k = 1 To t
     For p = 1 To t
       If Phi_total(k) = Phi_total_A(p) Then
         Phi_total_ord(y, k) = p
       End If
     Next
     Sheets(“Ranking”).Cells(5 + y, k).Value = Phi_total_ord(y, k)
     VrankG(k) = VrankG(k) + Phi_total_ord(y, k) ‘Operation that sums ordinal values.
Next
Next
‘Sorting the final ordinal ranking Likert version
For k = 1 To t
     VrankA(k) = VrankG(k)
Next
For k = 1 To t
     For p = k To t
       If VrankA(k) > VrankA(p) Then ‘ <
         Cont6 = VrankA(k)
         VrankA(k) = VrankA(p)
         VrankA(p) = Cont6
       End If
     Next
Next
For k = 1 To t
     For p = 1 To t
       If VrankG(k) = VrankA(p) Then
         VrankGF(k) = p
       End If
     Next
Next
For k = 1 To t
         Sheets(“Ranking”).Cells(1, k).Value = “a” & k
         Sheets(“Ranking”).Cells(3, k).Value = VrankGF(k)
         Sheets(“Ranking”).Cells(4, k).Value = VrankG(k)
Next
End Sub

References

  1. Basílio, M.P.; Pereira, V.; Costa, H.G.; Santos, M.; Ghosh, A. A Systematic Review of the Applications of Multi-Criteria Decision Aid Methods (1977–2022). Electronics 2022, 11, 1720. [Google Scholar] [CrossRef]
  2. Ayan, B.; Abacıoğlu, S.; Basilio, M.P. A Comprehensive Review of the Novel Weighting Methods for Multi-Criteria Decision-Making. Information 2023, 14, 285. [Google Scholar] [CrossRef]
  3. Saaty, R.W. The analytic hierarchy process—What it is and how it is used. Math. Model. 1987, 9, 161–176. [Google Scholar] [CrossRef]
  4. Singh, M.; Pant, M. A review of selected weighing methods in MCDM with a case study. Int. J. Syst. Assur. Eng. Manag. 2021, 12, 126–144. [Google Scholar] [CrossRef]
  5. Keršulienė, V.; Zavadskas, E.K.; Turskis, Z. Selection of rational dispute resolution method by applying new step-wise weight assessment ratio analysis (Swara) by applying new step-wise weight assessment ratio. J. Bus. Econ. Manag. 2010, 11, 243–258. [Google Scholar] [CrossRef]
  6. Mardani, A.; Nilashi, M.; Zakuan, N.; Loganathan, N.; Soheilirad, S.; Saman, M.Z.M.; Ibrahim, O. A systematic review and meta-Analysis of SWARA and WASPAS methods: Theory and applications with recent fuzzy developments. Appl. Soft Comput. 2017, 57, 265–292. [Google Scholar] [CrossRef]
  7. Fernandes, P.G.; Quelhas, O.L.G.; Gomes, C.F.S.; Júnior, E.L.P.; Bella, R.L.F.; Junior, C.d.S.R.; Pereira, R.C.A.; Basilio, M.P.; dos Santos, M. Product Engineering Assessment of Subsea Intervention Equipment Using SWARA-MOORA-3NAG Method. Systems 2023, 11, 125. [Google Scholar] [CrossRef]
  8. Mukhametzyanov, I. Specific character of objective methods for determining weights of criteria in MCDM problems: Entropy, CRITIC and SD. Decis. Making: Appl. Manag. Eng. 2021, 4, 76–105. [Google Scholar] [CrossRef]
  9. Krishnan, A.R.; Kasim, M.M.; Hamid, R.; Ghazali, M.F. A Modified CRITIC Method to Estimate the Objective Weights of Decision Criteria. Symmetry 2021, 13, 973. [Google Scholar] [CrossRef]
  10. Rezaei, J. Best-worst multi-criteria decision-making method. Omega 2015, 53, 49–57. [Google Scholar] [CrossRef]
  11. Zavadskas, E.K.; Podvezko, V. Integrated Determination of Objective Criteria Weights in MCDM. Int. J. Inf. Technol. Decis. Mak. 2016, 15, 267–283. [Google Scholar] [CrossRef]
  12. Pamučar, D.; Stević, Ž.; Sremac, S. A New Model for Determining Weight Coefficients of Criteria in Mcdm Models: Full Consistency Method (Fucom). Symmetry 2018, 10, 393. [Google Scholar] [CrossRef]
  13. Khan, F.; Ali, Y.; Pamucar, D. A new fuzzy FUCOM-QFD approach for evaluating strategies to enhance the resilience of the healthcare sector to combat the COVID-19 pandemic. Kybernetes 2022, 51, 1429–1451. [Google Scholar] [CrossRef]
  14. Ižović, M.; Pamucar, D. New Model for Determining Criteria Weights: Level Based Weight Assessment (LBWA). Model. Decis. Mak. Appl. Manag. Eng. 2019, 2, 126–137. [Google Scholar]
  15. Tenório, F.M.; Moreira, M.L.; Costa, I.P.d.A.; Gomes, C.F.S.; dos Santos, M.; Silva, F.C.A.; da Silva, R.F.; Basilio, M.P. SADEMON: The Computational Web Platform to the SAPEVO-M Method. Procedia Comput. Sci. 2022, 214, 125–132. [Google Scholar] [CrossRef]
  16. Keshavarz-Ghorabaee, M.; Amiri, M.; Zavadskas, E.K.; Turskis, Z.; Antucheviciene, J. Determination of Objective Weights Using a New Method Based on the Removal Effects of Criteria (MEREC). Symmetry 2021, 13, 525. [Google Scholar] [CrossRef]
  17. Banik, B.; Alam, S.; Chakraborty, A. Comparative study between GRA and MEREC technique on an agricultural-based MCGDM problem in pentagonal neutrosophic environment. Int. J. Environ. Sci. Technol. 2023, 20, 1–16. [Google Scholar] [CrossRef]
  18. Diakoulaki, D.; Mavrotas, G.; Papayannakis, L. Determining objective weights in multiple criteria problems: The critic method. Comput. Oper. Res. 1995, 22, 763–770. [Google Scholar] [CrossRef]
  19. Zhang, L.; Gao, L.; Shao, X.; Wen, L.; Zhi, J. A PSO-Fuzzy group decision-making support system in vehicle performance evaluation. Math. Comput. Model. 2010, 52, 1921–1931. [Google Scholar] [CrossRef]
  20. Jahan, A.; Edwards, K.L. A state-of-the-art survey on the influence of normalization techniques in ranking: Improving the materials selection process in engineering design. Mater. Des. 2015, 65, 335–342. [Google Scholar] [CrossRef]
  21. Ouenniche, J.; Pérez-Gladish, B.; Bouslah, K. An out-of-sample framework for TOPSIS-based classifiers with application in bankruptcy prediction. Technol. Forecast. Soc. Chang. 2018, 131, 111–116. [Google Scholar] [CrossRef]
  22. Sharkasi, N.; Rezakhah, S. A modified CRITIC with a reference point based on fuzzy logic and hamming distance. Knowl.-Based Syst. 2022, 255, 109768. [Google Scholar] [CrossRef]
  23. Shemshadi, A.; Shirazi, H.; Toreihi, M.; Tarokh, M. A fuzzy VIKOR method for supplier selection based on entropy measure for objective weighting. Expert Syst. Appl. 2011, 38, 12160–12167. [Google Scholar] [CrossRef]
  24. Clausius, R. Ueber verschiedene für die Anwendung bequeme Formen der Hauptgleichungen der mechanischen Wärmetheorie. Annalen der physic 1865. [CrossRef]
  25. Shannon, C.; Weaver, W. The Mathematical Theory of Communication; The University of Illinois Press: Urbana, IL, USA, 1949. [Google Scholar]
  26. Bulduk, S.; Ecer, F. Entropi-ARAS Yaklaşımıyla Kripto Para Yatırım Alternatiflerinin Değerlendirilmesi. Süleyman Demirel Üniversitesi Vizyoner Derg. 2023, 14, 314–333. [Google Scholar] [CrossRef]
  27. Chen, W.; Feng, D.; Chu, X. Study of Poverty Alleviation Effects for Chinese Fourteen Contiguous Destitute Areas Based on Entropy Method. Int. J. Econ. Finance 2015, 7, 89–98. [Google Scholar] [CrossRef]
  28. Chodha, V.; Dubey, R.; Kumar, R.; Singh, S.; Kaur, S. Selection of industrial arc welding robot with TOPSIS and Entropy MCDM techniques. Mater. Today Proc. 2021, 50, 709–715. [Google Scholar] [CrossRef]
  29. Szmidt, E.; Kacprzyk, J. Entropy for intuitionistic fuzzy sets. Fuzzy Sets Syst. 2001, 118, 467–477. [Google Scholar] [CrossRef]
  30. Liu, M.; Ren, H. A New Intuitionistic Fuzzy Entropy and Application in Multi-Attribute Decision Making. Information 2014, 5, 587–601. [Google Scholar] [CrossRef]
  31. Thakur, P.; Kizielewicz, B.; Gandotra, N.; Shekhovtsov, A.; Saini, N.; Saeid, A.B.; Sałabun, W. A New Entropy Measurement for the Analysis of Uncertain Data in MCDA Problems Using Intuitionistic Fuzzy Sets and COPRAS Method. Axioms 2021, 10, 335. [Google Scholar] [CrossRef]
  32. Sampathkumar, S.; Augustin, F.; Kaabar, M.K.; Yue, X.-G. An integrated intuitionistic dense fuzzy Entropy-COPRAS-WASPAS approach for manufacturing robot selection. Adv. Mech. Eng. 2023, 15, 16878132231160265. [Google Scholar] [CrossRef]
  33. Brans, J.P.; Vincke, P.; Mareschal, B. How to select and how to rank projects: The Promethee method. Eur. J. Oper. Res. 1986, 24, 228–238. [Google Scholar] [CrossRef]
  34. Brans, J.P.; Mareschal, B. Promethee V: Mcdm Problems With Segmentation Constraints. INFOR Inf. Syst. Oper. Res. 1992, 30, 85–96. [Google Scholar] [CrossRef]
  35. Brans, J.-P.; Mareschal, B. The PROMETHEE VI procedure: How to differentiate hard from soft multicriteria problems. J. Decis. Syst. 1995, 4, 213–223. [Google Scholar] [CrossRef]
  36. Macharis, C.; Brans, J.P.; Mareschal, B. The GDSS PROMETHEE procedure: A PROMETHEE-GAIA based procedure for group decision support. J. Decis. Syst. 1998, 7, 283–307. [Google Scholar]
  37. Mareschal, B.; Brans, J.-P. Geometrical representations for MCDA. Eur. J. Oper. Res. 1988, 34, 69–77. [Google Scholar] [CrossRef]
  38. Brans, J.-P.; Mareschal, B. The PROMCALC & GAIA decision support system for multicriteria decision aid. Decis. Support Syst. 1994, 12, 297–310. [Google Scholar] [CrossRef]
  39. Zolfani, S.H.; Taheri, H.M.; Gharehgozlou, M.; Farahani, A. An asymmetric PROMETHEE II for cryptocurrency portfolio allocation based on return prediction. Appl. Soft Comput. 2022, 131, 109829. [Google Scholar] [CrossRef]
  40. Wei, Q.; Zhou, C.; Liu, Q.; Zhou, W.; Huang, J. A barrier evaluation framework for forest carbon sink project implementation in China using an integrated BWM-IT2F-PROMETHEE II method. Expert Syst. Appl. 2023, 230, 120612. [Google Scholar] [CrossRef]
  41. Ajin, M.; Moses, J.; Dharshini, M.P. Tribological and machining characteristics of AA7075 hybrid composites and optimizing utilizing modified PROMETHEE approach. Mater. Res. Express 2023, 10, 046509. [Google Scholar] [CrossRef]
  42. Basilio, M.P.; Pereira, V.; de Oliveira, M.W.C.; Neto, A.F.d.C. Ranking policing strategies as a function of criminal complaints: Application of the PROMETHEE II method in the Brazilian context. J. Model. Manag. 2021, 16, 1185–1207. [Google Scholar] [CrossRef]
  43. Basilio, M.P.; Pereira, V. Operational research applied in the field of public security: The ordering of policing strategies such as the ELECTRE IV. J. Model. Manag. 2020, 15, 1227–1276. [Google Scholar] [CrossRef]
  44. Basilio, M.P.; Brum, G.S.; Pereira, V. A model of policing strategy choice: The integration of the Latent Dirichlet Allocation (LDA) method with ELECTRE I. J. Model. Manag. 2020, 15, 849–891. [Google Scholar] [CrossRef]
  45. Basilio, M.P.; Pereira, V.; Brum, G. Identification of operational demand in law enforcement agencies: An application based on a probabilistic model of topics. Data Technol. Appl. 2019, 53, 333–372. [Google Scholar] [CrossRef]
  46. Basilio, M.P. O Modelo Multicritério de Ordenação de Estratégias de Policiamento: Uma Aplicação dos Métodos da Família Electre; Universidade Federal Fluminense: Niterói, Brazil, 2019. [Google Scholar]
  47. Basilio, M.P.; Pereira, V. Estudo sobre a premiação das áreas de segurança pública no Rio de Janeiro via método multicritério: Uma aplicação do método Electre III. Exacta 2019, 18, 130–164. [Google Scholar] [CrossRef]
  48. Basilio, M.P.; Pereira, V.; de Oliveira, M.W.C.M. Knowledge discovery in research on policing strategies: An overview of the past fifty years. J. Model. Manag. 2021, 17, 1372–1409. [Google Scholar] [CrossRef]
  49. Do, E.; do, P.M.; de Janeiro, R. Diretriz Geral de Operações [General Operational Guideline]; Polícia Militar Do Estado Do Rio De Janeiro: Rio De Janeiro, Brazil, 1982. [Google Scholar]
  50. Odu, G. Weighting methods for multi-criteria decision making technique. J. Appl. Sci. Environ. Manag. 2019, 23, 1449. [Google Scholar] [CrossRef]
  51. Mahajan, A.; Binaz, V.; Singh, I.; Arora, N. Selection of Natural Fiber for Sustainable Composites Using Hybrid Multi Criteria Decision Making Techniques. Compos. Part C Open Access 2022, 7, 100224. [Google Scholar] [CrossRef]
  52. Lau, K.-T.; Hung, P.-Y.; Zhu, M.-H.; Hui, D. Properties of natural fibre composites for structural engineering applications. Compos. Part B Eng. 2018, 136, 222–233. [Google Scholar] [CrossRef]
  53. Salwa, H.N.; Sapuan, S.M.; Mastura, M.T.; Zuhri, M.Y.M. Application of Shannon’s entropy-analytic hierarchy process (AHP) for the selection of the most suitable starch as matrix in green biocomposites for takeout food packaging design. BioResources 2020, 15, 4065–4088. [Google Scholar] [CrossRef]
  54. Wu, H.-W.; Zhen, J.; Zhang, J. Urban rail transit operation safety evaluation based on an improved CRITIC method and cloud model. J. Rail Transp. Plan. Manag. 2020, 16, 100206. [Google Scholar] [CrossRef]
  55. Vafaei, N.; Ribeiro, R.A.; Matos, L.M.C. Data normalisation techniques in decision making: Case study with TOPSIS method. Int. J. Inf. Decis. Sci. 2018, 10, 19. [Google Scholar] [CrossRef]
  56. Chakraborty, S. A Simulation-Based Comparative Study of Normalization Procedures in Multiattribute Decision Making. In Proceedings of the 6th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, Corfu Island, Greece, 16–19 February 2007. [Google Scholar]
  57. Vincke, J.P.; Brans, P. A preference ranking organization method. The PROMETHEE method for MCDM. Manag. Sci. 1985, 31, 647–656. [Google Scholar]
  58. Makan, A.; Fadili, A. Sustainability assessment of large-scale composting technologies using PROMETHEE method. J. Clean. Prod. 2020, 261, 121244. [Google Scholar] [CrossRef]
  59. de Almeida, A.T.; Costa, A.P.C.S. Modelo de decisão multicritério para priorização de sistemas de informação com base no método PROMETHEE. Gestão Produção 2002, 9, 201–214. [Google Scholar] [CrossRef]
  60. Basilio, M.P.; de Freitas, J.G.; Kämpffe, M.G.F.; Rego, R.B. Investment portfolio formation via multicriteria decision aid: A Brazilian stock market study. J. Model. Manag. 2018, 13, 394–417. [Google Scholar] [CrossRef]
  61. Ghandi, M.; Roozbahani, A. Risk Management of Drinking Water Supply in Critical Conditions Using Fuzzy PROMETHEE V Technique. Water Resour. Manag. 2020, 34, 595–615. [Google Scholar] [CrossRef]
  62. Alencar, L.; Almeida, A. Supplier Selection Based on the PROMETHEE VI Multicriteria Method. In Lecture Notes in Computer Science, Proceedings of the Evolutionary Multi-Criterion Optimization: 6th International Conference, EMO 2011, Ouro Preto, Brazil, 5–8 April 2011; Takahashi, R.H.C., Deb, K., Wanner, E.F., Greco, S., Eds.; Springer: Berlin/Heidelberg, Germany, 2011; Volume 6576, pp. 608–618. [Google Scholar] [CrossRef]
  63. Anwar, M.; Rasul, M.G.; Ashwath, N. The efficacy of multiple-criteria design matrix for biodiesel feedstock selection. Energy Convers. Manag. 2019, 198, 111790. [Google Scholar] [CrossRef]
  64. Fontana, M.E.; Cavalcante, C.A.V. Use of Promethee method to determine the best alternative for warehouse storage location assignment. Int. J. Adv. Manuf. Technol. 2014, 70, 1615–1624. [Google Scholar] [CrossRef]
  65. Behzadian, M.; Kazemzadeh, R.; Albadvi, A.; Aghdasi, M. PROMETHEE: A comprehensive literature review on methodologies and applications. Eur. J. Oper. Res. 2010, 200, 198–215. [Google Scholar] [CrossRef]
Figure 1. Methodological scheme.
Figure 1. Methodological scheme.
Mathematics 11 04432 g001
Figure 2. Graphical representation of the set of 10,000 iterations for the “Mode” Scenario.
Figure 2. Graphical representation of the set of 10,000 iterations for the “Mode” Scenario.
Mathematics 11 04432 g002
Figure 3. Graphical representation of the set of 10,000 iterations for the “Average” Scenario.
Figure 3. Graphical representation of the set of 10,000 iterations for the “Average” Scenario.
Mathematics 11 04432 g003
Figure 4. Graphical representation of the set of 10,000 iterations for the “Median” Scenario.
Figure 4. Graphical representation of the set of 10,000 iterations for the “Median” Scenario.
Mathematics 11 04432 g004
Figure 5. Graphical representation of the set of 10,000 iterations for the “Likert Scale” Scenario.
Figure 5. Graphical representation of the set of 10,000 iterations for the “Likert Scale” Scenario.
Mathematics 11 04432 g005
Figure 6. The standard deviation of the t iterations of the criteria in different scenarios.
Figure 6. The standard deviation of the t iterations of the criteria in different scenarios.
Mathematics 11 04432 g006
Figure 7. Graphical representation of the EC-PROMETHEE sensitivity analysis.
Figure 7. Graphical representation of the EC-PROMETHEE sensitivity analysis.
Mathematics 11 04432 g007
Table 1. List of criminal lawsuits.
Table 1. List of criminal lawsuits.
Criteria CaptionCode
MurderC1
RobberyC2
Vehicle theftC3
Theft residenceC4
Street robberyC5
Cargo theftC6
Bank robberyC7
Theft to a commercial establishmentC8
TheftC9
KidnappingC10
Drug seizureC11
Seizure of weaponsC12
ThreatC13
Use of narcoticC14
Drug trafficC15
Disruption to quietnessC16
Traffic accidentC17
Illegal weaponC18
Domestic violenceC19
Bank alarm tripC20
Source: Adapted from Basilio et al. [42].
Table 2. Types of policing strategies.
Table 2. Types of policing strategies.
Types of StrategiesRandomOriented
Foot patrolStrategy_1Strategy_5
Radio patrolStrategy_2Strategy_6
Motorcycle patrolStrategy_3Strategy_7
Horse patrolStrategy_4Strategy_8
Preventive action operationNot appliedStrategy_9
Operation of repressive action (scouring)Not appliedStrategy_10
Operation of repressive action (search and capture)Not appliedStrategy_11
Operation of repressive action (to search)Not appliedStrategy_12
Operation of repressive action (siege)Not appliedStrategy_13
Transit operationsNot appliedStrategy_14
Source: Adapted from Basilio et al. [42,49].
Table 3. Decision matrix of the impact of policing strategies versus criminal demand (“Mode”).
Table 3. Decision matrix of the impact of policing strategies versus criminal demand (“Mode”).
Alternatives\CriteriaC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Strategy_1 11225125512213321211
Strategy_2 23333333213323332311
Strategy_3 23334333313323331311
Strategy_4 11113111111111111111
Strategy_5 13335145513324331311
Strategy_6 44545555334434444411
Strategy_7 34545545534434434411
Strategy_8 11115113411113111311
Strategy_9 34444444313314333311
Strategy_10 33433433315514511511
Strategy_11 32433433115514511511
Strategy_12 34434434415515511511
Strategy_13 33533544314414411511
Strategy_14 12513533113313315411
Source: Adapted from Basilio et al. [42].
Table 4. Decision matrix of the impact of policing strategies versus criminal demand (“Average”).
Table 4. Decision matrix of the impact of policing strategies versus criminal demand (“Average”).
Alternatives\CriteriaC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Strategy_1 1.942.582.352.533.931.702.993.503.311.742.442.442.243.142.582.601.722.481.681.86
Strategy_2 2.523.093.462.913.273.183.133.232.622.162.812.882.233.032.892.732.212.801.862.15
Strategy_3 2.472.983.482.843.492.943.043.282.782.142.792.882.233.012.812.622.342.771.782.12
Strategy_4 1.521.791.771.892.811.591.932.282.211.501.871.901.802.352.052.071.492.031.451.56
Strategy_5 2.393.012.813.274.392.313.704.103.722.093.053.032.513.563.163.022.133.001.932.31
Strategy_6 3.203.734.223.794.114.144.084.163.402.733.763.782.853.813.863.442.853.582.392.77
Strategy_7 3.033.674.213.734.303.814.014.203.542.673.623.592.753.773.633.332.953.512.252.65
Strategy_8 1.952.342.382.623.482.052.673.052.911.892.332.352.062.852.472.491.832.431.761.92
Strategy_9 2.843.343.903.373.883.823.693.803.302.633.093.162.503.443.363.052.883.162.242.38
Strategy_10 2.973.003.532.822.973.632.802.832.552.514.294.332.363.784.282.532.054.071.981.85
Strategy_11 3.203.153.622.883.023.522.882.942.592.624.274.312.463.744.262.381.984.061.951.84
Strategy_12 3.083.404.083.013.503.913.143.272.852.704.284.332.283.844.082.242.184.141.841.79
Strategy_13 2.863.054.012.993.053.843.153.062.532.793.653.702.143.163.572.102.163.571.811.82
Strategy_14 2.152.574.092.302.923.832.742.732.302.473.093.241.902.722.951.903.663.281.611.68
Table 5. Decision matrix of the impact of policing strategies versus criminal demand (“Median”).
Table 5. Decision matrix of the impact of policing strategies versus criminal demand (“Median”).
Alternatives\CriteriaC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Strategy_1 23224134312223321211
Strategy_2 23333333323323332322
Strategy_3 23434333323323332312
Strategy_4 1112312221221.52221211
Strategy_5 23335244423324332322
Strategy_6 34444444334434443423
Strategy_7 34445444434434433423
Strategy_8 22234233312223221.5211
Strategy_9 3343.54444333324333322
Strategy_10 334334332.5244.524522421
Strategy_11 334334333244244.522421
Strategy_12 34434433334524422411
Strategy_13 33433433234423422411
Strategy_14 22423433223323324311
Table 6. Decision matrix of the impact of policing strategies versus criminal demand (“Likert Scale”).
Table 6. Decision matrix of the impact of policing strategies versus criminal demand (“Likert Scale”).
Alternatives\CriteriaC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Strategy_1 55673967272311234878541001947499698697641898738743493710480533
Strategy_2 722885989831935909891925750617805825638868826782633800533615
Strategy_3 705852996813998841866937796612799824638862804749669792510606
Strategy_4 435512507541803454550653632428534543516672587592427580414445
Strategy_5 68386280493612556601054117410645988718687171019905865609859552662
Strategy_6 915106612071083117511851162119197278010761081814109111039858161023683791
Strategy_7 8681051120510661229109111421202101376510341028786107810399538431005644758
Strategy_8 558670681748995586761873833540666673590814707712524694503549
Strategy_9 81395411149631110109310531088943751884905716984962873823903641682
Strategy_10 8498581011806849103779980873071812271238675108012247235861164566528
Strategy_11 9169001036824863100782084174174812211233703107112196815651162558527
Strategy_12 88097111678611001111889593481477212231239652109711666426241184527511
Strategy_13 817871114785587310978978747247971044105761390310206016181022519521
Strategy_14 614735117065783610957807806597068849275427798445441048938460480
Table 7. Decision matrix of the impact of policing strategies versus criminal demand (“Consensus_mode”).
Table 7. Decision matrix of the impact of policing strategies versus criminal demand (“Consensus_mode”).
Alternatives\CriteriaC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Strategy_1 0.7240.6741.4041.3553.4270.7561.3403.3413.1730.7481.3921.4580.7022.0332.0321.3220.7691.4280.7610.732
Strategy_2 1.4272.2202.1592.2112.2182.1112.2052.2571.4250.7182.2602.2511.5112.2452.1682.1441.4412.2380.7550.703
Strategy_3 1.4052.1842.0752.1622.8602.1112.1802.2182.0540.7132.2222.2221.4942.2272.1092.1020.6852.1670.7610.692
Strategy_4 0.8160.7710.7640.7571.9960.7900.7350.7000.6870.8100.7780.7690.7620.7000.7320.7120.8220.7500.8230.795
Strategy_5 0.6852.1822.1032.1293.9030.6782.8343.8423.5090.7042.1612.1761.3882.9142.0852.0730.7162.2100.7310.667
Strategy_6 2.6863.0454.0133.0083.9203.8823.9133.9082.0321.9193.0843.1142.0643.1073.0312.7752.7232.9770.6700.640
Strategy_7 1.9692.8983.9292.9153.9583.5663.1103.8893.3821.9283.0353.0172.0443.0052.8312.0582.7042.9540.6860.634
Strategy_8 0.7480.6810.6720.6593.2080.7150.6421.9522.5390.7080.7020.6870.7371.9790.6640.6610.7542.1040.7470.714
Strategy_9 2.0302.7993.1752.8263.1082.9942.9163.0262.0100.6372.1002.0970.6772.8002.0992.0462.0102.1070.6650.638
Strategy_10 2.0432.0472.8612.0772.0932.8712.0412.0742.0270.6384.0014.0450.6822.8983.9200.6710.7093.8160.7170.713
Strategy_11 1.9211.2992.8552.0622.0402.7571.9982.0310.6580.6294.0104.0320.6602.8123.9110.6900.7293.7840.7300.705
Strategy_12 2.0402.8173.1992.1802.7273.0172.0622.7022.6110.6264.0184.0670.6783.5383.8290.7020.6823.8880.7350.731
Strategy_13 2.0262.0653.8002.0942.0333.5422.6812.6902.0310.6062.8802.9310.6962.6392.7540.7300.6763.4160.7450.726
Strategy_14 0.7231.3753.8220.7022.0293.5012.0192.0750.6920.6152.0662.1130.7392.0672.0860.7463.1352.7990.7780.747
Table 8. Decision matrix of the impact of policing strategies versus criminal demand (“Consensus_average”).
Table 8. Decision matrix of the impact of policing strategies versus criminal demand (“Consensus_average”).
Alternatives\CriteriaC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Strategy_1 1.4081.7411.6491.7132.6921.2872.0012.3392.1021.3051.6991.7761.5742.1281.7481.7181.3251.7731.2771.364
Strategy_2 1.8022.2902.4882.1412.4172.2362.2982.4331.8691.5502.1202.1641.6852.2712.0871.9541.5942.0861.4081.512
Strategy_3 1.7322.1692.4092.0482.4952.0692.2092.4221.9061.5262.0692.1341.6662.2371.9761.8351.6012.0001.3571.467
Strategy_4 1.2401.3801.3551.4331.8681.2541.4181.5981.5191.2121.4531.4601.3751.6441.5031.4751.2271.5211.1911.238
Strategy_5 1.6372.1921.9712.3223.4261.5652.6203.1542.6111.4722.1942.2021.7402.5952.1992.0901.5242.2131.4101.544
Strategy_6 2.1482.8383.3872.8483.2213.2173.1913.2552.3021.7452.9012.9421.9582.9632.9232.3901.9422.6621.6011.769
Strategy_7 1.9922.6623.3102.7173.4012.7213.1163.2692.3961.7192.7432.7111.8732.8312.5712.2861.9932.5951.5451.679
Strategy_8 1.4601.5951.5991.7242.2321.4661.7131.9861.8491.3361.6341.6161.5211.8771.6421.6471.3811.7021.3141.370
Strategy_9 1.9242.3343.0912.3793.0162.8602.6932.8782.2091.6722.1642.2121.6942.4082.3532.0821.9282.2171.4911.521
Strategy_10 2.0222.0472.5291.9512.0712.6021.9081.9531.7251.6013.4333.5021.6092.7363.3561.6961.4523.1061.4181.316
Strategy_11 2.0512.0442.5851.9802.0522.4271.9161.9911.7041.6463.4243.4761.6212.6333.3341.6421.4403.0751.4241.300
Strategy_12 2.0922.3913.2632.1882.3872.9482.1582.2061.8581.6913.4363.5241.5452.7143.1221.5771.4883.2191.3551.307
Strategy_13 1.9292.0973.0482.0872.0682.7172.1102.0551.7141.6902.6292.7081.4922.0832.4551.5331.4602.4421.3531.322
Strategy_14 1.5521.7673.1271.6141.9772.6811.8421.8871.5941.5192.1292.2831.4001.8772.0521.4182.2972.2951.2511.254
Table 9. Decision matrix of the impact of policing strategies versus criminal demand (“Consensus_Median”).
Table 9. Decision matrix of the impact of policing strategies versus criminal demand (“Consensus_Median”).
Alternatives\CriteriaC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Strategy_1 1.4482.0211.4041.3552.7420.7562.0102.6731.9040.7481.3921.4581.4052.0332.0321.3220.7691.4280.7610.732
Strategy_2 1.4272.2202.1592.2112.2182.1112.2052.2572.1381.4372.2602.2511.5112.2452.1682.1441.4412.2381.5111.406
Strategy_3 1.4052.1842.7672.1622.8602.1112.1802.2182.0541.4262.2222.2221.4942.2272.1092.1021.3692.1670.7611.385
Strategy_4 0.8160.7710.7641.5151.9960.7901.4701.4001.3750.8101.5561.5381.1431.3991.4641.4250.8221.5000.8230.795
Strategy_5 1.3712.1822.1032.1293.9031.3562.8343.0742.8071.4082.1612.1761.3882.9142.0852.0731.4322.2101.4611.334
Strategy_6 2.0143.0453.2103.0083.1363.1063.1303.1262.0321.9193.0843.1142.0643.1073.0312.7752.0422.9771.3411.919
Strategy_7 1.9692.8983.1432.9153.9582.8533.1103.1112.7061.9283.0353.0172.0443.0052.8312.0582.0282.9541.3721.901
Strategy_8 1.4971.3621.3431.9772.5671.4311.9251.9521.9040.7081.4031.3741.4751.9791.3281.3231.1311.4020.7470.714
Strategy_9 2.0302.0993.1752.4733.1082.9942.9163.0262.0101.9102.1002.0971.3532.8002.0992.0462.0102.1071.3301.275
Strategy_10 2.0432.0472.8612.0772.0932.8712.0412.0741.6891.2763.2013.6411.3632.8983.9201.3421.4183.0531.4330.713
Strategy_11 1.9211.9482.8552.0622.0402.7571.9982.0311.9741.2583.2083.2251.3192.8123.5191.3801.4583.0271.4600.705
Strategy_12 2.0402.8173.1992.1802.7273.0172.0622.0261.9581.8793.2144.0671.3562.8313.0631.4051.3643.1110.7350.731
Strategy_13 2.0262.0653.0402.0942.0332.8342.0112.0181.3541.8192.8802.9311.3931.9792.7541.4591.3512.7330.7450.726
Strategy_14 1.4451.3753.0581.4052.0292.8012.0192.0751.3841.2312.0662.1131.4772.0672.0861.4912.5082.0990.7780.747
Table 10. Types of preference function.
Table 10. Types of preference function.
TypeGeneralized CriterionConditionQuantification of PreferenceParameter to Fix
Type I—Usual preference functionMathematics 11 04432 i001 g a g b > 0  
g a g b 0
P j a , b = 1
P j a , b = 0
-
Type II—U-shape preference functionMathematics 11 04432 i002 g a g b > q  
g a g b q
P j a , b = 1
P j a , b = 0
q
Type III—V-shape preference functionMathematics 11 04432 i003 g a g b > p  
g a g b p  
g a g b 0
P j a , b = 1
P j a , b = g a g b p
P j a , b = 0
p
Type IV—Level preference functionMathematics 11 04432 i004 g a g b > p  
q < g a g b p
g a g b q
P j a , b = 1
P j a , b = 1 2
P j a , b = 0
p, q
Type V—Linear preference functionMathematics 11 04432 i005 g a g b > p
q < g a g b p
g a g b q
P j a , b = 1
P j a , b = g a g b q p q  
P j a , b = 0
p, q
Type VI—Gaussian preference functionMathematics 11 04432 i006 g a g b > 0  
g a g b 0
P j a , b = 1 e g a g b 2 2 s 2
P j a , b = 0
s
Source: Adapted from Basilio et al. [42].
Table 11. Common parameters inserted in the EC-PROMETHEE model.
Table 11. Common parameters inserted in the EC-PROMETHEE model.
CriterionCodeObjectiveUnitScalePreferenceThresholdsWeight ( W j D M )
MurderC1MaxScalarRUsualAbsolute0.05
RobberyC2MaxScalarRUsualAbsolute0.05
Vehicle theftC3MaxScalarRUsualAbsolute0.05
Theft residenceC4MaxScalarRUsualAbsolute0.05
Street robberyC5MaxScalarRUsualAbsolute0.05
Cargo theftC6MaxScalarRUsualAbsolute0.05
Bank robberyC7MaxScalarRUsualAbsolute0.05
Theft to a commercial establishmentC8MaxScalarRUsualAbsolute0.05
TheftC9MaxScalarRUsualAbsolute0.05
KidnappingC10MaxScalarRUsualAbsolute0.05
Drug seizureC11MaxScalarRUsualAbsolute0.05
Seizure of weaponsC12MaxScalarRUsualAbsolute0.05
ThreatC13MaxScalarRUsualAbsolute0.05
Use of narcoticC14MaxScalarRUsualAbsolute0.05
Drug trafficC15MaxScalarRUsualAbsolute0.05
Disruption to quietnessC16MaxScalarRUsualAbsolute0.05
Traffic accidentC17MaxScalarRUsualAbsolute0.05
Illegal weaponC18MaxScalarRUsualAbsolute0.05
Domestic violenceC19MaxScalarRUsualAbsolute0.05
Bank alarm tripC20MaxScalarRUsualAbsolute0.05
Source: Adapted from Basilio et al. [42].
Table 12. Table of weights per criterion generated by the EC-PROMETHEE hybrid method.
Table 12. Table of weights per criterion generated by the EC-PROMETHEE hybrid method.
ScenarioMethodC1 C2 C3 C4 C5 C6 C7 C8C9 C10 C11 C12 C13 C14 C15 C16 C17 C18 C19 C20
Mode W j E 0.0450.0490.0500.0510.0620.0400.0520.0570.0450.0440.0500.0500.0460.0590.0520.0390.0220.0550.0670.067
W j C 0.0490.0480.0460.0450.1040.0610.0350.0440.0780.0590.0480.0480.0650.0320.0470.0690.0720.0500.0010.001
W j D M 0.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.050
Average W j E 0.0500.0500.0490.0510.0510.0470.0500.0510.0510.0500.0490.0490.0520.0510.0500.0510.0480.0500.0510.051
W j C 0.0400.0270.0510.0300.0790.0590.0340.0510.0710.0470.0570.0580.0340.0410.0510.0590.0680.0580.0320.051
W j D M 0.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.050
Median W j E 0.0510.0490.0480.0530.0540.0440.0540.0540.0530.0460.0510.0500.0540.0540.0510.0520.0460.0510.0470.040
W j C 0.0400.0310.0440.0370.0780.0560.0360.0500.0600.0470.0520.0470.0350.0370.0470.0570.0490.0520.0840.059
W j D M 0.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.050
Consensus_Mode W j E 0.0480.0480.0480.0500.0610.0400.0510.0550.0460.0470.0480.0480.0460.0590.0490.0390.0280.0550.0670.067
W j C 0.0420.0410.0410.0390.0670.0480.0310.0380.0610.0500.0440.0430.0560.0290.0420.0570.0620.0430.0810.083
W j D M 0.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.050
Consensus_Average W j E 0.0510.0500.0470.0500.0500.0470.0490.0490.0510.0520.0470.0470.0520.0510.0480.0510.0510.0490.0530.052
W j C 0.0410.0270.0540.0300.0670.0550.0360.0520.0620.0400.0680.0690.0370.0360.0630.0510.0700.0620.0290.051
W j D M 0.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.050
Consensus_Median W j E 0.0520.0490.0470.0520.0520.0440.0530.0520.0530.0480.0500.0480.0540.0530.0490.0510.0490.0510.0490.044
W j C 0.0470.0320.0450.0340.0660.0550.0380.0500.0580.0440.0550.0520.0450.0340.0520.0530.0500.0510.0800.059
W j D M 0.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.050
Likert Scale W j E 0.0500.0500.0490.0510.0510.0470.0500.0510.0510.0500.0490.0490.0520.0510.0500.0510.0480.0500.0510.051
W j C 0.0400.0270.0510.0300.0790.0590.0340.0510.0710.0470.0570.0580.0340.0410.0510.0590.0680.0580.0320.051
W j D M 0.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.0500.050
Table 13. Table of the lower and upper limits of the weight system of the EC-PROMETHEE method.
Table 13. Table of the lower and upper limits of the weight system of the EC-PROMETHEE method.
CriteriaScenario
ModeAverageMedianConsensus
Mode
Consensus
Average
Consensus
Median
Likert Scale
L l j U l j L l j U l j L l j U l j L l j U l j L l j U l j L l j U l j L l j U l j
C10.0450.0500.0400.0500.0400.0510.0420.0500.0410.0510.0470.0520.0400.050
C20.0480.0500.0270.0500.0310.0500.0410.0500.0270.0500.0320.0500.0270.050
C30.0460.0500.0490.0510.0440.0500.0410.0500.0470.0540.0450.0500.0490.051
C40.0450.0510.0300.0510.0370.0530.0390.0500.0300.0500.0340.0520.0300.051
C50.0500.1040.0500.0790.0500.0780.0500.0670.0500.0670.0500.0660.0500.079
C60.0400.0610.0470.0590.0440.0560.0400.0500.0470.0550.0440.0550.0470.059
C70.0350.0520.0340.0500.0360.0540.0310.0510.0360.0500.0380.0530.0340.050
C80.0440.0570.0500.0510.0500.0540.0380.0550.0490.0520.0500.0520.0500.051
C90.0450.0780.0500.0710.0500.0600.0460.0610.0500.0620.0500.0580.0500.071
C100.0440.0590.0470.0500.0460.0500.0470.0500.0400.0520.0440.0500.0470.050
C110.0480.0500.0490.0570.0500.0520.0440.0500.0470.0680.0500.0550.0490.057
C120.0480.0500.0490.0580.0470.0500.0430.0500.0470.0690.0480.0520.0490.058
C130.0460.0650.0340.0520.0350.0540.0460.0560.0370.0520.0450.0540.0340.052
C140.0320.0590.0410.0510.0370.0540.0290.0590.0360.0510.0340.0530.0410.051
C150.0470.0520.0500.0510.0470.0510.0420.0500.0480.0630.0490.0520.0500.051
C160.0390.0690.0500.0590.0500.0570.0390.0570.0500.0510.0500.0530.0500.059
C170.0220.0720.0480.0680.0460.0500.0280.0620.0500.0700.0490.0500.0480.068
C180.0500.0550.0500.0580.0500.0520.0430.0550.0490.0620.0500.0510.0500.058
C190.0010.0670.0320.0510.0470.0840.0500.0810.0290.0530.0490.0800.0320.051
C200.0010.0670.0500.0510.0400.0590.0500.0830.0500.0520.0440.0590.0500.051
Table 14. Final ranking of the EC-PROMETHE model for different decision matrix schemes.
Table 14. Final ranking of the EC-PROMETHE model for different decision matrix schemes.
Scenarios Ranking
1st2nd3rd4th5th6th7th8th9th10th11th12th13th14th
Consensus_Mediana6a7a12a9a2a10a5a3a11a13a14a1a8a4
Consensus_Averagea6a7a9a12a5a10a2a11a3a13a14a1a8a4
Consensus_Modea6a7a12a2a9a5a3a10a13a11a1a14a4a8
Likert_Scalea6a7a12a9a5a11a13a10a2a3a14a1a8a4
Mediana7a6a9a12a5a11a10a13a3a2a14a1a8a4
Averagea6a7a12a9a5a11a13a10a2a3a14a1a8a4
Modea6a7a12a9a5a13a10a11a3a2a1a14a8a4
Model *a6a7a12a9a11a5a10a13a2a3a14a1a8a4
Note: * This is the final modeling ranking from the report by Basilio et al. [42], which is used as a comparison model for EC-PROMETHEE.
Table 15. Spearman correlation of the final ranking of the proposed scenarios.
Table 15. Spearman correlation of the final ranking of the proposed scenarios.
Consensus_MedianConsensus_AverageConsensus_ModeLikert ScaleMedianAverageMode
Consensus_Median10.9736263740.9692307690.89890110.8945050.8989010.89011
Consensus_Average 10.929670330.947252750.9560440.9472530.934066
Consensus_Mode 10.868131870.8461540.8681320.872527
Likert Scale 10.98241810.978022
Median 10.9824180.969231
Average 10.978022
Mode 1
Table 16. Expected percentages of variation in the EC-PROMETHEE sensitivity analysis.
Table 16. Expected percentages of variation in the EC-PROMETHEE sensitivity analysis.
Scenarios/Alternativesa1a2a3a4a5a6a7a8a9a10a11a12a13a14
Consensus_Median85%31%23%100%23%0%8%92%23%31%62%15%69%77%
Consensus_Average85%31%31%100%31%0%8%92%46%31%54%46%69%77%
Consensus_Mode77%69%31%77%62%0%8%85%38%69%69%15%62%85%
Likert_Scale85%62%69%100%38%0%8%92%23%54%38%15%46%77%
Median85%69%62%100%69%0%8%92%15%77%100%23%54%77%
Average85%62%69%100%38%0%8%92%23%54%38%15%46%77%
Mode31%69%62%100%46%8%15%92%23%46%54%15%85%100%
Note: Areas highlighted in yellow indicate changes in position that are not in line with the expected value.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Basilio, M.P.; Pereira, V.; Yigit, F. New Hybrid EC-Promethee Method with Multiple Iterations of Random Weight Ranges: Applied to the Choice of Policing Strategies. Mathematics 2023, 11, 4432. https://doi.org/10.3390/math11214432

AMA Style

Basilio MP, Pereira V, Yigit F. New Hybrid EC-Promethee Method with Multiple Iterations of Random Weight Ranges: Applied to the Choice of Policing Strategies. Mathematics. 2023; 11(21):4432. https://doi.org/10.3390/math11214432

Chicago/Turabian Style

Basilio, Marcio Pereira, Valdecy Pereira, and Fatih Yigit. 2023. "New Hybrid EC-Promethee Method with Multiple Iterations of Random Weight Ranges: Applied to the Choice of Policing Strategies" Mathematics 11, no. 21: 4432. https://doi.org/10.3390/math11214432

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop