An interactive method for multiple criteria group decision analysis based on interval type-2 fuzzy sets and its application to medical decision making

The theory of interval type-2 fuzzy sets provides an intuitive and computationally feasible way of addressing uncertain and ambiguous information in decision-making fields. The aim of this paper is to develop an interactive method for handling multiple criteria group decision-making problems, in which information about criterion weights is incompletely (imprecisely or partially) known and the criterion values are expressed as interval type-2 trapezoidal fuzzy numbers. With respect to the relative importance of multiple decision-makers and group consensus of fuzzy opinions, a hybrid averaging approach combining weighted averages and ordered weighted averages was employed to construct the collective decision matrix. An integrated programming model was then established based on the concept of signed distance-based closeness coefficients to determine the importance weights of criteria and the priority ranking of alternatives. Subsequently, an interactive procedure was proposed to modify the model according to the decision-makers’ feedback on the degree of satisfaction toward undesirable solution results for the sake of gradually improving the integrated model. The feasibility and applicability of the proposed methods are illustrated with a medical decision-making problem of patient-centered medicine concerning basilar artery occlusion. A comparative analysis with other approaches was performed to validate the effectiveness of the proposed methodology.     

A careful look at the importance of criteria and weights

We investigate the connection between weights, scales, and the importance of criteria, when a linear value function is assumed to be a suitable representation of a decision maker’s preferences. Our considerations are based on a simple two-criteria experiment, where the participants were asked to indicate which of the criteria was more important, and to pairwise compare a number of alternatives. We use the participants’ pairwise choices to estimate the weights for the criteria in such a way that the linear value function explains the choices to the extent possible. More specifically, we study two research questions: (1) is it possible to find a general scaling principle that makes the rank order of the importance of criteria consistent with the rank order of the magnitudes of the weights, and (2) how good is a simple, direct method of asking the decision maker to “provide” weights for the criteria compared to our estimation procedure. Our results imply that there is reason to question two common beliefs, namely that the values of the weights would reflect the importance of criteria, and that people could reliably “provide” such weights without estimation.     

Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions

The multi-criteria scheduling problem is one of the main research subjects in the field of multiple objectives programming. Several procedures have been developed to deal with this type of problem where some conflicting criteria have to be optimized simultaneously. The aim of our paper is to propose an aggregation procedure that integrates three different criteria to find the best sequence in a flow shop production environment. The compromise programming model and the concept of satisfaction functions will be utilized to integrate explicitly the manager’s preferences according to the deviations between the achievement and the aspiration levels of the following criteria: Makespan, total flow time and total tardiness.     

基于灰色关联法和HA算子的Pythagorean模糊群决策方法

针对Pythagorean模糊群决策问题,提出一种基于Pythagorean模糊混合平均算子的决策方法。首先,提出一种基于Pythagorean模糊信息及其运算法则的Pythagorean模糊混合平均算子;其次,构建一种基于最大熵模型的属性位置权重定权方法,同时根据灰色关联方法提出一种属性客观权重计算方法,进而获得Pythagorean模糊混合平均算子的定权方法;利用Pythagorean模糊混合平均算子对单决策者信息进行融合,通过Pythagorean模糊加权平均算子对各专家信息进行融合,并依据得分函数与精确函数进行排序择优;最后,通过一个算例说明该方法的有效性和可行性。     

Fuzzy analytic hierarchy process: A logarithmic fuzzy preference programming methodology

Fuzzy analytic hierarchy process (AHP) proves to be a very useful methodology for multiple criteria decision-making in fuzzy environments, which has found substantial applications in recent years. The vast majority of the applications use a crisp point estimate method such as the extent analysis or the fuzzy preference programming (FPP) based nonlinear method for fuzzy AHP priority derivation. The extent analysis has been revealed to be invalid and the weights derived by this method do not represent the relative importance of decision criteria or alternatives. The FPP-based nonlinear priority method also turns out to be subject to significant drawbacks, one of which is that it may produce multiple, even conflict priority vectors for a fuzzy pairwise comparison matrix, leading to entirely different conclusions. To address these drawbacks and provide a valid yet practical priority method for fuzzy AHP, this paper proposes a logarithmic fuzzy preference programming (LFPP) based methodology for fuzzy AHP priority derivation, which formulates the priorities of a fuzzy pairwise comparison matrix as a logarithmic nonlinear programming and derives crisp priorities from fuzzy pairwise comparison matrices. Numerical examples are tested to show the advantages of the proposed methodology and its potential applications in fuzzy AHP decision-making.     

Deriving weights in multiple-criteria decision making with support vector machines

A key problem in Multiple-Criteria Decision Making is how to measure the importance of the different criteria when just a partial preference relation among actions is given. In this note we address the problem of constructing a linear score function (and thus how to associate weights of importance to the criteria) when a binary relation comparing actions and partial information (relative importance) on the criteria are given. It is shown that these tasks can be done viaSupport Vector Machines, an increasingly popular Data Mining technique, which reduces the search of the weights to the resolution of (a series of) nonlinear convex optimization problems with linear constraints. An interactive method is then presented and illustrated by solving a multiple-objective 0–1 knapsack problem. Extensions to the case in which data are imprecise (given by intervals) or intransitivities in strict preferences exist are outlined.     

On the extent analysis method for fuzzy AHP and its applications

In a paper by Chang [D.Y. Chang, Applications of the extent analysis method on fuzzy AHP, European Journal of Operational Research 95 (1996) 649–655], an extent analysis method on fuzzy AHP was proposed to obtain a crisp priority vector from a triangular fuzzy comparison matrix. It is found that the extent analysis method cannot estimate the true weights from a fuzzy comparison matrix and has led to quite a number of misapplications in the literature. In this paper, we show by examples that the priority vectors determined by the extent analysis method do not represent the relative importance of decision criteria or alternatives and that the misapplication of the extent analysis method to fuzzy AHP problems may lead to a wrong decision to be made and some useful decision information such as decision criteria and fuzzy comparison matrices not to be considered. We show these problems to avoid any possible misapplications in the future.     

Column aggregation and primal decomposition in linear programming: some observations

In this paper we present a way to interpret column aggregation schemes in linear programming as a special kind of primal decomposition. This relation between aggregation and decomposition is obtained through a reformulation of the original problem by the introduction of auxiliary variables. The relation between aggregation and decomposition yields a natural iterative aggregation scheme, where weights updating can be done in different ways. We describe several weight updating schemes and illustrate three of them within an iterative aggregation technique with a numerical example. Finally we point out some new research issues that appear when the aggregation process is viewed in this decomposition framework     

The aspiration level interactive method (AIM) reconsidered: Robustness of solutions

In this paper we explore theory and practice for the aspiration-level interactive model (AIM), a useful decision tool that takes advantage of the concepts of satisficing as well as other concepts of multiple criteria decision making (MCDM). We examine the relationship between aspiration levels and their mapped-to solutions in the MCDM context using AIM.We extend the concept of robustness in decision making, by defining a solution to be robust if many (suitably defined) aspiration levels map to it. We use simulation to help explore robustness, by generating three groups of random test problems. Each problem has twenty alternatives. For each group of problems, the top 5 (most-mapped-to) alternatives out of 20 are mapped to by at least 50% of the aspiration levels. We also relate the concept of robustness in decision making to the ideas of simply ranking alternatives using equal weights. There is a strong correlation between the robustness ranking and the equal-weights ranking. Based on our analyses, we then randomly generate additional problems to explore certain other factors. We also discuss practical aspects of robustness.     

Approaches to determining the relative importance weights for cross-efficiency aggregation in data envelopment analysis

Cross-efficiency evaluation has been widely used for identifying the most efficient decision making unit (DMU) or ranking DMUs in data envelopment analysis (DEA). Most existing approaches for cross-efficiency evaluation are focused on how to determine input and output weights uniquely, but pay little attention to the aggregation process of cross-efficiencies and simply aggregate them equally without considering their relative importance. This paper focuses on aggregating cross-efficiencies by taking into consideration their relative importance and proposes three alternative approaches to determining the relative importance weights for cross-efficiency aggregation. Numerical examples are examined to show the importance and necessity of the use of relative importance weights for cross-efficiency aggregation and the most efficient DMU can be significantly affected by taking into consideration the relative importance weights of cross-efficiencies.     

Soft computing-based aggregation methods for human resource management

We are interested in the personnel selection problem. We have developed a flexible decision support system to help managers in their decision-making functions. This DSS simulates experts’ evaluations using ordered weighted average (OWA) aggregation operators, which assign different weights to different selection criteria. Moreover, we show an aggregation model based on efficiency analysis to put the candidates into an order.     

Extended use of the cards procedure as a simple elicitation technique for MAVT. Application to public procurement in Switzerland

The cards procedure was designed in the early 90 as a simple way to elicit weights for multiple criteria decision analysis outranking methods. It is based on the elicitation of the difference of importance between successive pairs of criteria. We propose to extend its use in two directions:     

Some aspects of intuitionistic fuzzy sets

We first discuss the significant role that duality plays in many aggregation operations involving intuitionistic fuzzy subsets. We then consider the extension to intuitionistic fuzzy subsets of a number of ideas from standard fuzzy subsets. In particular we look at the measure of specificity. We also look at the problem of alternative selection when decision criteria satisfaction is expressed using intuitionistic fuzzy subsets. We introduce a decision paradigm called the method of least commitment. We briefly look at the problem of defuzzification of intuitionistic fuzzy subsets.     

A generalized bi-criteria fuzzy integer flow sharing problem

The flow sharing problem is a class of techniques that can be used to find the optimal flow in a capacitated network, which realizes an equitable distribution of flows. This paper extends the integer flow sharing problem by considering fuzzy capacities and fuzzy weights such that the flux received at each sink node and the flow value through each arc are restricted to be multiples of some block unit. Fuzzy capacity describes the flexibility of the upper limit of flow value through each arc. Fuzzy weight represents the degree of satisfaction of the flux to a sink node. Our model has the two following criteria: to maximize the minimal degree of satisfaction among all of the fuzzy capacity constraints and to maximize the minimal degree of satisfaction among the fluxes to all of the sink nodes. Because an optimal flow pattern that simultaneously maximizes the two objectives is usually not feasible, we define non-domination in this setting and propose a pseudo-polynomial algorithm that finds some non-dominated flow patterns. Finally, a numerical example is presented to demonstrate how our algorithm works.     

Reference point method with importance weighted ordered partial achievements

The Reference Point Method (RPM) is a very convenient technique for interactive analysis of the multiple criteria optimization problems. The interactive analysis is navigated with the commonly accepted control parameters expressing reference levels for the individual objective functions. The partial achievement functions quantify the DM satisfaction from the individual outcomes with respect to the given reference levels, while the final scalarizing achievement function is built as the augmented max–min aggregation of the partial achievements. In order to avoid inconsistencies caused by the regularization, the max–min solution may be regularized by the Ordered Weighted Averages (OWA) with monotonic weights which combines all the partial achievements allocating the largest weight to the worst achievement, the second largest weight to the second worst achievement, and so on. Further, following the concept of the Weighted OWA (WOWA), the importance weighting of several achievements may be incorporated into the RPM. Such a WOWA RPM approach uses importance weights to affect achievement importance by rescaling accordingly its measure within the distribution of achievements rather than by straightforward rescaling of achievement values. The recent progress in optimization methods for ordered averages allows one to implement the WOWA RPM quite effectively as extension of the original constraints and criteria with simple linear inequalities. There is shown that the OWA and WOWA RPM models meet the crucial requirements with respect to the efficiency of generated solutions as well as the controllability of interactive analysis by the reference levels.     

A multiple criteria ranking procedure based on distance between partial preorders

In this paper, a multiple criteria ranking procedure based on distance between partial preorders is proposed. This method consists of two phases. In the first phase, the decision maker is asked to rank alternatives with a preorder (complete or partial) for each criterion and provide complete or partial linear information about the relative importance (weights) of the criteria. In the second phase, we introduce a distance procedure to aggregate the above individual rankings into a global ranking (a partial preorder). An algorithm for the aggregation procedure is proposed, followed by a numerical illustration.     

考虑评价信息满意度的群体信息集结方法研究

信息集结方法是群体评价的重要研究内容,针对该问题本文对评价信息满意度进行测度,并基于此对群体信息的集结方法展开研究。该方法根据指标信息的变化赋予评价者不同的权重,以改变现有研究中评价者权重大多固定不变的做法,旨在使群体信息集结的结果更加公正和准确。首先对问题进行界定并给出评价信息满意度的定义;然后分别给出先验信息满意度和评价过程中的信息满意度的确定方法,利用先验信息满意度确定各评价者的初始权重,并利用评价过程中的信息满意度对其修正,从而得到各评价者的权重矩阵。最后,按照各评价者的评价信息满意度对群体评价信息进行集结。     

Rank reversals in multi-criteria decision analysis with statistical modelling of ratio-scale pairwise comparisons

In multi-criteria decision analysis, the overall performance of decision alternatives is evaluated with respect to several, generally conflicting decision criteria. One approach to perform the multi-criteria decision analysis is to use ratio-scale pairwise comparisons concerning the performance of decision alternatives and the importance of decision criteria. In this approach, a classical problem has been the phenomenon of rank reversals. In particular, when a new decision alternative is added to a decision problem, and while the assessments concerning the original decision alternatives remain unchanged, the new alternative may cause rank reversals between the utility estimates of the original decision alternatives. This paper studies the connections between rank reversals and the potential inconsistency of the utility assessments in the case of ratio-scale pairwise comparisons data. The analysis was carried out by recently developed statistical modelling techniques so that the inconsistency of the assessments was measured according to statistical estimation theory. Several type of decision problems were analysed and the results showed that rank reversals caused by inconsistency are natural and acceptable. On the other hand, rank reversals caused by the traditional arithmetic-mean aggregation rule are not in line with the ratio-scale measurement of utilities, whereas geometric-mean aggregation does not cause undesired rank reversals.     

An application-based characterization of dynamical distance geometry problems

The dynamical distance geometry problem (dynDGP) is the problem of finding a realization in a Euclidean space of a weighted undirected graph G representing an animation by relative distances, so that the distances between realized vertices are as close as possible to the edge weights. In the dynDGP, the vertex set of the graph G is the set product of V, representing certain objects, and T, representing time as a sequence of discrete steps. We suppose moreover that distance information is given together with the priority of every distance value. The dynDGP is a special class of the DGP where the dynamics of the problem comes to play an important role. In this work, we propose an application-based characterization of dynDGP instances, where the main criteria are the presence or absence of a skeletal structure, and the rigidity of such a skeletal structure. Examples of considered applications include: multi-robot coordination, crowd simulations, and human motion retargeting.     

Inferring consensus weights from pairwise comparison matrices without suitable properties

Pairwise comparison is a popular method for establishing the relative importance of n objects. Its main purpose is to get a set of weights (priority vector) associated with the objects. When the information gathered from the decision maker does not verify some rational properties, it is not easy to search the priority vector. Goal programming is a flexible tool for addressing this type of problem. In this paper, we focus on a group decision-making scenario. Thus, we analyze different methodologies for getting a collective priority vector. The first method is to aggregate general pairwise comparison matrices (i.e., matrices without suitable properties) and then get the priority vector from the consensus matrix. The second method proposes to get the collective priority vector by formulating an optimization problem without determining the consensus pairwise comparison matrix beforehand.